./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-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 e2cb3c9a8570b7ee66b623ed5fd2a1832f018e766f6bb5120cee7430951770d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:27:20,183 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:27:20,234 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:27:20,241 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:27:20,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:27:20,256 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:27:20,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:27:20,257 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:27:20,257 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:27:20,257 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:27:20,258 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:27:20,258 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:27:20,258 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:27:20,258 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:27:20,258 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:27:20,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:27:20,258 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:27:20,258 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:27:20,259 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:27:20,259 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:27:20,259 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:27:20,259 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:27:20,259 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:27:20,259 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:27:20,259 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:27:20,259 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:27:20,259 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:27:20,259 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:27:20,259 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:27:20,259 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:27:20,259 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:27:20,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:27:20,260 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:27:20,260 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:27:20,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:27:20,260 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:27:20,260 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:27:20,260 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:27:20,260 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:27:20,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:27:20,260 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:27:20,260 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:27:20,260 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:27:20,261 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:27:20,261 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:27:20,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:27:20,261 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:27:20,261 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:27:20,261 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:27:20,261 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:27:20,261 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 -> e2cb3c9a8570b7ee66b623ed5fd2a1832f018e766f6bb5120cee7430951770d6 [2025-01-10 06:27:20,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:27:20,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:27:20,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:27:20,528 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:27:20,529 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:27:20,530 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_SAX_test9-1.i [2025-01-10 06:27:21,648 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4f4d7b70/5b599ad375a84f088f6bea7a42727519/FLAG267551946 [2025-01-10 06:27:21,989 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:27:21,989 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test9-1.i [2025-01-10 06:27:22,007 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4f4d7b70/5b599ad375a84f088f6bea7a42727519/FLAG267551946 [2025-01-10 06:27:22,022 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4f4d7b70/5b599ad375a84f088f6bea7a42727519 [2025-01-10 06:27:22,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:27:22,025 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:27:22,026 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:27:22,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:27:22,030 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:27:22,030 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:27:22" (1/1) ... [2025-01-10 06:27:22,031 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e3ad7c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:27:22, skipping insertion in model container [2025-01-10 06:27:22,031 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:27:22" (1/1) ... [2025-01-10 06:27:22,084 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:27:22,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:27:22,537 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:27:22,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:27:22,684 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:27:22,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:27:22 WrapperNode [2025-01-10 06:27:22,687 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:27:22,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:27:22,688 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:27:22,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:27:22,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:27:22" (1/1) ... [2025-01-10 06:27:22,719 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:27:22" (1/1) ... [2025-01-10 06:27:22,817 INFO L138 Inliner]: procedures = 177, calls = 724, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3252 [2025-01-10 06:27:22,818 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:27:22,819 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:27:22,820 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:27:22,820 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:27:22,828 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:27:22" (1/1) ... [2025-01-10 06:27:22,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:27:22" (1/1) ... [2025-01-10 06:27:22,837 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:27:22" (1/1) ... [2025-01-10 06:27:22,892 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 172, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2025-01-10 06:27:22,893 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:27:22" (1/1) ... [2025-01-10 06:27:22,893 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:27:22" (1/1) ... [2025-01-10 06:27:22,932 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:27:22" (1/1) ... [2025-01-10 06:27:22,935 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:27:22" (1/1) ... [2025-01-10 06:27:22,955 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:27:22" (1/1) ... [2025-01-10 06:27:22,965 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:27:22" (1/1) ... [2025-01-10 06:27:22,973 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:27:22" (1/1) ... [2025-01-10 06:27:22,990 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:27:22,991 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:27:22,991 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:27:22,992 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:27:22,992 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:27:22" (1/1) ... [2025-01-10 06:27:22,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:27:23,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:27:23,022 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:27:23,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:27:23,046 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-01-10 06:27:23,047 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-01-10 06:27:23,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:27:23,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:27:23,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:27:23,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 06:27:23,047 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 06:27:23,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:27:23,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:27:23,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:27:23,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-10 06:27:23,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-10 06:27:23,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-10 06:27:23,048 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-10 06:27:23,048 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-10 06:27:23,048 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-10 06:27:23,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:27:23,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:27:23,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 06:27:23,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 06:27:23,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 06:27:23,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:27:23,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 06:27:23,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 06:27:23,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 06:27:23,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:27:23,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:27:23,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:27:23,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:27:23,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:27:23,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:27:23,223 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:27:23,225 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:27:25,373 INFO L? ?]: Removed 808 outVars from TransFormulas that were not future-live. [2025-01-10 06:27:25,373 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:27:25,412 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:27:25,412 INFO L312 CfgBuilder]: Removed 27 assume(true) statements. [2025-01-10 06:27:25,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:27:25 BoogieIcfgContainer [2025-01-10 06:27:25,412 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:27:25,415 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:27:25,415 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:27:25,419 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:27:25,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:27:22" (1/3) ... [2025-01-10 06:27:25,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@283c565e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:27:25, skipping insertion in model container [2025-01-10 06:27:25,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:27:22" (2/3) ... [2025-01-10 06:27:25,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@283c565e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:27:25, skipping insertion in model container [2025-01-10 06:27:25,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:27:25" (3/3) ... [2025-01-10 06:27:25,421 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test9-1.i [2025-01-10 06:27:25,431 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:27:25,433 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test9-1.i that has 6 procedures, 1395 locations, 1 initial locations, 33 loop locations, and 8 error locations. [2025-01-10 06:27:25,522 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:27:25,533 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;@75f182d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:27:25,533 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 06:27:25,542 INFO L276 IsEmpty]: Start isEmpty. Operand has 1387 states, 870 states have (on average 1.835632183908046) internal successors, (1597), 1380 states have internal predecessors, (1597), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2025-01-10 06:27:25,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 06:27:25,546 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:27:25,546 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:27:25,547 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:27:25,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:27:25,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1000487724, now seen corresponding path program 1 times [2025-01-10 06:27:25,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:27:25,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345769034] [2025-01-10 06:27:25,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:27:25,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:27:25,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:27:25,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:27:25,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:27:25,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 06:27:25,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [709620768] [2025-01-10 06:27:25,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:27:25,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:27:25,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:27:25,657 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:27:25,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:27:25,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:27:25,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:27:25,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:27:25,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:27:25,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:27:25,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:27:25,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 06:27:25,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:27:25,835 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:27:25,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:27:25,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345769034] [2025-01-10 06:27:25,836 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 06:27:25,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709620768] [2025-01-10 06:27:25,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709620768] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:27:25,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:27:25,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:27:25,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908130741] [2025-01-10 06:27:25,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:27:25,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:27:25,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:27:25,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:27:25,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:27:25,861 INFO L87 Difference]: Start difference. First operand has 1387 states, 870 states have (on average 1.835632183908046) internal successors, (1597), 1380 states have internal predecessors, (1597), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:27:26,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:27:26,819 INFO L93 Difference]: Finished difference Result 4138 states and 8801 transitions. [2025-01-10 06:27:26,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:27:26,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 06:27:26,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:27:26,857 INFO L225 Difference]: With dead ends: 4138 [2025-01-10 06:27:26,857 INFO L226 Difference]: Without dead ends: 2744 [2025-01-10 06:27:26,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:27:26,869 INFO L435 NwaCegarLoop]: 2809 mSDtfsCounter, 1519 mSDsluCounter, 4825 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2022 SdHoareTripleChecker+Valid, 7634 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-10 06:27:26,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2022 Valid, 7634 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 06:27:26,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2744 states. [2025-01-10 06:27:27,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2744 to 1385. [2025-01-10 06:27:27,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 872 states have (on average 1.768348623853211) internal successors, (1542), 1379 states have internal predecessors, (1542), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-01-10 06:27:27,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2548 transitions. [2025-01-10 06:27:27,213 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2548 transitions. Word has length 8 [2025-01-10 06:27:27,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:27:27,214 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 2548 transitions. [2025-01-10 06:27:27,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:27:27,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2548 transitions. [2025-01-10 06:27:27,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-10 06:27:27,216 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:27:27,216 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] [2025-01-10 06:27:27,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 06:27:27,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-10 06:27:27,435 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:27:27,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:27:27,436 INFO L85 PathProgramCache]: Analyzing trace with hash -425962322, now seen corresponding path program 1 times [2025-01-10 06:27:27,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:27:27,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270061293] [2025-01-10 06:27:27,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:27:27,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:27:27,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 06:27:27,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 06:27:27,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:27:27,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:27:27,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:27:27,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:27:27,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270061293] [2025-01-10 06:27:27,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270061293] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:27:27,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:27:27,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:27:27,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293709109] [2025-01-10 06:27:27,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:27:27,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:27:27,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:27:27,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:27:27,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:27:27,821 INFO L87 Difference]: Start difference. First operand 1385 states and 2548 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:27:28,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:27:28,469 INFO L93 Difference]: Finished difference Result 3912 states and 7311 transitions. [2025-01-10 06:27:28,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:27:28,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 63 [2025-01-10 06:27:28,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:27:28,488 INFO L225 Difference]: With dead ends: 3912 [2025-01-10 06:27:28,488 INFO L226 Difference]: Without dead ends: 2743 [2025-01-10 06:27:28,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:27:28,494 INFO L435 NwaCegarLoop]: 2772 mSDtfsCounter, 1519 mSDsluCounter, 4785 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2022 SdHoareTripleChecker+Valid, 7557 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 06:27:28,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2022 Valid, 7557 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 06:27:28,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2743 states. [2025-01-10 06:27:28,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2743 to 1385. [2025-01-10 06:27:28,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 872 states have (on average 1.7672018348623852) internal successors, (1541), 1379 states have internal predecessors, (1541), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-01-10 06:27:28,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2547 transitions. [2025-01-10 06:27:28,691 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2547 transitions. Word has length 63 [2025-01-10 06:27:28,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:27:28,692 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 2547 transitions. [2025-01-10 06:27:28,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:27:28,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2547 transitions. [2025-01-10 06:27:28,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-10 06:27:28,695 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:27:28,695 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:27:28,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:27:28,695 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:27:28,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:27:28,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1666939625, now seen corresponding path program 1 times [2025-01-10 06:27:28,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:27:28,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039833954] [2025-01-10 06:27:28,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:27:28,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:27:28,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-10 06:27:28,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-10 06:27:28,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:27:28,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:27:28,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:27:28,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:27:28,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039833954] [2025-01-10 06:27:28,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039833954] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:27:28,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:27:28,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:27:28,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027683035] [2025-01-10 06:27:28,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:27:28,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:27:28,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:27:28,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:27:28,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:27:28,901 INFO L87 Difference]: Start difference. First operand 1385 states and 2547 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:27:29,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:27:29,015 INFO L93 Difference]: Finished difference Result 2719 states and 5019 transitions. [2025-01-10 06:27:29,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:27:29,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-10 06:27:29,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:27:29,024 INFO L225 Difference]: With dead ends: 2719 [2025-01-10 06:27:29,024 INFO L226 Difference]: Without dead ends: 1343 [2025-01-10 06:27:29,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:27:29,028 INFO L435 NwaCegarLoop]: 2439 mSDtfsCounter, 30 mSDsluCounter, 4859 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 7298 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:27:29,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 7298 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:27:29,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2025-01-10 06:27:29,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1343. [2025-01-10 06:27:29,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 830 states have (on average 1.763855421686747) internal successors, (1464), 1337 states have internal predecessors, (1464), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-01-10 06:27:29,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 2470 transitions. [2025-01-10 06:27:29,158 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 2470 transitions. Word has length 81 [2025-01-10 06:27:29,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:27:29,158 INFO L471 AbstractCegarLoop]: Abstraction has 1343 states and 2470 transitions. [2025-01-10 06:27:29,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:27:29,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 2470 transitions. [2025-01-10 06:27:29,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-10 06:27:29,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:27:29,160 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:27:29,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:27:29,161 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:27:29,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:27:29,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1538676899, now seen corresponding path program 1 times [2025-01-10 06:27:29,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:27:29,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293422505] [2025-01-10 06:27:29,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:27:29,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:27:29,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-10 06:27:29,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-10 06:27:29,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:27:29,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:27:29,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:27:29,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:27:29,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293422505] [2025-01-10 06:27:29,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293422505] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:27:29,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:27:29,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:27:29,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425989692] [2025-01-10 06:27:29,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:27:29,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:27:29,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:27:29,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:27:29,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:27:29,289 INFO L87 Difference]: Start difference. First operand 1343 states and 2470 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:27:29,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:27:29,396 INFO L93 Difference]: Finished difference Result 3904 states and 7257 transitions. [2025-01-10 06:27:29,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:27:29,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-10 06:27:29,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:27:29,413 INFO L225 Difference]: With dead ends: 3904 [2025-01-10 06:27:29,413 INFO L226 Difference]: Without dead ends: 2570 [2025-01-10 06:27:29,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:27:29,419 INFO L435 NwaCegarLoop]: 2931 mSDtfsCounter, 1266 mSDsluCounter, 2443 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1766 SdHoareTripleChecker+Valid, 5374 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:27:29,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1766 Valid, 5374 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:27:29,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2025-01-10 06:27:29,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2566. [2025-01-10 06:27:29,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2566 states, 1553 states have (on average 1.7952350289761752) internal successors, (2788), 2560 states have internal predecessors, (2788), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-01-10 06:27:29,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 4794 transitions. [2025-01-10 06:27:29,642 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 4794 transitions. Word has length 81 [2025-01-10 06:27:29,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:27:29,642 INFO L471 AbstractCegarLoop]: Abstraction has 2566 states and 4794 transitions. [2025-01-10 06:27:29,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:27:29,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 4794 transitions. [2025-01-10 06:27:29,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-10 06:27:29,643 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:27:29,643 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:27:29,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:27:29,644 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:27:29,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:27:29,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1832750465, now seen corresponding path program 1 times [2025-01-10 06:27:29,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:27:29,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858319321] [2025-01-10 06:27:29,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:27:29,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:27:29,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-10 06:27:29,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-10 06:27:29,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:27:29,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:27:29,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:27:29,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:27:29,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858319321] [2025-01-10 06:27:29,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858319321] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:27:29,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:27:29,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:27:29,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691069736] [2025-01-10 06:27:29,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:27:29,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:27:29,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:27:29,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:27:29,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:27:29,989 INFO L87 Difference]: Start difference. First operand 2566 states and 4794 transitions. Second operand has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:27:30,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:27:30,631 INFO L93 Difference]: Finished difference Result 4807 states and 9134 transitions. [2025-01-10 06:27:30,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:27:30,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 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 96 [2025-01-10 06:27:30,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:27:30,663 INFO L225 Difference]: With dead ends: 4807 [2025-01-10 06:27:30,663 INFO L226 Difference]: Without dead ends: 4805 [2025-01-10 06:27:30,667 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-01-10 06:27:30,668 INFO L435 NwaCegarLoop]: 2664 mSDtfsCounter, 1350 mSDsluCounter, 4593 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1851 SdHoareTripleChecker+Valid, 7257 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 06:27:30,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1851 Valid, 7257 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 06:27:30,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4805 states. [2025-01-10 06:27:31,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4805 to 2630. [2025-01-10 06:27:31,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2630 states, 1614 states have (on average 1.775712515489467) internal successors, (2866), 2621 states have internal predecessors, (2866), 1006 states have call successors, (1006), 2 states have call predecessors, (1006), 2 states have return successors, (1006), 8 states have call predecessors, (1006), 1006 states have call successors, (1006) [2025-01-10 06:27:31,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 4878 transitions. [2025-01-10 06:27:31,062 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 4878 transitions. Word has length 96 [2025-01-10 06:27:31,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:27:31,063 INFO L471 AbstractCegarLoop]: Abstraction has 2630 states and 4878 transitions. [2025-01-10 06:27:31,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:27:31,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 4878 transitions. [2025-01-10 06:27:31,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-10 06:27:31,067 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:27:31,067 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-01-10 06:27:31,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:27:31,067 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:27:31,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:27:31,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1187225628, now seen corresponding path program 1 times [2025-01-10 06:27:31,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:27:31,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130173594] [2025-01-10 06:27:31,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:27:31,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:27:31,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 06:27:31,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 06:27:31,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:27:31,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:27:31,469 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:27:31,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:27:31,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130173594] [2025-01-10 06:27:31,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130173594] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:27:31,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279062686] [2025-01-10 06:27:31,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:27:31,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:27:31,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:27:31,473 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:27:31,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:27:31,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 06:27:31,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 06:27:31,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:27:31,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:27:31,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-10 06:27:31,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:27:31,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 06:27:31,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 06:27:31,755 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-01-10 06:27:32,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:27:32,090 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 54 treesize of output 38 [2025-01-10 06:27:32,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:27:32,270 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:27:32,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279062686] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:27:32,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:27:32,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-01-10 06:27:32,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966807067] [2025-01-10 06:27:32,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:27:32,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 06:27:32,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:27:32,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 06:27:32,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:27:32,272 INFO L87 Difference]: Start difference. First operand 2630 states and 4878 transitions. Second operand has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 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-01-10 06:27:33,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:27:33,782 INFO L93 Difference]: Finished difference Result 7403 states and 13971 transitions. [2025-01-10 06:27:33,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:27:33,783 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 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 103 [2025-01-10 06:27:33,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:27:33,818 INFO L225 Difference]: With dead ends: 7403 [2025-01-10 06:27:33,818 INFO L226 Difference]: Without dead ends: 4819 [2025-01-10 06:27:33,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2025-01-10 06:27:33,828 INFO L435 NwaCegarLoop]: 2686 mSDtfsCounter, 1578 mSDsluCounter, 12433 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2080 SdHoareTripleChecker+Valid, 15119 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:27:33,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2080 Valid, 15119 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-10 06:27:33,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4819 states. [2025-01-10 06:27:34,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4819 to 2630. [2025-01-10 06:27:34,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2630 states, 1614 states have (on average 1.775092936802974) internal successors, (2865), 2621 states have internal predecessors, (2865), 1006 states have call successors, (1006), 2 states have call predecessors, (1006), 2 states have return successors, (1006), 8 states have call predecessors, (1006), 1006 states have call successors, (1006) [2025-01-10 06:27:34,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 4877 transitions. [2025-01-10 06:27:34,220 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 4877 transitions. Word has length 103 [2025-01-10 06:27:34,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:27:34,220 INFO L471 AbstractCegarLoop]: Abstraction has 2630 states and 4877 transitions. [2025-01-10 06:27:34,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 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-01-10 06:27:34,220 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 4877 transitions. [2025-01-10 06:27:34,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-10 06:27:34,221 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:27:34,221 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-01-10 06:27:34,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 06:27:34,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:27:34,425 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:27:34,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:27:34,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1525330303, now seen corresponding path program 1 times [2025-01-10 06:27:34,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:27:34,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536783093] [2025-01-10 06:27:34,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:27:34,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:27:34,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-10 06:27:34,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-10 06:27:34,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:27:34,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:27:34,786 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:27:34,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:27:34,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536783093] [2025-01-10 06:27:34,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536783093] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:27:34,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108581298] [2025-01-10 06:27:34,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:27:34,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:27:34,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:27:34,788 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:27:34,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 06:27:34,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-10 06:27:35,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-10 06:27:35,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:27:35,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:27:35,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-10 06:27:35,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:28:03,530 WARN L286 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-10 06:28:15,548 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-10 06:28:36,576 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-10 06:28:47,558 WARN L286 SmtUtils]: Spent 10.98s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)