./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 5eef0a1d7c251abc753eabb723fe850489bfd10ab147ced1a31e6821eaf88c98 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 14:59:49,258 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:59:49,314 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 14:59:49,320 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:59:49,322 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:59:49,340 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:59:49,340 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:59:49,341 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:59:49,341 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:59:49,341 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:59:49,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:59:49,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:59:49,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:59:49,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:59:49,342 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:59:49,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:59:49,343 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:59:49,343 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 14:59:49,343 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 14:59:49,343 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 14:59:49,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:59:49,343 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:59:49,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:59:49,344 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:59:49,344 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:59:49,344 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:59:49,344 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 14:59:49,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:59:49,344 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:59:49,344 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:59:49,344 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:59:49,344 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:59:49,345 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:59:49,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:59:49,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:59:49,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:59:49,345 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:59:49,345 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:59:49,345 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:59:49,345 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 14:59:49,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 14:59:49,345 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:59:49,345 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:59:49,345 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:59:49,346 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:59:49,346 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/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 -> 5eef0a1d7c251abc753eabb723fe850489bfd10ab147ced1a31e6821eaf88c98 [2025-03-04 14:59:49,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:59:49,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:59:49,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:59:49,573 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:59:49,573 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:59:49,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i [2025-03-04 14:59:50,695 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c48f6f654/cfc2807cac304745bc09f86b2a448147/FLAG878ed6c9b [2025-03-04 14:59:51,001 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:59:51,004 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i [2025-03-04 14:59:51,021 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c48f6f654/cfc2807cac304745bc09f86b2a448147/FLAG878ed6c9b [2025-03-04 14:59:51,037 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c48f6f654/cfc2807cac304745bc09f86b2a448147 [2025-03-04 14:59:51,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:59:51,042 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:59:51,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:59:51,043 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:59:51,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:59:51,048 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:59:51" (1/1) ... [2025-03-04 14:59:51,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55efa566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:51, skipping insertion in model container [2025-03-04 14:59:51,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:59:51" (1/1) ... [2025-03-04 14:59:51,081 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:59:51,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:59:51,404 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:59:51,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:59:51,533 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:59:51,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:51 WrapperNode [2025-03-04 14:59:51,534 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:59:51,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:59:51,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:59:51,535 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:59:51,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:51" (1/1) ... [2025-03-04 14:59:51,566 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:51" (1/1) ... [2025-03-04 14:59:51,628 INFO L138 Inliner]: procedures = 177, calls = 291, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1387 [2025-03-04 14:59:51,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:59:51,632 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:59:51,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:59:51,632 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:59:51,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:51" (1/1) ... [2025-03-04 14:59:51,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:51" (1/1) ... [2025-03-04 14:59:51,646 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:51" (1/1) ... [2025-03-04 14:59:51,711 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 220, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2025-03-04 14:59:51,711 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:51" (1/1) ... [2025-03-04 14:59:51,711 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:51" (1/1) ... [2025-03-04 14:59:51,743 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:51" (1/1) ... [2025-03-04 14:59:51,746 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:51" (1/1) ... [2025-03-04 14:59:51,752 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:51" (1/1) ... [2025-03-04 14:59:51,757 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:51" (1/1) ... [2025-03-04 14:59:51,768 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:59:51,769 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:59:51,769 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:59:51,770 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:59:51,770 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:51" (1/1) ... [2025-03-04 14:59:51,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:59:51,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:59:51,796 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 14:59:51,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 14:59:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 14:59:51,815 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 14:59:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 14:59:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 14:59:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 14:59:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 14:59:51,815 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 14:59:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 14:59:51,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 14:59:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 14:59:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 14:59:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 14:59:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 14:59:51,816 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 14:59:51,816 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 14:59:51,816 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 14:59:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2025-03-04 14:59:51,816 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2025-03-04 14:59:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:59:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:59:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 14:59:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 14:59:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 14:59:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 14:59:51,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 14:59:51,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 14:59:51,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 14:59:51,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:59:51,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 14:59:51,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 14:59:51,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 14:59:51,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:59:51,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:59:51,984 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:59:51,986 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:59:52,977 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L763: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-04 14:59:53,045 INFO L? ?]: Removed 339 outVars from TransFormulas that were not future-live. [2025-03-04 14:59:53,045 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:59:53,085 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:59:53,085 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 14:59:53,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:59:53 BoogieIcfgContainer [2025-03-04 14:59:53,086 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:59:53,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:59:53,090 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:59:53,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:59:53,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:59:51" (1/3) ... [2025-03-04 14:59:53,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd57d75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:59:53, skipping insertion in model container [2025-03-04 14:59:53,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:51" (2/3) ... [2025-03-04 14:59:53,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd57d75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:59:53, skipping insertion in model container [2025-03-04 14:59:53,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:59:53" (3/3) ... [2025-03-04 14:59:53,096 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test8-1.i [2025-03-04 14:59:53,106 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:59:53,107 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test8-1.i that has 7 procedures, 455 locations, 1 initial locations, 35 loop locations, and 8 error locations. [2025-03-04 14:59:53,152 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:59:53,161 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;@7bdea312, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:59:53,162 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 14:59:53,165 INFO L276 IsEmpty]: Start isEmpty. Operand has 447 states, 412 states have (on average 1.6310679611650485) internal successors, (672), 437 states have internal predecessors, (672), 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-03-04 14:59:53,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 14:59:53,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:59:53,170 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:59:53,170 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:59:53,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:59:53,175 INFO L85 PathProgramCache]: Analyzing trace with hash 987266441, now seen corresponding path program 1 times [2025-03-04 14:59:53,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:59:53,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631767315] [2025-03-04 14:59:53,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:59:53,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:59:53,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:59:53,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:59:53,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:59:53,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:59:53,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:59:53,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:59:53,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631767315] [2025-03-04 14:59:53,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631767315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:59:53,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:59:53,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:59:53,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734525893] [2025-03-04 14:59:53,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:59:53,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 14:59:53,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:59:53,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 14:59:53,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 14:59:53,319 INFO L87 Difference]: Start difference. First operand has 447 states, 412 states have (on average 1.6310679611650485) internal successors, (672), 437 states have internal predecessors, (672), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-03-04 14:59:53,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:59:53,437 INFO L93 Difference]: Finished difference Result 890 states and 1446 transitions. [2025-03-04 14:59:53,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 14:59:53,440 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2025-03-04 14:59:53,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:59:53,451 INFO L225 Difference]: With dead ends: 890 [2025-03-04 14:59:53,451 INFO L226 Difference]: Without dead ends: 438 [2025-03-04 14:59:53,456 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-03-04 14:59:53,458 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:59:53,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 607 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:59:53,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-03-04 14:59:53,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2025-03-04 14:59:53,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 407 states have (on average 1.4766584766584767) internal successors, (601), 429 states have internal predecessors, (601), 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-03-04 14:59:53,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 641 transitions. [2025-03-04 14:59:53,500 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 641 transitions. Word has length 7 [2025-03-04 14:59:53,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:59:53,501 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 641 transitions. [2025-03-04 14:59:53,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-03-04 14:59:53,501 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 641 transitions. [2025-03-04 14:59:53,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 14:59:53,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:59:53,501 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:59:53,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 14:59:53,502 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:59:53,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:59:53,502 INFO L85 PathProgramCache]: Analyzing trace with hash 987267402, now seen corresponding path program 1 times [2025-03-04 14:59:53,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:59:53,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099240302] [2025-03-04 14:59:53,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:59:53,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:59:53,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:59:53,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:59:53,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:59:53,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 14:59:53,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1718809841] [2025-03-04 14:59:53,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:59:53,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:59:53,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:59:53,534 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:59:53,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 14:59:53,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:59:53,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:59:53,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:59:53,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:59:53,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 14:59:53,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:59:53,692 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-03-04 14:59:53,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:59:53,725 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:59:53,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:59:53,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099240302] [2025-03-04 14:59:53,726 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 14:59:53,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718809841] [2025-03-04 14:59:53,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718809841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:59:53,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:59:53,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:59:53,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578589904] [2025-03-04 14:59:53,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:59:53,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:59:53,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:59:53,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:59:53,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:59:53,728 INFO L87 Difference]: Start difference. First operand 438 states and 641 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-03-04 14:59:53,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:59:53,970 INFO L93 Difference]: Finished difference Result 828 states and 1206 transitions. [2025-03-04 14:59:53,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:59:53,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2025-03-04 14:59:53,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:59:53,977 INFO L225 Difference]: With dead ends: 828 [2025-03-04 14:59:53,977 INFO L226 Difference]: Without dead ends: 826 [2025-03-04 14:59:53,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-03-04 14:59:53,979 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 548 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1721 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:59:53,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1721 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:59:53,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2025-03-04 14:59:54,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 444. [2025-03-04 14:59:54,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 413 states have (on average 1.4721549636803875) internal successors, (608), 435 states have internal predecessors, (608), 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-03-04 14:59:54,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 648 transitions. [2025-03-04 14:59:54,011 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 648 transitions. Word has length 7 [2025-03-04 14:59:54,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:59:54,011 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 648 transitions. [2025-03-04 14:59:54,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-03-04 14:59:54,012 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 648 transitions. [2025-03-04 14:59:54,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 14:59:54,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:59:54,015 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] [2025-03-04 14:59:54,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 14:59:54,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:59:54,219 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:59:54,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:59:54,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1260550001, now seen corresponding path program 1 times [2025-03-04 14:59:54,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:59:54,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52790576] [2025-03-04 14:59:54,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:59:54,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:59:54,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 14:59:54,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 14:59:54,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:59:54,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:59:54,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:59:54,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:59:54,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52790576] [2025-03-04 14:59:54,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52790576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:59:54,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:59:54,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:59:54,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416930714] [2025-03-04 14:59:54,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:59:54,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:59:54,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:59:54,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:59:54,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:59:54,563 INFO L87 Difference]: Start difference. First operand 444 states and 648 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-03-04 14:59:54,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:59:54,788 INFO L93 Difference]: Finished difference Result 1055 states and 1547 transitions. [2025-03-04 14:59:54,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:59:54,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 70 [2025-03-04 14:59:54,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:59:54,791 INFO L225 Difference]: With dead ends: 1055 [2025-03-04 14:59:54,792 INFO L226 Difference]: Without dead ends: 825 [2025-03-04 14:59:54,792 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-03-04 14:59:54,793 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 549 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:59:54,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 1804 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:59:54,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2025-03-04 14:59:54,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 444. [2025-03-04 14:59:54,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 413 states have (on average 1.4697336561743342) internal successors, (607), 435 states have internal predecessors, (607), 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-03-04 14:59:54,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 647 transitions. [2025-03-04 14:59:54,809 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 647 transitions. Word has length 70 [2025-03-04 14:59:54,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:59:54,810 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 647 transitions. [2025-03-04 14:59:54,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-03-04 14:59:54,810 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 647 transitions. [2025-03-04 14:59:54,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 14:59:54,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:59:54,813 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:59:54,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 14:59:54,814 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:59:54,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:59:54,814 INFO L85 PathProgramCache]: Analyzing trace with hash -427824810, now seen corresponding path program 1 times [2025-03-04 14:59:54,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:59:54,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401915309] [2025-03-04 14:59:54,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:59:54,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:59:54,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 14:59:54,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 14:59:54,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:59:54,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:59:54,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:59:54,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:59:54,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401915309] [2025-03-04 14:59:54,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401915309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:59:54,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:59:54,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:59:54,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288840474] [2025-03-04 14:59:54,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:59:54,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:59:54,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:59:54,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:59:54,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:59:54,983 INFO L87 Difference]: Start difference. First operand 444 states and 647 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-03-04 14:59:55,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:59:55,134 INFO L93 Difference]: Finished difference Result 883 states and 1289 transitions. [2025-03-04 14:59:55,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:59:55,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 81 [2025-03-04 14:59:55,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:59:55,137 INFO L225 Difference]: With dead ends: 883 [2025-03-04 14:59:55,137 INFO L226 Difference]: Without dead ends: 447 [2025-03-04 14:59:55,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:59:55,138 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 105 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:59:55,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1632 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:59:55,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-03-04 14:59:55,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 444. [2025-03-04 14:59:55,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 413 states have (on average 1.4527845036319613) internal successors, (600), 435 states have internal predecessors, (600), 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-03-04 14:59:55,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 640 transitions. [2025-03-04 14:59:55,148 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 640 transitions. Word has length 81 [2025-03-04 14:59:55,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:59:55,148 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 640 transitions. [2025-03-04 14:59:55,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-03-04 14:59:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 640 transitions. [2025-03-04 14:59:55,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 14:59:55,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:59:55,149 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:59:55,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 14:59:55,150 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:59:55,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:59:55,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1633590352, now seen corresponding path program 1 times [2025-03-04 14:59:55,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:59:55,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482637872] [2025-03-04 14:59:55,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:59:55,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:59:55,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 14:59:55,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 14:59:55,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:59:55,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:59:55,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:59:55,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:59:55,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482637872] [2025-03-04 14:59:55,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482637872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:59:55,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:59:55,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:59:55,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502996862] [2025-03-04 14:59:55,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:59:55,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:59:55,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:59:55,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:59:55,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:59:55,280 INFO L87 Difference]: Start difference. First operand 444 states and 640 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-03-04 14:59:55,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:59:55,444 INFO L93 Difference]: Finished difference Result 1170 states and 1700 transitions. [2025-03-04 14:59:55,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:59:55,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 81 [2025-03-04 14:59:55,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:59:55,448 INFO L225 Difference]: With dead ends: 1170 [2025-03-04 14:59:55,448 INFO L226 Difference]: Without dead ends: 734 [2025-03-04 14:59:55,449 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-03-04 14:59:55,450 INFO L435 NwaCegarLoop]: 757 mSDtfsCounter, 371 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:59:55,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1326 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:59:55,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2025-03-04 14:59:55,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 731. [2025-03-04 14:59:55,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 699 states have (on average 1.463519313304721) internal successors, (1023), 721 states have internal predecessors, (1023), 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-03-04 14:59:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1065 transitions. [2025-03-04 14:59:55,478 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1065 transitions. Word has length 81 [2025-03-04 14:59:55,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:59:55,478 INFO L471 AbstractCegarLoop]: Abstraction has 731 states and 1065 transitions. [2025-03-04 14:59:55,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-03-04 14:59:55,479 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1065 transitions. [2025-03-04 14:59:55,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 14:59:55,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:59:55,480 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:59:55,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 14:59:55,480 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:59:55,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:59:55,481 INFO L85 PathProgramCache]: Analyzing trace with hash 410434782, now seen corresponding path program 1 times [2025-03-04 14:59:55,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:59:55,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457826608] [2025-03-04 14:59:55,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:59:55,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:59:55,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 14:59:55,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 14:59:55,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:59:55,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:59:55,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:59:55,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:59:55,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457826608] [2025-03-04 14:59:55,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457826608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:59:55,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:59:55,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:59:55,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972047090] [2025-03-04 14:59:55,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:59:55,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:59:55,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:59:55,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:59:55,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:59:55,761 INFO L87 Difference]: Start difference. First operand 731 states and 1065 transitions. Second operand has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 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-03-04 14:59:55,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:59:55,914 INFO L93 Difference]: Finished difference Result 831 states and 1214 transitions. [2025-03-04 14:59:55,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:59:55,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 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 96 [2025-03-04 14:59:55,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:59:55,920 INFO L225 Difference]: With dead ends: 831 [2025-03-04 14:59:55,920 INFO L226 Difference]: Without dead ends: 829 [2025-03-04 14:59:55,921 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-03-04 14:59:55,923 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 223 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1729 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:59:55,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1729 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:59:55,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2025-03-04 14:59:55,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 800. [2025-03-04 14:59:55,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 763 states have (on average 1.4482306684141546) internal successors, (1105), 785 states have internal predecessors, (1105), 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-03-04 14:59:55,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1155 transitions. [2025-03-04 14:59:55,946 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1155 transitions. Word has length 96 [2025-03-04 14:59:55,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:59:55,946 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1155 transitions. [2025-03-04 14:59:55,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 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-03-04 14:59:55,946 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1155 transitions. [2025-03-04 14:59:55,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 14:59:55,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:59:55,949 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] [2025-03-04 14:59:55,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 14:59:55,950 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:59:55,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:59:55,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1503818533, now seen corresponding path program 1 times [2025-03-04 14:59:55,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:59:55,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732975048] [2025-03-04 14:59:55,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:59:55,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:59:56,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 14:59:56,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 14:59:56,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:59:56,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:59:56,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:59:56,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:59:56,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732975048] [2025-03-04 14:59:56,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732975048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:59:56,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:59:56,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:59:56,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132772603] [2025-03-04 14:59:56,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:59:56,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:59:56,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:59:56,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:59:56,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:59:56,240 INFO L87 Difference]: Start difference. First operand 800 states and 1155 transitions. Second operand has 4 states, 3 states have (on average 32.333333333333336) internal successors, (97), 4 states have internal predecessors, (97), 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-03-04 14:59:56,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:59:56,428 INFO L93 Difference]: Finished difference Result 1027 states and 1481 transitions. [2025-03-04 14:59:56,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:59:56,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 32.333333333333336) internal successors, (97), 4 states have internal predecessors, (97), 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 108 [2025-03-04 14:59:56,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:59:56,433 INFO L225 Difference]: With dead ends: 1027 [2025-03-04 14:59:56,433 INFO L226 Difference]: Without dead ends: 1025 [2025-03-04 14:59:56,433 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-03-04 14:59:56,434 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 457 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:59:56,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 1704 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:59:56,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2025-03-04 14:59:56,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 803. [2025-03-04 14:59:56,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 766 states have (on average 1.4464751958224542) internal successors, (1108), 787 states have internal predecessors, (1108), 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-03-04 14:59:56,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1158 transitions. [2025-03-04 14:59:56,455 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1158 transitions. Word has length 108 [2025-03-04 14:59:56,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:59:56,456 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1158 transitions. [2025-03-04 14:59:56,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 32.333333333333336) internal successors, (97), 4 states have internal predecessors, (97), 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-03-04 14:59:56,456 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1158 transitions. [2025-03-04 14:59:56,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 14:59:56,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:59:56,457 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:59:56,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 14:59:56,457 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:59:56,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:59:56,457 INFO L85 PathProgramCache]: Analyzing trace with hash 276693174, now seen corresponding path program 1 times [2025-03-04 14:59:56,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:59:56,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775823861] [2025-03-04 14:59:56,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:59:56,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:59:56,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 14:59:56,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 14:59:56,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:59:56,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:59:56,833 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 14:59:56,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:59:56,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775823861] [2025-03-04 14:59:56,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775823861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:59:56,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778798943] [2025-03-04 14:59:56,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:59:56,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:59:56,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:59:56,836 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:59:56,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 14:59:57,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 14:59:57,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 14:59:57,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:59:57,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:59:57,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 14:59:57,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:59:57,115 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-03-04 14:59:57,129 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-03-04 14:59:57,142 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-03-04 15:00:01,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:00:01,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 38 [2025-03-04 15:00:01,931 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:00:01,931 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:00:01,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778798943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:00:01,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:00:01,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-03-04 15:00:01,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850003481] [2025-03-04 15:00:01,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:00:01,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 15:00:01,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:00:01,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 15:00:01,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=125, Unknown=1, NotChecked=0, Total=156 [2025-03-04 15:00:01,932 INFO L87 Difference]: Start difference. First operand 803 states and 1158 transitions. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 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-03-04 15:00:06,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 15:00:08,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:00:08,401 INFO L93 Difference]: Finished difference Result 1794 states and 2584 transitions. [2025-03-04 15:00:08,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:00:08,402 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 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 114 [2025-03-04 15:00:08,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:00:08,406 INFO L225 Difference]: With dead ends: 1794 [2025-03-04 15:00:08,406 INFO L226 Difference]: Without dead ends: 1077 [2025-03-04 15:00:08,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=90, Invalid=329, Unknown=1, NotChecked=0, Total=420 [2025-03-04 15:00:08,408 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 832 mSDsluCounter, 2466 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 3037 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-03-04 15:00:08,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 3037 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 946 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2025-03-04 15:00:08,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2025-03-04 15:00:08,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 836. [2025-03-04 15:00:08,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 799 states have (on average 1.4392991239048811) internal successors, (1150), 820 states have internal predecessors, (1150), 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-03-04 15:00:08,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1200 transitions. [2025-03-04 15:00:08,428 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1200 transitions. Word has length 114 [2025-03-04 15:00:08,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:00:08,428 INFO L471 AbstractCegarLoop]: Abstraction has 836 states and 1200 transitions. [2025-03-04 15:00:08,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 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-03-04 15:00:08,429 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1200 transitions. [2025-03-04 15:00:08,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 15:00:08,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:00:08,430 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:00:08,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:00:08,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-04 15:00:08,634 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 15:00:08,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:00:08,638 INFO L85 PathProgramCache]: Analyzing trace with hash -108673609, now seen corresponding path program 1 times [2025-03-04 15:00:08,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:00:08,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37939341] [2025-03-04 15:00:08,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:00:08,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:00:08,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 15:00:08,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 15:00:08,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:00:08,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:08,777 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:00:08,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:00:08,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37939341] [2025-03-04 15:00:08,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37939341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:00:08,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:00:08,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:00:08,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140802377] [2025-03-04 15:00:08,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:00:08,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:00:08,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:00:08,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:00:08,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:00:08,778 INFO L87 Difference]: Start difference. First operand 836 states and 1200 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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-03-04 15:00:08,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:00:08,962 INFO L93 Difference]: Finished difference Result 1515 states and 2176 transitions. [2025-03-04 15:00:08,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:00:08,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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 114 [2025-03-04 15:00:08,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:00:08,965 INFO L225 Difference]: With dead ends: 1515 [2025-03-04 15:00:08,965 INFO L226 Difference]: Without dead ends: 707 [2025-03-04 15:00:08,968 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-03-04 15:00:08,969 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 9 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 15:00:08,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1499 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 15:00:08,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2025-03-04 15:00:08,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2025-03-04 15:00:08,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 670 states have (on average 1.4134328358208956) internal successors, (947), 691 states have internal predecessors, (947), 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-03-04 15:00:08,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 997 transitions. [2025-03-04 15:00:08,989 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 997 transitions. Word has length 114 [2025-03-04 15:00:08,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:00:08,990 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 997 transitions. [2025-03-04 15:00:08,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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-03-04 15:00:08,990 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 997 transitions. [2025-03-04 15:00:08,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 15:00:08,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:00:08,992 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:00:08,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:00:08,993 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 15:00:08,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:00:08,993 INFO L85 PathProgramCache]: Analyzing trace with hash 251985386, now seen corresponding path program 1 times [2025-03-04 15:00:08,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:00:08,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607207614] [2025-03-04 15:00:08,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:00:08,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:00:09,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 15:00:09,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 15:00:09,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:00:09,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:09,291 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:00:09,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:00:09,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607207614] [2025-03-04 15:00:09,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607207614] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:00:09,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352319212] [2025-03-04 15:00:09,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:00:09,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:00:09,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:00:09,296 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:00:09,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:00:09,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 15:00:09,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 15:00:09,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:00:09,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:09,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 15:00:09,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:00:45,901 WARN L286 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 15:00:57,922 WARN L286 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 15:01:18,909 WARN L286 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 15:01:30,924 WARN L286 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)