./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-2.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_JEN_test8-2.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 80f1df6d4bc7961b41bec7d16d328ef23e1639399b1fb3a18bcdda9891a98148 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:20:25,518 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:20:25,559 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:20:25,564 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:20:25,565 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:20:25,589 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:20:25,589 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:20:25,589 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:20:25,590 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:20:25,590 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:20:25,590 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:20:25,590 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:20:25,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:20:25,590 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:20:25,590 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:20:25,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:20:25,591 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:20:25,591 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:20:25,591 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:20:25,591 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:20:25,591 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:20:25,591 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:20:25,591 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:20:25,591 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:20:25,591 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:20:25,591 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:20:25,591 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:20:25,592 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:20:25,592 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:20:25,592 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:20:25,592 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:20:25,592 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:20:25,592 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:20:25,592 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:20:25,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:20:25,592 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:20:25,592 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:20:25,592 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:20:25,593 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:20:25,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:20:25,593 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:20:25,593 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:20:25,593 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:20:25,593 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:20:25,593 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:20:25,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:20:25,593 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:20:25,593 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:20:25,593 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:20:25,593 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:20:25,594 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 -> 80f1df6d4bc7961b41bec7d16d328ef23e1639399b1fb3a18bcdda9891a98148 [2025-01-10 06:20:25,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:20:25,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:20:25,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:20:25,787 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:20:25,788 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:20:25,789 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_JEN_test8-2.i [2025-01-10 06:20:27,006 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/25f60c3fd/bf48de5b2ed74bbd8f86e6331b8945d2/FLAG2b5d7f567 [2025-01-10 06:20:27,361 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:20:27,362 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test8-2.i [2025-01-10 06:20:27,373 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/25f60c3fd/bf48de5b2ed74bbd8f86e6331b8945d2/FLAG2b5d7f567 [2025-01-10 06:20:27,383 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/25f60c3fd/bf48de5b2ed74bbd8f86e6331b8945d2 [2025-01-10 06:20:27,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:20:27,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:20:27,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:20:27,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:20:27,389 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:20:27,390 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:20:27" (1/1) ... [2025-01-10 06:20:27,390 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@227e8e18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:27, skipping insertion in model container [2025-01-10 06:20:27,390 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:20:27" (1/1) ... [2025-01-10 06:20:27,413 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:20:27,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:20:27,780 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:20:27,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:20:27,889 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:20:27,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:27 WrapperNode [2025-01-10 06:20:27,892 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:20:27,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:20:27,893 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:20:27,893 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:20:27,899 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:20:27" (1/1) ... [2025-01-10 06:20:27,925 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:20:27" (1/1) ... [2025-01-10 06:20:27,984 INFO L138 Inliner]: procedures = 177, calls = 342, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1546 [2025-01-10 06:20:27,985 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:20:27,986 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:20:27,986 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:20:27,986 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:20:27,992 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:27" (1/1) ... [2025-01-10 06:20:27,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:27" (1/1) ... [2025-01-10 06:20:28,006 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:27" (1/1) ... [2025-01-10 06:20:28,077 INFO L175 MemorySlicer]: Split 304 memory accesses to 3 slices as follows [2, 34, 268]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 4, 58]. [2025-01-10 06:20:28,082 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:27" (1/1) ... [2025-01-10 06:20:28,082 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:27" (1/1) ... [2025-01-10 06:20:28,117 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:27" (1/1) ... [2025-01-10 06:20:28,120 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:27" (1/1) ... [2025-01-10 06:20:28,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:27" (1/1) ... [2025-01-10 06:20:28,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:27" (1/1) ... [2025-01-10 06:20:28,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:27" (1/1) ... [2025-01-10 06:20:28,168 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:20:28,169 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:20:28,169 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:20:28,170 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:20:28,170 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:27" (1/1) ... [2025-01-10 06:20:28,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:20:28,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:20:28,197 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:20:28,203 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:20:28,218 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-01-10 06:20:28,218 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-01-10 06:20:28,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:20:28,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:20:28,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:20:28,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 06:20:28,218 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 06:20:28,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:20:28,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:20:28,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:20:28,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-10 06:20:28,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-10 06:20:28,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-10 06:20:28,218 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-10 06:20:28,218 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-10 06:20:28,218 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-10 06:20:28,218 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2025-01-10 06:20:28,218 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2025-01-10 06:20:28,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:20:28,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:20:28,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 06:20:28,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 06:20:28,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 06:20:28,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:20:28,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 06:20:28,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 06:20:28,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 06:20:28,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:20:28,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:20:28,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:20:28,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:20:28,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:20:28,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:20:28,418 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:20:28,419 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:20:29,505 INFO L? ?]: Removed 365 outVars from TransFormulas that were not future-live. [2025-01-10 06:20:29,505 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:20:29,515 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:20:29,516 INFO L312 CfgBuilder]: Removed 35 assume(true) statements. [2025-01-10 06:20:29,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:20:29 BoogieIcfgContainer [2025-01-10 06:20:29,516 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:20:29,517 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:20:29,517 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:20:29,520 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:20:29,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:20:27" (1/3) ... [2025-01-10 06:20:29,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35cddfb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:20:29, skipping insertion in model container [2025-01-10 06:20:29,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:20:27" (2/3) ... [2025-01-10 06:20:29,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35cddfb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:20:29, skipping insertion in model container [2025-01-10 06:20:29,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:20:29" (3/3) ... [2025-01-10 06:20:29,522 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test8-2.i [2025-01-10 06:20:29,531 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:20:29,532 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test8-2.i that has 7 procedures, 492 locations, 1 initial locations, 42 loop locations, and 8 error locations. [2025-01-10 06:20:29,569 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:20:29,576 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;@2eb1d567, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:20:29,577 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 06:20:29,580 INFO L276 IsEmpty]: Start isEmpty. Operand has 484 states, 449 states have (on average 1.6258351893095768) internal successors, (730), 474 states have internal predecessors, (730), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-10 06:20:29,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 06:20:29,583 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:29,583 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:29,584 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:20:29,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:29,587 INFO L85 PathProgramCache]: Analyzing trace with hash -322566998, now seen corresponding path program 1 times [2025-01-10 06:20:29,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:29,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808691040] [2025-01-10 06:20:29,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:29,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:29,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:20:29,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:20:29,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:29,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:29,688 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:20:29,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:29,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808691040] [2025-01-10 06:20:29,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808691040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:20:29,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:20:29,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:20:29,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934108700] [2025-01-10 06:20:29,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:20:29,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 06:20:29,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:29,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 06:20:29,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 06:20:29,709 INFO L87 Difference]: Start difference. First operand has 484 states, 449 states have (on average 1.6258351893095768) internal successors, (730), 474 states have internal predecessors, (730), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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:20:29,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:29,775 INFO L93 Difference]: Finished difference Result 964 states and 1562 transitions. [2025-01-10 06:20:29,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 06:20:29,776 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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:20:29,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:29,787 INFO L225 Difference]: With dead ends: 964 [2025-01-10 06:20:29,787 INFO L226 Difference]: Without dead ends: 442 [2025-01-10 06:20:29,792 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-01-10 06:20:29,795 INFO L435 NwaCegarLoop]: 699 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:29,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:20:29,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-01-10 06:20:29,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2025-01-10 06:20:29,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 411 states have (on average 1.4720194647201947) internal successors, (605), 433 states have internal predecessors, (605), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-10 06:20:29,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 645 transitions. [2025-01-10 06:20:29,855 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 645 transitions. Word has length 8 [2025-01-10 06:20:29,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:29,855 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 645 transitions. [2025-01-10 06:20:29,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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:20:29,856 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 645 transitions. [2025-01-10 06:20:29,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 06:20:29,856 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:29,856 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:29,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:20:29,857 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:20:29,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:29,858 INFO L85 PathProgramCache]: Analyzing trace with hash -322565076, now seen corresponding path program 1 times [2025-01-10 06:20:29,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:29,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690068286] [2025-01-10 06:20:29,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:29,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:29,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:20:29,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:20:29,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:29,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 06:20:29,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [617006113] [2025-01-10 06:20:29,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:29,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:20:29,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:20:29,906 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:20:29,910 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:20:30,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:20:30,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:20:30,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:30,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:30,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:20:30,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:20:30,084 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:20:30,116 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:20:30,116 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:20:30,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:30,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690068286] [2025-01-10 06:20:30,117 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 06:20:30,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617006113] [2025-01-10 06:20:30,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617006113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:20:30,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:20:30,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:20:30,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316137507] [2025-01-10 06:20:30,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:20:30,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:20:30,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:30,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:20:30,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:20:30,119 INFO L87 Difference]: Start difference. First operand 442 states and 645 transitions. 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:20:30,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:30,268 INFO L93 Difference]: Finished difference Result 836 states and 1214 transitions. [2025-01-10 06:20:30,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:20:30,268 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:20:30,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:30,272 INFO L225 Difference]: With dead ends: 836 [2025-01-10 06:20:30,273 INFO L226 Difference]: Without dead ends: 834 [2025-01-10 06:20:30,273 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:20:30,273 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 551 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:30,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1859 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:20:30,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2025-01-10 06:20:30,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 449. [2025-01-10 06:20:30,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 418 states have (on average 1.4665071770334928) internal successors, (613), 440 states have internal predecessors, (613), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-10 06:20:30,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 653 transitions. [2025-01-10 06:20:30,301 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 653 transitions. Word has length 8 [2025-01-10 06:20:30,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:30,301 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 653 transitions. [2025-01-10 06:20:30,301 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:20:30,301 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 653 transitions. [2025-01-10 06:20:30,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-10 06:20:30,303 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:30,303 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] [2025-01-10 06:20:30,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:20:30,504 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-01-10 06:20:30,505 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:20:30,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:30,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1084130197, now seen corresponding path program 1 times [2025-01-10 06:20:30,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:30,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70653410] [2025-01-10 06:20:30,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:30,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:30,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-10 06:20:30,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-10 06:20:30,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:30,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:30,940 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:20:30,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:30,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70653410] [2025-01-10 06:20:30,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70653410] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:20:30,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:20:30,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:20:30,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178290679] [2025-01-10 06:20:30,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:20:30,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:20:30,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:30,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:20:30,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:20:30,942 INFO L87 Difference]: Start difference. First operand 449 states and 653 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:20:31,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:31,048 INFO L93 Difference]: Finished difference Result 1064 states and 1556 transitions. [2025-01-10 06:20:31,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:20:31,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-01-10 06:20:31,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:31,052 INFO L225 Difference]: With dead ends: 1064 [2025-01-10 06:20:31,052 INFO L226 Difference]: Without dead ends: 833 [2025-01-10 06:20:31,053 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:20:31,053 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 553 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:31,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1950 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:20:31,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-01-10 06:20:31,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 449. [2025-01-10 06:20:31,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 418 states have (on average 1.4641148325358853) internal successors, (612), 440 states have internal predecessors, (612), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-10 06:20:31,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 652 transitions. [2025-01-10 06:20:31,077 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 652 transitions. Word has length 71 [2025-01-10 06:20:31,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:31,077 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 652 transitions. [2025-01-10 06:20:31,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:20:31,078 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 652 transitions. [2025-01-10 06:20:31,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-10 06:20:31,080 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:31,080 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:31,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:20:31,080 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:20:31,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:31,081 INFO L85 PathProgramCache]: Analyzing trace with hash 2125601434, now seen corresponding path program 1 times [2025-01-10 06:20:31,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:31,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620808213] [2025-01-10 06:20:31,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:31,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:31,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-10 06:20:31,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-10 06:20:31,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:31,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:31,250 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:20:31,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:31,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620808213] [2025-01-10 06:20:31,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620808213] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:20:31,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:20:31,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:20:31,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295121305] [2025-01-10 06:20:31,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:20:31,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:20:31,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:31,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:20:31,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:20:31,252 INFO L87 Difference]: Start difference. First operand 449 states and 652 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:20:31,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:31,330 INFO L93 Difference]: Finished difference Result 892 states and 1298 transitions. [2025-01-10 06:20:31,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:20:31,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-01-10 06:20:31,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:31,332 INFO L225 Difference]: With dead ends: 892 [2025-01-10 06:20:31,333 INFO L226 Difference]: Without dead ends: 452 [2025-01-10 06:20:31,333 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:20:31,336 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 106 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1761 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:31,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1761 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:20:31,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-01-10 06:20:31,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 449. [2025-01-10 06:20:31,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 418 states have (on average 1.4473684210526316) internal successors, (605), 440 states have internal predecessors, (605), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-10 06:20:31,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 645 transitions. [2025-01-10 06:20:31,354 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 645 transitions. Word has length 83 [2025-01-10 06:20:31,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:31,355 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 645 transitions. [2025-01-10 06:20:31,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:20:31,355 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 645 transitions. [2025-01-10 06:20:31,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-10 06:20:31,357 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:31,357 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:31,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:20:31,357 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:20:31,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:31,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1221497036, now seen corresponding path program 1 times [2025-01-10 06:20:31,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:31,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344161586] [2025-01-10 06:20:31,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:31,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:31,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-10 06:20:31,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-10 06:20:31,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:31,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:31,492 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:20:31,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:31,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344161586] [2025-01-10 06:20:31,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344161586] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:20:31,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:20:31,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:20:31,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452178462] [2025-01-10 06:20:31,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:20:31,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:20:31,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:31,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:20:31,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:20:31,494 INFO L87 Difference]: Start difference. First operand 449 states and 645 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:20:31,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:31,539 INFO L93 Difference]: Finished difference Result 841 states and 1206 transitions. [2025-01-10 06:20:31,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:20:31,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-01-10 06:20:31,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:31,541 INFO L225 Difference]: With dead ends: 841 [2025-01-10 06:20:31,541 INFO L226 Difference]: Without dead ends: 401 [2025-01-10 06:20:31,542 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:20:31,542 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 9 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1610 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:31,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1610 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:20:31,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-01-10 06:20:31,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2025-01-10 06:20:31,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 370 states have (on average 1.4189189189189189) internal successors, (525), 392 states have internal predecessors, (525), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-10 06:20:31,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 565 transitions. [2025-01-10 06:20:31,551 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 565 transitions. Word has length 83 [2025-01-10 06:20:31,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:31,551 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 565 transitions. [2025-01-10 06:20:31,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:20:31,551 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 565 transitions. [2025-01-10 06:20:31,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-10 06:20:31,552 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:31,552 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:31,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:20:31,553 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:20:31,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:31,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1180822286, now seen corresponding path program 1 times [2025-01-10 06:20:31,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:31,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011179657] [2025-01-10 06:20:31,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:31,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:31,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-10 06:20:31,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-10 06:20:31,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:31,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:31,662 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:20:31,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:31,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011179657] [2025-01-10 06:20:31,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011179657] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:20:31,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:20:31,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:20:31,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814247269] [2025-01-10 06:20:31,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:20:31,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:20:31,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:31,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:20:31,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:20:31,664 INFO L87 Difference]: Start difference. First operand 401 states and 565 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:20:31,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:31,736 INFO L93 Difference]: Finished difference Result 1037 states and 1471 transitions. [2025-01-10 06:20:31,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:20:31,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-01-10 06:20:31,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:31,740 INFO L225 Difference]: With dead ends: 1037 [2025-01-10 06:20:31,740 INFO L226 Difference]: Without dead ends: 645 [2025-01-10 06:20:31,740 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:20:31,741 INFO L435 NwaCegarLoop]: 742 mSDtfsCounter, 292 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:31,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1277 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:20:31,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2025-01-10 06:20:31,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 642. [2025-01-10 06:20:31,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 610 states have (on average 1.4262295081967213) internal successors, (870), 632 states have internal predecessors, (870), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-10 06:20:31,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 912 transitions. [2025-01-10 06:20:31,755 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 912 transitions. Word has length 83 [2025-01-10 06:20:31,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:31,756 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 912 transitions. [2025-01-10 06:20:31,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:20:31,756 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 912 transitions. [2025-01-10 06:20:31,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-10 06:20:31,757 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:31,757 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:31,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:20:31,757 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:20:31,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:31,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1658070798, now seen corresponding path program 1 times [2025-01-10 06:20:31,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:31,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676828306] [2025-01-10 06:20:31,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:31,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:31,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-10 06:20:31,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-10 06:20:31,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:31,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:31,996 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:20:31,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:31,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676828306] [2025-01-10 06:20:31,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676828306] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:20:31,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:20:31,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:20:31,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707161941] [2025-01-10 06:20:31,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:20:31,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:20:31,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:31,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:20:32,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:20:32,001 INFO L87 Difference]: Start difference. First operand 642 states and 912 transitions. Second operand has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:20:32,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:32,064 INFO L93 Difference]: Finished difference Result 743 states and 1062 transitions. [2025-01-10 06:20:32,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:20:32,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 98 [2025-01-10 06:20:32,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:32,069 INFO L225 Difference]: With dead ends: 743 [2025-01-10 06:20:32,070 INFO L226 Difference]: Without dead ends: 741 [2025-01-10 06:20:32,070 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:20:32,072 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 144 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:32,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1635 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:20:32,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2025-01-10 06:20:32,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 712. [2025-01-10 06:20:32,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 675 states have (on average 1.411851851851852) internal successors, (953), 697 states have internal predecessors, (953), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (25), 10 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-10 06:20:32,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1003 transitions. [2025-01-10 06:20:32,095 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1003 transitions. Word has length 98 [2025-01-10 06:20:32,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:32,097 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 1003 transitions. [2025-01-10 06:20:32,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:20:32,097 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1003 transitions. [2025-01-10 06:20:32,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-10 06:20:32,098 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:32,098 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:32,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:20:32,099 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:20:32,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:32,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1636125969, now seen corresponding path program 1 times [2025-01-10 06:20:32,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:32,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124261900] [2025-01-10 06:20:32,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:32,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:32,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-10 06:20:32,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-10 06:20:32,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:32,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:32,409 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:20:32,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:32,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124261900] [2025-01-10 06:20:32,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124261900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:20:32,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:20:32,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:20:32,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544013837] [2025-01-10 06:20:32,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:20:32,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:20:32,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:32,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:20:32,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:20:32,412 INFO L87 Difference]: Start difference. First operand 712 states and 1003 transitions. Second operand has 4 states, 3 states have (on average 33.0) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:20:32,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:32,529 INFO L93 Difference]: Finished difference Result 940 states and 1330 transitions. [2025-01-10 06:20:32,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:20:32,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 33.0) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 110 [2025-01-10 06:20:32,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:32,535 INFO L225 Difference]: With dead ends: 940 [2025-01-10 06:20:32,535 INFO L226 Difference]: Without dead ends: 938 [2025-01-10 06:20:32,536 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:20:32,538 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 379 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1602 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:32,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1602 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:20:32,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2025-01-10 06:20:32,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 715. [2025-01-10 06:20:32,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 678 states have (on average 1.4100294985250736) internal successors, (956), 699 states have internal predecessors, (956), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-10 06:20:32,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1006 transitions. [2025-01-10 06:20:32,564 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1006 transitions. Word has length 110 [2025-01-10 06:20:32,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:32,564 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1006 transitions. [2025-01-10 06:20:32,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 33.0) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:20:32,565 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1006 transitions. [2025-01-10 06:20:32,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-10 06:20:32,565 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:32,566 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:32,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:20:32,566 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:20:32,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:32,566 INFO L85 PathProgramCache]: Analyzing trace with hash 813964240, now seen corresponding path program 1 times [2025-01-10 06:20:32,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:32,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627350636] [2025-01-10 06:20:32,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:32,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:32,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-10 06:20:32,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-10 06:20:32,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:32,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:32,889 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:20:32,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:32,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627350636] [2025-01-10 06:20:32,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627350636] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:20:32,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796932368] [2025-01-10 06:20:32,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:32,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:20:32,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:20:32,892 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:20:32,897 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:20:33,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-10 06:20:33,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-10 06:20:33,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:33,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:33,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-10 06:20:33,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:20:33,196 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:20:33,214 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:20:33,230 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:20:33,857 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:20:33,857 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:20:33,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796932368] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:20:33,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:20:33,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-01-10 06:20:33,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644652883] [2025-01-10 06:20:33,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:20:33,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 06:20:33,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:20:33,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 06:20:33,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:20:33,859 INFO L87 Difference]: Start difference. First operand 715 states and 1006 transitions. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:20:34,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:20:34,873 INFO L93 Difference]: Finished difference Result 1613 states and 2291 transitions. [2025-01-10 06:20:34,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:20:34,874 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 117 [2025-01-10 06:20:34,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:20:34,878 INFO L225 Difference]: With dead ends: 1613 [2025-01-10 06:20:34,880 INFO L226 Difference]: Without dead ends: 938 [2025-01-10 06:20:34,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-01-10 06:20:34,881 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 560 mSDsluCounter, 2739 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 3260 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-10 06:20:34,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 3260 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 06:20:34,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2025-01-10 06:20:34,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 715. [2025-01-10 06:20:34,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 678 states have (on average 1.4085545722713864) internal successors, (955), 699 states have internal predecessors, (955), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-10 06:20:34,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1005 transitions. [2025-01-10 06:20:34,904 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1005 transitions. Word has length 117 [2025-01-10 06:20:34,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:20:34,904 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1005 transitions. [2025-01-10 06:20:34,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:20:34,904 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1005 transitions. [2025-01-10 06:20:34,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-10 06:20:34,906 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:20:34,906 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:20:34,917 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-01-10 06:20:35,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:20:35,111 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:20:35,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:20:35,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1034862163, now seen corresponding path program 1 times [2025-01-10 06:20:35,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:20:35,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858004449] [2025-01-10 06:20:35,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:35,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:20:35,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-10 06:20:35,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-10 06:20:35,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:35,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:35,404 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:20:35,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:20:35,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858004449] [2025-01-10 06:20:35,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858004449] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:20:35,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591173245] [2025-01-10 06:20:35,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:20:35,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:20:35,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:20:35,407 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:20:35,408 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:20:35,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-10 06:20:35,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-10 06:20:35,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:20:35,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:20:35,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-10 06:20:35,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:22:02,577 WARN L286 SmtUtils]: Spent 8.72s on a formula simplification. DAG size of input: 30 DAG size of output: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)