./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.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_BER_test9-2.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 50ec0e1b32f61b9ee697cf2c7598d178ee7b7b08e68108a0f594c4a6a80ab80c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 14:50:04,400 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:50:04,439 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 14:50:04,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:50:04,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:50:04,455 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:50:04,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:50:04,456 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:50:04,456 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:50:04,456 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:50:04,457 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:50:04,457 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:50:04,457 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:50:04,457 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:50:04,457 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:50:04,458 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:50:04,458 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:50:04,458 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 14:50:04,458 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 14:50:04,458 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 14:50:04,459 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:50:04,459 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:50:04,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:50:04,459 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:50:04,459 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:50:04,459 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:50:04,459 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 14:50:04,459 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:50:04,459 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:50:04,459 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:50:04,459 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:50:04,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:50:04,459 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:50:04,459 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:50:04,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:50:04,459 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:50:04,460 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:50:04,460 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:50:04,460 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:50:04,460 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 14:50:04,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 14:50:04,460 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:50:04,460 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:50:04,460 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:50:04,460 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:50:04,460 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 -> 50ec0e1b32f61b9ee697cf2c7598d178ee7b7b08e68108a0f594c4a6a80ab80c [2025-03-04 14:50:04,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:50:04,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:50:04,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:50:04,690 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:50:04,690 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:50:04,691 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i [2025-03-04 14:50:05,799 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de6f669e3/20a3fac91ed040df86705f7f72c0e8cf/FLAG3f8757fc9 [2025-03-04 14:50:06,109 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:50:06,109 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i [2025-03-04 14:50:06,124 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de6f669e3/20a3fac91ed040df86705f7f72c0e8cf/FLAG3f8757fc9 [2025-03-04 14:50:06,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de6f669e3/20a3fac91ed040df86705f7f72c0e8cf [2025-03-04 14:50:06,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:50:06,135 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:50:06,136 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:50:06,136 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:50:06,139 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:50:06,139 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:50:06" (1/1) ... [2025-03-04 14:50:06,141 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@303b918c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:50:06, skipping insertion in model container [2025-03-04 14:50:06,141 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:50:06" (1/1) ... [2025-03-04 14:50:06,186 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:50:06,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:50:06,683 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:50:06,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:50:06,838 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:50:06,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:50:06 WrapperNode [2025-03-04 14:50:06,839 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:50:06,839 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:50:06,839 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:50:06,839 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:50:06,844 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:50:06" (1/1) ... [2025-03-04 14:50:06,868 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:50:06" (1/1) ... [2025-03-04 14:50:06,955 INFO L138 Inliner]: procedures = 177, calls = 775, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3411 [2025-03-04 14:50:06,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:50:06,957 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:50:06,957 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:50:06,957 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:50:06,962 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:50:06" (1/1) ... [2025-03-04 14:50:06,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:50:06" (1/1) ... [2025-03-04 14:50:06,976 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:50:06" (1/1) ... [2025-03-04 14:50:07,042 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 34, 220]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2025-03-04 14:50:07,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:50:06" (1/1) ... [2025-03-04 14:50:07,046 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:50:06" (1/1) ... [2025-03-04 14:50:07,088 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:50:06" (1/1) ... [2025-03-04 14:50:07,091 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:50:06" (1/1) ... [2025-03-04 14:50:07,096 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:50:06" (1/1) ... [2025-03-04 14:50:07,100 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:50:06" (1/1) ... [2025-03-04 14:50:07,120 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:50:07,120 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:50:07,120 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:50:07,120 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:50:07,121 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:50:06" (1/1) ... [2025-03-04 14:50:07,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:50:07,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:50:07,149 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:50:07,152 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:50:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 14:50:07,168 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 14:50:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 14:50:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 14:50:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 14:50:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 14:50:07,168 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 14:50:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 14:50:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 14:50:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 14:50:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 14:50:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 14:50:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 14:50:07,169 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 14:50:07,169 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 14:50:07,169 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 14:50:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:50:07,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:50:07,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 14:50:07,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 14:50:07,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 14:50:07,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 14:50:07,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 14:50:07,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 14:50:07,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 14:50:07,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:50:07,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 14:50:07,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 14:50:07,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 14:50:07,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:50:07,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:50:07,340 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:50:07,341 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:50:09,406 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2218: 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:50:09,599 INFO L? ?]: Removed 834 outVars from TransFormulas that were not future-live. [2025-03-04 14:50:09,600 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:50:09,671 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:50:09,672 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 14:50:09,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:50:09 BoogieIcfgContainer [2025-03-04 14:50:09,672 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:50:09,674 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:50:09,675 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:50:09,678 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:50:09,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:50:06" (1/3) ... [2025-03-04 14:50:09,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3d26d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:50:09, skipping insertion in model container [2025-03-04 14:50:09,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:50:06" (2/3) ... [2025-03-04 14:50:09,680 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3d26d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:50:09, skipping insertion in model container [2025-03-04 14:50:09,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:50:09" (3/3) ... [2025-03-04 14:50:09,681 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test9-2.i [2025-03-04 14:50:09,704 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:50:09,705 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test9-2.i that has 6 procedures, 1424 locations, 1 initial locations, 36 loop locations, and 8 error locations. [2025-03-04 14:50:09,779 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:50:09,790 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;@2002069b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:50:09,790 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 14:50:09,797 INFO L276 IsEmpty]: Start isEmpty. Operand has 1416 states, 899 states have (on average 1.832035595105673) internal successors, (1647), 1409 states have internal predecessors, (1647), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2025-03-04 14:50:09,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 14:50:09,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:50:09,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:50:09,801 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:50:09,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:50:09,804 INFO L85 PathProgramCache]: Analyzing trace with hash 992438410, now seen corresponding path program 1 times [2025-03-04 14:50:09,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:50:09,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771210548] [2025-03-04 14:50:09,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:50:09,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:50:09,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:50:09,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:50:09,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:50:09,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:50:09,934 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:50:09,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:50:09,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771210548] [2025-03-04 14:50:09,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771210548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:50:09,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:50:09,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:50:09,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489824398] [2025-03-04 14:50:09,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:50:09,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 14:50:09,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:50:09,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 14:50:09,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 14:50:09,962 INFO L87 Difference]: Start difference. First operand has 1416 states, 899 states have (on average 1.832035595105673) internal successors, (1647), 1409 states have internal predecessors, (1647), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 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:50:10,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:50:10,172 INFO L93 Difference]: Finished difference Result 2828 states and 5811 transitions. [2025-03-04 14:50:10,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 14:50:10,174 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:50:10,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:50:10,193 INFO L225 Difference]: With dead ends: 2828 [2025-03-04 14:50:10,195 INFO L226 Difference]: Without dead ends: 1374 [2025-03-04 14:50:10,209 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:50:10,211 INFO L435 NwaCegarLoop]: 2548 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2548 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:50:10,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2548 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:50:10,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2025-03-04 14:50:10,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1374. [2025-03-04 14:50:10,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 861 states have (on average 1.7770034843205575) internal successors, (1530), 1368 states have internal predecessors, (1530), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-04 14:50:10,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2536 transitions. [2025-03-04 14:50:10,515 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2536 transitions. Word has length 7 [2025-03-04 14:50:10,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:50:10,517 INFO L471 AbstractCegarLoop]: Abstraction has 1374 states and 2536 transitions. [2025-03-04 14:50:10,517 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:50:10,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2536 transitions. [2025-03-04 14:50:10,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 14:50:10,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:50:10,518 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:50:10,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 14:50:10,519 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:50:10,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:50:10,519 INFO L85 PathProgramCache]: Analyzing trace with hash 992439371, now seen corresponding path program 1 times [2025-03-04 14:50:10,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:50:10,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241106361] [2025-03-04 14:50:10,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:50:10,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:50:10,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:50:10,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:50:10,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:50:10,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 14:50:10,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1488058286] [2025-03-04 14:50:10,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:50:10,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:50:10,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:50:10,560 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:50:10,562 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:50:10,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:50:10,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:50:10,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:50:10,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:50:10,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 14:50:10,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:50:10,690 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:50:10,721 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:50:10,721 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:50:10,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:50:10,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241106361] [2025-03-04 14:50:10,722 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 14:50:10,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488058286] [2025-03-04 14:50:10,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488058286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:50:10,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:50:10,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:50:10,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552367965] [2025-03-04 14:50:10,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:50:10,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:50:10,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:50:10,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:50:10,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:50:10,723 INFO L87 Difference]: Start difference. First operand 1374 states and 2536 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:50:11,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:50:11,603 INFO L93 Difference]: Finished difference Result 2738 states and 5063 transitions. [2025-03-04 14:50:11,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:50:11,604 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:50:11,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:50:11,625 INFO L225 Difference]: With dead ends: 2738 [2025-03-04 14:50:11,626 INFO L226 Difference]: Without dead ends: 2736 [2025-03-04 14:50:11,627 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:50:11,628 INFO L435 NwaCegarLoop]: 2732 mSDtfsCounter, 1514 mSDsluCounter, 4699 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2017 SdHoareTripleChecker+Valid, 7431 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 14:50:11,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2017 Valid, 7431 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 14:50:11,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2025-03-04 14:50:11,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 1380. [2025-03-04 14:50:11,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 867 states have (on average 1.7727797001153403) internal successors, (1537), 1374 states have internal predecessors, (1537), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-04 14:50:11,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 2543 transitions. [2025-03-04 14:50:11,903 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 2543 transitions. Word has length 7 [2025-03-04 14:50:11,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:50:11,903 INFO L471 AbstractCegarLoop]: Abstraction has 1380 states and 2543 transitions. [2025-03-04 14:50:11,903 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:50:11,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 2543 transitions. [2025-03-04 14:50:11,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 14:50:11,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:50:11,905 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] [2025-03-04 14:50:11,912 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:50:12,110 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:50:12,110 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:50:12,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:50:12,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1811971906, now seen corresponding path program 1 times [2025-03-04 14:50:12,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:50:12,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001349051] [2025-03-04 14:50:12,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:50:12,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:50:12,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 14:50:12,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 14:50:12,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:50:12,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:50:12,418 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:50:12,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:50:12,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001349051] [2025-03-04 14:50:12,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001349051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:50:12,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:50:12,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:50:12,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498417227] [2025-03-04 14:50:12,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:50:12,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:50:12,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:50:12,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:50:12,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:50:12,420 INFO L87 Difference]: Start difference. First operand 1380 states and 2543 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:50:13,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:50:13,154 INFO L93 Difference]: Finished difference Result 3903 states and 7302 transitions. [2025-03-04 14:50:13,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:50:13,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2025-03-04 14:50:13,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:50:13,172 INFO L225 Difference]: With dead ends: 3903 [2025-03-04 14:50:13,172 INFO L226 Difference]: Without dead ends: 2735 [2025-03-04 14:50:13,177 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:50:13,177 INFO L435 NwaCegarLoop]: 2735 mSDtfsCounter, 1515 mSDsluCounter, 4703 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2018 SdHoareTripleChecker+Valid, 7438 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 14:50:13,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2018 Valid, 7438 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 14:50:13,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2735 states. [2025-03-04 14:50:13,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2735 to 1380. [2025-03-04 14:50:13,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 867 states have (on average 1.7716262975778547) internal successors, (1536), 1374 states have internal predecessors, (1536), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-04 14:50:13,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 2542 transitions. [2025-03-04 14:50:13,403 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 2542 transitions. Word has length 62 [2025-03-04 14:50:13,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:50:13,403 INFO L471 AbstractCegarLoop]: Abstraction has 1380 states and 2542 transitions. [2025-03-04 14:50:13,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:50:13,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 2542 transitions. [2025-03-04 14:50:13,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 14:50:13,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:50:13,409 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:50:13,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 14:50:13,409 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:50:13,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:50:13,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1048955205, now seen corresponding path program 1 times [2025-03-04 14:50:13,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:50:13,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910991615] [2025-03-04 14:50:13,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:50:13,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:50:13,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 14:50:13,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 14:50:13,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:50:13,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:50:13,645 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:50:13,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:50:13,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910991615] [2025-03-04 14:50:13,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910991615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:50:13,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:50:13,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:50:13,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795347289] [2025-03-04 14:50:13,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:50:13,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:50:13,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:50:13,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:50:13,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:50:13,647 INFO L87 Difference]: Start difference. First operand 1380 states and 2542 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:50:13,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:50:13,787 INFO L93 Difference]: Finished difference Result 2710 states and 5010 transitions. [2025-03-04 14:50:13,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:50:13,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-04 14:50:13,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:50:13,797 INFO L225 Difference]: With dead ends: 2710 [2025-03-04 14:50:13,798 INFO L226 Difference]: Without dead ends: 1338 [2025-03-04 14:50:13,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:50:13,803 INFO L435 NwaCegarLoop]: 2403 mSDtfsCounter, 30 mSDsluCounter, 4787 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 7190 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:50:13,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 7190 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:50:13,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2025-03-04 14:50:13,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1338. [2025-03-04 14:50:13,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1338 states, 825 states have (on average 1.7684848484848485) internal successors, (1459), 1332 states have internal predecessors, (1459), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-04 14:50:13,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 2465 transitions. [2025-03-04 14:50:13,948 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 2465 transitions. Word has length 79 [2025-03-04 14:50:13,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:50:13,948 INFO L471 AbstractCegarLoop]: Abstraction has 1338 states and 2465 transitions. [2025-03-04 14:50:13,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:50:13,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 2465 transitions. [2025-03-04 14:50:13,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 14:50:13,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:50:13,949 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:50:13,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 14:50:13,950 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:50:13,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:50:13,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1860068372, now seen corresponding path program 1 times [2025-03-04 14:50:13,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:50:13,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003675499] [2025-03-04 14:50:13,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:50:13,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:50:13,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 14:50:14,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 14:50:14,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:50:14,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:50:14,105 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:50:14,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:50:14,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003675499] [2025-03-04 14:50:14,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003675499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:50:14,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:50:14,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:50:14,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593639213] [2025-03-04 14:50:14,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:50:14,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:50:14,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:50:14,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:50:14,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:50:14,106 INFO L87 Difference]: Start difference. First operand 1338 states and 2465 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:50:14,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:50:14,307 INFO L93 Difference]: Finished difference Result 3893 states and 7246 transitions. [2025-03-04 14:50:14,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:50:14,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-04 14:50:14,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:50:14,324 INFO L225 Difference]: With dead ends: 3893 [2025-03-04 14:50:14,325 INFO L226 Difference]: Without dead ends: 2563 [2025-03-04 14:50:14,330 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:50:14,331 INFO L435 NwaCegarLoop]: 2850 mSDtfsCounter, 1265 mSDsluCounter, 2407 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1765 SdHoareTripleChecker+Valid, 5257 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:50:14,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1765 Valid, 5257 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:50:14,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2563 states. [2025-03-04 14:50:14,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2563 to 2559. [2025-03-04 14:50:14,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2559 states, 1546 states have (on average 1.7988357050452781) internal successors, (2781), 2553 states have internal predecessors, (2781), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-03-04 14:50:14,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2559 states to 2559 states and 4787 transitions. [2025-03-04 14:50:14,567 INFO L78 Accepts]: Start accepts. Automaton has 2559 states and 4787 transitions. Word has length 79 [2025-03-04 14:50:14,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:50:14,567 INFO L471 AbstractCegarLoop]: Abstraction has 2559 states and 4787 transitions. [2025-03-04 14:50:14,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:50:14,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2559 states and 4787 transitions. [2025-03-04 14:50:14,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 14:50:14,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:50:14,568 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:50:14,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 14:50:14,568 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:50:14,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:50:14,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1441607711, now seen corresponding path program 1 times [2025-03-04 14:50:14,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:50:14,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130627481] [2025-03-04 14:50:14,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:50:14,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:50:14,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 14:50:14,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 14:50:14,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:50:14,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:50:14,887 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:50:14,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:50:14,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130627481] [2025-03-04 14:50:14,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130627481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:50:14,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:50:14,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:50:14,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369153534] [2025-03-04 14:50:14,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:50:14,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:50:14,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:50:14,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:50:14,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:50:14,889 INFO L87 Difference]: Start difference. First operand 2559 states and 4787 transitions. Second operand has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:50:15,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:50:15,645 INFO L93 Difference]: Finished difference Result 4798 states and 9125 transitions. [2025-03-04 14:50:15,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:50:15,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 94 [2025-03-04 14:50:15,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:50:15,673 INFO L225 Difference]: With dead ends: 4798 [2025-03-04 14:50:15,674 INFO L226 Difference]: Without dead ends: 4796 [2025-03-04 14:50:15,675 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:50:15,676 INFO L435 NwaCegarLoop]: 2654 mSDtfsCounter, 1348 mSDsluCounter, 4547 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1849 SdHoareTripleChecker+Valid, 7201 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 14:50:15,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1849 Valid, 7201 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 14:50:15,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4796 states. [2025-03-04 14:50:16,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4796 to 2622. [2025-03-04 14:50:16,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2622 states, 1606 states have (on average 1.7795765877957659) internal successors, (2858), 2613 states have internal predecessors, (2858), 1006 states have call successors, (1006), 2 states have call predecessors, (1006), 2 states have return successors, (1006), 8 states have call predecessors, (1006), 1006 states have call successors, (1006) [2025-03-04 14:50:16,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2622 states to 2622 states and 4870 transitions. [2025-03-04 14:50:16,163 INFO L78 Accepts]: Start accepts. Automaton has 2622 states and 4870 transitions. Word has length 94 [2025-03-04 14:50:16,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:50:16,164 INFO L471 AbstractCegarLoop]: Abstraction has 2622 states and 4870 transitions. [2025-03-04 14:50:16,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:50:16,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2622 states and 4870 transitions. [2025-03-04 14:50:16,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 14:50:16,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:50:16,166 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:50:16,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 14:50:16,166 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:50:16,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:50:16,167 INFO L85 PathProgramCache]: Analyzing trace with hash -146981360, now seen corresponding path program 1 times [2025-03-04 14:50:16,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:50:16,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726984668] [2025-03-04 14:50:16,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:50:16,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:50:16,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 14:50:16,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 14:50:16,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:50:16,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:50:16,556 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:50:16,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:50:16,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726984668] [2025-03-04 14:50:16,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726984668] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:50:16,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854060413] [2025-03-04 14:50:16,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:50:16,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:50:16,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:50:16,559 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:50:16,561 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:50:16,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 14:50:16,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 14:50:16,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:50:16,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:50:16,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 14:50:16,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:50:16,806 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:50:16,825 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:50:16,840 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 14:50:17,421 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 14:50:17,421 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:50:17,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854060413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:50:17,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:50:17,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-03-04 14:50:17,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370642579] [2025-03-04 14:50:17,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:50:17,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 14:50:17,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:50:17,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 14:50:17,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-04 14:50:17,422 INFO L87 Difference]: Start difference. First operand 2622 states and 4870 transitions. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:50:19,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:50:19,951 INFO L93 Difference]: Finished difference Result 7388 states and 13956 transitions. [2025-03-04 14:50:19,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 14:50:19,952 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2025-03-04 14:50:19,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:50:19,981 INFO L225 Difference]: With dead ends: 7388 [2025-03-04 14:50:19,981 INFO L226 Difference]: Without dead ends: 4810 [2025-03-04 14:50:19,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-03-04 14:50:19,993 INFO L435 NwaCegarLoop]: 2661 mSDtfsCounter, 1552 mSDsluCounter, 19913 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2054 SdHoareTripleChecker+Valid, 22574 SdHoareTripleChecker+Invalid, 1671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:50:19,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2054 Valid, 22574 Invalid, 1671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-04 14:50:19,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2025-03-04 14:50:20,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 2622. [2025-03-04 14:50:20,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2622 states, 1606 states have (on average 1.7789539227895392) internal successors, (2857), 2613 states have internal predecessors, (2857), 1006 states have call successors, (1006), 2 states have call predecessors, (1006), 2 states have return successors, (1006), 8 states have call predecessors, (1006), 1006 states have call successors, (1006) [2025-03-04 14:50:20,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2622 states to 2622 states and 4869 transitions. [2025-03-04 14:50:20,455 INFO L78 Accepts]: Start accepts. Automaton has 2622 states and 4869 transitions. Word has length 100 [2025-03-04 14:50:20,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:50:20,456 INFO L471 AbstractCegarLoop]: Abstraction has 2622 states and 4869 transitions. [2025-03-04 14:50:20,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:50:20,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2622 states and 4869 transitions. [2025-03-04 14:50:20,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 14:50:20,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:50:20,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] [2025-03-04 14:50:20,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 14:50:20,661 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,SelfDestructingSolverStorable6 [2025-03-04 14:50:20,661 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 14:50:20,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:50:20,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1160852187, now seen corresponding path program 1 times [2025-03-04 14:50:20,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:50:20,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180647147] [2025-03-04 14:50:20,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:50:20,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:50:20,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 14:50:20,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 14:50:20,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:50:20,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:50:20,924 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:50:20,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:50:20,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180647147] [2025-03-04 14:50:20,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180647147] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:50:20,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719165710] [2025-03-04 14:50:20,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:50:20,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:50:20,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:50:20,926 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 14:50:20,928 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 14:50:21,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 14:50:21,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 14:50:21,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:50:21,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:50:21,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 14:50:21,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:51:00,379 WARN L286 SmtUtils]: Spent 6.64s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 14:51:11,406 WARN L286 SmtUtils]: Spent 9.12s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 14:51:29,120 WARN L286 SmtUtils]: Spent 5.09s on a formula simplification. DAG size of input: 30 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)