./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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_JEN_test3-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 f1f34940ecf685c2c1201858b264ccb53eb3034d3cb9952a1b49bb437c42dde1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:11:20,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:11:20,980 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 19:11:20,984 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:11:20,984 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:11:21,006 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:11:21,007 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:11:21,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:11:21,008 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:11:21,008 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:11:21,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 19:11:21,008 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 19:11:21,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:11:21,009 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:11:21,009 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:11:21,009 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:11:21,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 19:11:21,010 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 19:11:21,010 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:11:21,010 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 19:11:21,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:11:21,010 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 19:11:21,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 19:11:21,010 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 19:11:21,010 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 19:11:21,011 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:11:21,011 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 19:11:21,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:11:21,011 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:11:21,011 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:11:21,011 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:11:21,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:11:21,011 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 19:11:21,011 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 19:11:21,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:11:21,011 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:11:21,011 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 19:11:21,011 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 19:11:21,011 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 19:11:21,011 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:11:21,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 19:11:21,011 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 19:11:21,011 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 19:11:21,011 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 19:11:21,011 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 19:11:21,012 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 -> f1f34940ecf685c2c1201858b264ccb53eb3034d3cb9952a1b49bb437c42dde1 [2025-03-17 19:11:21,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:11:21,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:11:21,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:11:21,229 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:11:21,230 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:11:21,231 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test3-1.i [2025-03-17 19:11:22,332 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c276c3c25/dab63059e57f45b691f2b5f1b01331e3/FLAGf0a63ad3b [2025-03-17 19:11:22,708 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:11:22,710 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test3-1.i [2025-03-17 19:11:22,726 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c276c3c25/dab63059e57f45b691f2b5f1b01331e3/FLAGf0a63ad3b [2025-03-17 19:11:22,741 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c276c3c25/dab63059e57f45b691f2b5f1b01331e3 [2025-03-17 19:11:22,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:11:22,745 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:11:22,746 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:11:22,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:11:22,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:11:22,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:11:22" (1/1) ... [2025-03-17 19:11:22,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@791212dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:11:22, skipping insertion in model container [2025-03-17 19:11:22,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:11:22" (1/1) ... [2025-03-17 19:11:22,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:11:23,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:11:23,130 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:11:23,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:11:23,230 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:11:23,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:11:23 WrapperNode [2025-03-17 19:11:23,231 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:11:23,232 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:11:23,232 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:11:23,232 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:11:23,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:11:23" (1/1) ... [2025-03-17 19:11:23,253 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:11:23" (1/1) ... [2025-03-17 19:11:23,304 INFO L138 Inliner]: procedures = 177, calls = 279, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1418 [2025-03-17 19:11:23,304 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:11:23,305 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:11:23,305 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:11:23,305 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:11:23,311 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:11:23" (1/1) ... [2025-03-17 19:11:23,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:11:23" (1/1) ... [2025-03-17 19:11:23,322 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:11:23" (1/1) ... [2025-03-17 19:11:23,374 INFO L175 MemorySlicer]: Split 255 memory accesses to 3 slices as follows [2, 219, 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-17 19:11:23,375 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:11:23" (1/1) ... [2025-03-17 19:11:23,375 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:11:23" (1/1) ... [2025-03-17 19:11:23,409 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:11:23" (1/1) ... [2025-03-17 19:11:23,411 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:11:23" (1/1) ... [2025-03-17 19:11:23,414 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:11:23" (1/1) ... [2025-03-17 19:11:23,420 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:11:23" (1/1) ... [2025-03-17 19:11:23,429 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:11:23,430 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:11:23,430 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:11:23,430 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:11:23,431 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:11:23" (1/1) ... [2025-03-17 19:11:23,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:11:23,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:11:23,456 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-17 19:11:23,458 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-17 19:11:23,473 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-17 19:11:23,473 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-17 19:11:23,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:11:23,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 19:11:23,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 19:11:23,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 19:11:23,473 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 19:11:23,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:11:23,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 19:11:23,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 19:11:23,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 19:11:23,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 19:11:23,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-17 19:11:23,473 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 19:11:23,473 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 19:11:23,473 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-17 19:11:23,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 19:11:23,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 19:11:23,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 19:11:23,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 19:11:23,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 19:11:23,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 19:11:23,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 19:11:23,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 19:11:23,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 19:11:23,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 19:11:23,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 19:11:23,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 19:11:23,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 19:11:23,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:11:23,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:11:23,623 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:11:23,625 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:11:24,547 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-17 19:11:24,622 INFO L? ?]: Removed 333 outVars from TransFormulas that were not future-live. [2025-03-17 19:11:24,622 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:11:24,670 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:11:24,674 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 19:11:24,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:11:24 BoogieIcfgContainer [2025-03-17 19:11:24,674 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:11:24,676 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 19:11:24,677 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 19:11:24,680 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 19:11:24,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:11:22" (1/3) ... [2025-03-17 19:11:24,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ed562fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:11:24, skipping insertion in model container [2025-03-17 19:11:24,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:11:23" (2/3) ... [2025-03-17 19:11:24,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ed562fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:11:24, skipping insertion in model container [2025-03-17 19:11:24,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:11:24" (3/3) ... [2025-03-17 19:11:24,683 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test3-1.i [2025-03-17 19:11:24,694 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 19:11:24,695 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test3-1.i that has 6 procedures, 428 locations, 1 initial locations, 36 loop locations, and 8 error locations. [2025-03-17 19:11:24,750 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:11:24,759 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;@324e3766, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:11:24,759 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-17 19:11:24,765 INFO L276 IsEmpty]: Start isEmpty. Operand has 420 states, 398 states have (on average 1.6306532663316582) internal successors, (649), 413 states have internal predecessors, (649), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 19:11:24,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 19:11:24,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:11:24,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:11:24,770 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-17 19:11:24,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:11:24,786 INFO L85 PathProgramCache]: Analyzing trace with hash 740394585, now seen corresponding path program 1 times [2025-03-17 19:11:24,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:11:24,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713027619] [2025-03-17 19:11:24,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:11:24,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:11:24,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:11:24,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:11:24,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:11:24,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:11:24,915 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-17 19:11:24,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:11:24,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713027619] [2025-03-17 19:11:24,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713027619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:11:24,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:11:24,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:11:24,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083979520] [2025-03-17 19:11:24,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:11:24,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 19:11:24,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:11:24,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 19:11:24,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 19:11:24,934 INFO L87 Difference]: Start difference. First operand has 420 states, 398 states have (on average 1.6306532663316582) internal successors, (649), 413 states have internal predecessors, (649), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:11:25,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:11:25,038 INFO L93 Difference]: Finished difference Result 837 states and 1341 transitions. [2025-03-17 19:11:25,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 19:11:25,040 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 19:11:25,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:11:25,047 INFO L225 Difference]: With dead ends: 837 [2025-03-17 19:11:25,047 INFO L226 Difference]: Without dead ends: 412 [2025-03-17 19:11:25,050 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-17 19:11:25,051 INFO L435 NwaCegarLoop]: 560 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, 560 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-17 19:11:25,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 560 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:11:25,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-17 19:11:25,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2025-03-17 19:11:25,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 394 states have (on average 1.4695431472081217) internal successors, (579), 406 states have internal predecessors, (579), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 19:11:25,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 595 transitions. [2025-03-17 19:11:25,090 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 595 transitions. Word has length 6 [2025-03-17 19:11:25,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:11:25,090 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 595 transitions. [2025-03-17 19:11:25,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:11:25,090 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 595 transitions. [2025-03-17 19:11:25,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 19:11:25,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:11:25,091 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:11:25,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 19:11:25,091 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-17 19:11:25,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:11:25,091 INFO L85 PathProgramCache]: Analyzing trace with hash 740395546, now seen corresponding path program 1 times [2025-03-17 19:11:25,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:11:25,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866530279] [2025-03-17 19:11:25,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:11:25,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:11:25,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:11:25,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:11:25,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:11:25,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:11:25,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1755879356] [2025-03-17 19:11:25,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:11:25,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:11:25,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:11:25,136 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-17 19:11:25,137 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-17 19:11:25,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:11:25,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:11:25,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:11:25,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:11:25,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 19:11:25,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:11:25,270 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-17 19:11:25,301 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-17 19:11:25,301 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:11:25,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:11:25,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866530279] [2025-03-17 19:11:25,302 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 19:11:25,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755879356] [2025-03-17 19:11:25,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755879356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:11:25,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:11:25,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:11:25,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579262798] [2025-03-17 19:11:25,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:11:25,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:11:25,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:11:25,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:11:25,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:11:25,303 INFO L87 Difference]: Start difference. First operand 412 states and 595 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:11:25,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:11:25,537 INFO L93 Difference]: Finished difference Result 815 states and 1182 transitions. [2025-03-17 19:11:25,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:11:25,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 19:11:25,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:11:25,541 INFO L225 Difference]: With dead ends: 815 [2025-03-17 19:11:25,541 INFO L226 Difference]: Without dead ends: 813 [2025-03-17 19:11:25,542 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-17 19:11:25,543 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 564 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:11:25,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 1582 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:11:25,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2025-03-17 19:11:25,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 418. [2025-03-17 19:11:25,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 400 states have (on average 1.465) internal successors, (586), 412 states have internal predecessors, (586), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 19:11:25,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 602 transitions. [2025-03-17 19:11:25,562 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 602 transitions. Word has length 6 [2025-03-17 19:11:25,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:11:25,562 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 602 transitions. [2025-03-17 19:11:25,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:11:25,562 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 602 transitions. [2025-03-17 19:11:25,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 19:11:25,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:11:25,562 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:11:25,570 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-17 19:11:25,767 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-17 19:11:25,767 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 19:11:25,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:11:25,767 INFO L85 PathProgramCache]: Analyzing trace with hash 199839402, now seen corresponding path program 1 times [2025-03-17 19:11:25,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:11:25,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161307582] [2025-03-17 19:11:25,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:11:25,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:11:25,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:11:25,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:11:25,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:11:25,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:11:25,922 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-17 19:11:25,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:11:25,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161307582] [2025-03-17 19:11:25,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161307582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:11:25,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:11:25,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:11:25,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224346330] [2025-03-17 19:11:25,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:11:25,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:11:25,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:11:25,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:11:25,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:11:25,924 INFO L87 Difference]: Start difference. First operand 418 states and 602 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:11:26,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:11:26,130 INFO L93 Difference]: Finished difference Result 1019 states and 1481 transitions. [2025-03-17 19:11:26,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:11:26,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-17 19:11:26,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:11:26,133 INFO L225 Difference]: With dead ends: 1019 [2025-03-17 19:11:26,134 INFO L226 Difference]: Without dead ends: 812 [2025-03-17 19:11:26,134 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-17 19:11:26,135 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 565 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:11:26,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 1669 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:11:26,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2025-03-17 19:11:26,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 418. [2025-03-17 19:11:26,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 400 states have (on average 1.4625) internal successors, (585), 412 states have internal predecessors, (585), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 19:11:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 601 transitions. [2025-03-17 19:11:26,162 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 601 transitions. Word has length 9 [2025-03-17 19:11:26,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:11:26,162 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 601 transitions. [2025-03-17 19:11:26,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:11:26,163 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 601 transitions. [2025-03-17 19:11:26,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-17 19:11:26,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:11:26,165 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] [2025-03-17 19:11:26,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 19:11:26,165 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-17 19:11:26,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:11:26,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1358593257, now seen corresponding path program 1 times [2025-03-17 19:11:26,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:11:26,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846113281] [2025-03-17 19:11:26,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:11:26,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:11:26,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 19:11:26,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 19:11:26,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:11:26,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:11:26,476 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-17 19:11:26,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:11:26,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846113281] [2025-03-17 19:11:26,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846113281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:11:26,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:11:26,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:11:26,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057542269] [2025-03-17 19:11:26,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:11:26,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:11:26,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:11:26,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:11:26,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:11:26,478 INFO L87 Difference]: Start difference. First operand 418 states and 601 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-17 19:11:26,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:11:26,625 INFO L93 Difference]: Finished difference Result 832 states and 1198 transitions. [2025-03-17 19:11:26,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:11:26,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 78 [2025-03-17 19:11:26,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:11:26,629 INFO L225 Difference]: With dead ends: 832 [2025-03-17 19:11:26,629 INFO L226 Difference]: Without dead ends: 421 [2025-03-17 19:11:26,631 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-17 19:11:26,631 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 105 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1494 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-17 19:11:26,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1494 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:11:26,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-17 19:11:26,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 418. [2025-03-17 19:11:26,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 400 states have (on average 1.445) internal successors, (578), 412 states have internal predecessors, (578), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 19:11:26,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 594 transitions. [2025-03-17 19:11:26,643 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 594 transitions. Word has length 78 [2025-03-17 19:11:26,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:11:26,643 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 594 transitions. [2025-03-17 19:11:26,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-17 19:11:26,644 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 594 transitions. [2025-03-17 19:11:26,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-17 19:11:26,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:11:26,645 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] [2025-03-17 19:11:26,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 19:11:26,646 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-17 19:11:26,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:11:26,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2147329635, now seen corresponding path program 1 times [2025-03-17 19:11:26,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:11:26,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391753152] [2025-03-17 19:11:26,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:11:26,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:11:26,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 19:11:26,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 19:11:26,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:11:26,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:11:26,795 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-17 19:11:26,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:11:26,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391753152] [2025-03-17 19:11:26,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391753152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:11:26,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:11:26,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:11:26,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884031418] [2025-03-17 19:11:26,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:11:26,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:11:26,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:11:26,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:11:26,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:11:26,797 INFO L87 Difference]: Start difference. First operand 418 states and 594 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 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-17 19:11:26,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:11:26,965 INFO L93 Difference]: Finished difference Result 1118 states and 1608 transitions. [2025-03-17 19:11:26,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:11:26,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 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 78 [2025-03-17 19:11:26,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:11:26,968 INFO L225 Difference]: With dead ends: 1118 [2025-03-17 19:11:26,968 INFO L226 Difference]: Without dead ends: 707 [2025-03-17 19:11:26,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:11:26,972 INFO L435 NwaCegarLoop]: 712 mSDtfsCounter, 371 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:11:26,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1234 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:11:26,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2025-03-17 19:11:26,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 703. [2025-03-17 19:11:26,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 685 states have (on average 1.4613138686131386) internal successors, (1001), 697 states have internal predecessors, (1001), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 19:11:26,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1017 transitions. [2025-03-17 19:11:26,990 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1017 transitions. Word has length 78 [2025-03-17 19:11:26,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:11:26,990 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 1017 transitions. [2025-03-17 19:11:26,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 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-17 19:11:26,991 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1017 transitions. [2025-03-17 19:11:26,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 19:11:26,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:11:26,993 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] [2025-03-17 19:11:26,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 19:11:26,993 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-17 19:11:26,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:11:26,994 INFO L85 PathProgramCache]: Analyzing trace with hash 642065105, now seen corresponding path program 1 times [2025-03-17 19:11:26,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:11:26,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007876800] [2025-03-17 19:11:26,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:11:26,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:11:27,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 19:11:27,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 19:11:27,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:11:27,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:11:27,456 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-17 19:11:27,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:11:27,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007876800] [2025-03-17 19:11:27,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007876800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:11:27,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:11:27,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:11:27,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824783150] [2025-03-17 19:11:27,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:11:27,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:11:27,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:11:27,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:11:27,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:11:27,459 INFO L87 Difference]: Start difference. First operand 703 states and 1017 transitions. Second operand has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 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-17 19:11:27,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:11:27,612 INFO L93 Difference]: Finished difference Result 938 states and 1360 transitions. [2025-03-17 19:11:27,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:11:27,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 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 93 [2025-03-17 19:11:27,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:11:27,616 INFO L225 Difference]: With dead ends: 938 [2025-03-17 19:11:27,616 INFO L226 Difference]: Without dead ends: 937 [2025-03-17 19:11:27,617 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-17 19:11:27,618 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 481 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:11:27,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1307 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:11:27,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2025-03-17 19:11:27,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 702. [2025-03-17 19:11:27,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 685 states have (on average 1.4598540145985401) internal successors, (1000), 696 states have internal predecessors, (1000), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 19:11:27,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1016 transitions. [2025-03-17 19:11:27,648 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1016 transitions. Word has length 93 [2025-03-17 19:11:27,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:11:27,650 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 1016 transitions. [2025-03-17 19:11:27,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 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-17 19:11:27,650 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1016 transitions. [2025-03-17 19:11:27,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 19:11:27,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:11:27,654 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-17 19:11:27,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 19:11:27,654 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 19:11:27,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:11:27,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1570817877, now seen corresponding path program 1 times [2025-03-17 19:11:27,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:11:27,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557965484] [2025-03-17 19:11:27,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:11:27,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:11:27,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 19:11:27,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 19:11:27,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:11:27,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:11:27,979 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-17 19:11:27,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:11:27,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557965484] [2025-03-17 19:11:27,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557965484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:11:27,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:11:27,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:11:27,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300928163] [2025-03-17 19:11:27,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:11:27,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:11:27,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:11:27,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:11:27,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:11:27,982 INFO L87 Difference]: Start difference. First operand 702 states and 1016 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-17 19:11:28,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:11:28,159 INFO L93 Difference]: Finished difference Result 1001 states and 1443 transitions. [2025-03-17 19:11:28,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:11:28,160 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-17 19:11:28,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:11:28,165 INFO L225 Difference]: With dead ends: 1001 [2025-03-17 19:11:28,165 INFO L226 Difference]: Without dead ends: 1000 [2025-03-17 19:11:28,165 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-17 19:11:28,166 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 473 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:11:28,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 1565 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:11:28,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2025-03-17 19:11:28,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 765. [2025-03-17 19:11:28,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 745 states have (on average 1.4456375838926174) internal successors, (1077), 756 states have internal predecessors, (1077), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 19:11:28,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1099 transitions. [2025-03-17 19:11:28,188 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1099 transitions. Word has length 94 [2025-03-17 19:11:28,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:11:28,189 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1099 transitions. [2025-03-17 19:11:28,189 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-17 19:11:28,189 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1099 transitions. [2025-03-17 19:11:28,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 19:11:28,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:11:28,191 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] [2025-03-17 19:11:28,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 19:11:28,193 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-17 19:11:28,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:11:28,193 INFO L85 PathProgramCache]: Analyzing trace with hash -614410080, now seen corresponding path program 1 times [2025-03-17 19:11:28,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:11:28,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136595772] [2025-03-17 19:11:28,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:11:28,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:11:28,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 19:11:28,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 19:11:28,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:11:28,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:11:28,596 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-17 19:11:28,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:11:28,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136595772] [2025-03-17 19:11:28,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136595772] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:11:28,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541323600] [2025-03-17 19:11:28,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:11:28,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:11:28,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:11:28,600 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-17 19:11:28,602 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-17 19:11:28,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 19:11:28,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 19:11:28,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:11:28,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:11:28,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 19:11:28,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:11:28,868 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-17 19:11:28,882 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-17 19:11:28,895 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 23 treesize of output 22 [2025-03-17 19:11:29,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 19:11:29,253 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-17 19:11:29,445 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-17 19:11:29,445 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:11:29,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541323600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:11:29,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:11:29,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 13 [2025-03-17 19:11:29,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234181207] [2025-03-17 19:11:29,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:11:29,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 19:11:29,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:11:29,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 19:11:29,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-17 19:11:29,446 INFO L87 Difference]: Start difference. First operand 765 states and 1099 transitions. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 10 states have internal predecessors, (92), 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-17 19:11:37,580 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-17 19:11:41,623 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-17 19:11:45,774 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-17 19:11:49,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 19:11:54,312 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-17 19:11:59,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 19:12:03,891 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-17 19:12:05,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:12:05,839 INFO L93 Difference]: Finished difference Result 1732 states and 2489 transitions. [2025-03-17 19:12:05,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 19:12:05,841 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 10 states have internal predecessors, (92), 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 99 [2025-03-17 19:12:05,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:12:05,845 INFO L225 Difference]: With dead ends: 1732 [2025-03-17 19:12:05,845 INFO L226 Difference]: Without dead ends: 1052 [2025-03-17 19:12:05,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=90, Invalid=328, Unknown=2, NotChecked=0, Total=420 [2025-03-17 19:12:05,846 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 848 mSDsluCounter, 2213 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 8 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 2737 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.8s IncrementalHoareTripleChecker+Time [2025-03-17 19:12:05,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 2737 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 969 Invalid, 7 Unknown, 0 Unchecked, 27.8s Time] [2025-03-17 19:12:05,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2025-03-17 19:12:05,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 798. [2025-03-17 19:12:05,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 778 states have (on average 1.4383033419023137) internal successors, (1119), 789 states have internal predecessors, (1119), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 19:12:05,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1141 transitions. [2025-03-17 19:12:05,870 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1141 transitions. Word has length 99 [2025-03-17 19:12:05,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:12:05,871 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 1141 transitions. [2025-03-17 19:12:05,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 10 states have internal predecessors, (92), 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-17 19:12:05,871 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1141 transitions. [2025-03-17 19:12:05,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 19:12:05,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:12:05,873 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] [2025-03-17 19:12:05,881 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-17 19:12:06,073 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-17 19:12:06,074 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 19:12:06,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:12:06,074 INFO L85 PathProgramCache]: Analyzing trace with hash 252642145, now seen corresponding path program 1 times [2025-03-17 19:12:06,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:12:06,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297150907] [2025-03-17 19:12:06,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:12:06,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:12:06,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 19:12:06,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 19:12:06,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:12:06,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:12:06,192 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-17 19:12:06,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:12:06,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297150907] [2025-03-17 19:12:06,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297150907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:12:06,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:12:06,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:12:06,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935657216] [2025-03-17 19:12:06,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:12:06,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:12:06,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:12:06,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:12:06,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:12:06,194 INFO L87 Difference]: Start difference. First operand 798 states and 1141 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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-17 19:12:06,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:12:06,381 INFO L93 Difference]: Finished difference Result 1440 states and 2059 transitions. [2025-03-17 19:12:06,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:12:06,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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 99 [2025-03-17 19:12:06,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:12:06,384 INFO L225 Difference]: With dead ends: 1440 [2025-03-17 19:12:06,384 INFO L226 Difference]: Without dead ends: 669 [2025-03-17 19:12:06,386 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-17 19:12:06,387 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 9 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1358 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-17 19:12:06,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1358 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:12:06,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2025-03-17 19:12:06,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 669. [2025-03-17 19:12:06,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 649 states have (on average 1.411402157164869) internal successors, (916), 660 states have internal predecessors, (916), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 19:12:06,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 938 transitions. [2025-03-17 19:12:06,404 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 938 transitions. Word has length 99 [2025-03-17 19:12:06,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:12:06,404 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 938 transitions. [2025-03-17 19:12:06,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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-17 19:12:06,404 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 938 transitions. [2025-03-17 19:12:06,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 19:12:06,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:12:06,405 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-17 19:12:06,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 19:12:06,405 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-17 19:12:06,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:12:06,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1361007436, now seen corresponding path program 1 times [2025-03-17 19:12:06,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:12:06,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15473360] [2025-03-17 19:12:06,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:12:06,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:12:06,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 19:12:06,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 19:12:06,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:12:06,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:12:06,686 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-17 19:12:06,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:12:06,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15473360] [2025-03-17 19:12:06,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15473360] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:12:06,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887680686] [2025-03-17 19:12:06,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:12:06,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:12:06,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:12:06,688 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-17 19:12:06,690 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-17 19:12:06,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 19:12:07,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 19:12:07,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:12:07,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:12:07,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 19:12:07,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:12:39,573 WARN L286 SmtUtils]: Spent 12.04s 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-17 19:12:51,585 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)