./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed 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/list-simple/dll2c_insert_unequal.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 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:55:33,981 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:55:34,035 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 01:55:34,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:55:34,041 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:55:34,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:55:34,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:55:34,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:55:34,064 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:55:34,064 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:55:34,064 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:55:34,064 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:55:34,064 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:55:34,064 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:55:34,064 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:55:34,065 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:55:34,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:55:34,066 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:55:34,066 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:55:34,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:55:34,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:55:34,066 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:55:34,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:55:34,067 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:55:34,067 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:55:34,067 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:55:34,067 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:55:34,067 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:55:34,067 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:55:34,067 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:55:34,067 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:55:34,067 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:55:34,067 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:55:34,067 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:55:34,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:55:34,068 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:55:34,068 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:55:34,068 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:55:34,068 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:55:34,068 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:55:34,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:55:34,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:55:34,068 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:55:34,068 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:55:34,068 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:55:34,068 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 -> 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 [2025-03-09 01:55:34,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:55:34,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:55:34,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:55:34,281 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:55:34,281 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:55:34,282 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2025-03-09 01:55:35,408 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/000af8348/323a566a61ab4eafbdefd5121d6e7797/FLAG2a072e467 [2025-03-09 01:55:35,655 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:55:35,655 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2025-03-09 01:55:35,666 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/000af8348/323a566a61ab4eafbdefd5121d6e7797/FLAG2a072e467 [2025-03-09 01:55:35,963 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/000af8348/323a566a61ab4eafbdefd5121d6e7797 [2025-03-09 01:55:35,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:55:35,966 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:55:35,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:55:35,967 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:55:35,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:55:35,970 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:55:35" (1/1) ... [2025-03-09 01:55:35,972 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@614c82e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:35, skipping insertion in model container [2025-03-09 01:55:35,972 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:55:35" (1/1) ... [2025-03-09 01:55:35,996 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:55:36,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:55:36,195 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:55:36,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:55:36,253 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:55:36,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:36 WrapperNode [2025-03-09 01:55:36,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:55:36,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:55:36,256 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:55:36,256 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:55:36,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:36" (1/1) ... [2025-03-09 01:55:36,273 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:36" (1/1) ... [2025-03-09 01:55:36,293 INFO L138 Inliner]: procedures = 127, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 192 [2025-03-09 01:55:36,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:55:36,294 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:55:36,294 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:55:36,294 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:55:36,301 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:36" (1/1) ... [2025-03-09 01:55:36,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:36" (1/1) ... [2025-03-09 01:55:36,304 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:36" (1/1) ... [2025-03-09 01:55:36,322 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 26, 12]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 18 writes are split as follows [0, 17, 1]. [2025-03-09 01:55:36,322 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:36" (1/1) ... [2025-03-09 01:55:36,322 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:36" (1/1) ... [2025-03-09 01:55:36,328 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:36" (1/1) ... [2025-03-09 01:55:36,329 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:36" (1/1) ... [2025-03-09 01:55:36,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:36" (1/1) ... [2025-03-09 01:55:36,331 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:36" (1/1) ... [2025-03-09 01:55:36,333 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:55:36,334 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:55:36,334 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:55:36,334 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:55:36,335 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:36" (1/1) ... [2025-03-09 01:55:36,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:55:36,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:36,360 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-09 01:55:36,362 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-09 01:55:36,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:55:36,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:55:36,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 01:55:36,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:55:36,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:55:36,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 01:55:36,380 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-09 01:55:36,380 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-09 01:55:36,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:55:36,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:55:36,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 01:55:36,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 01:55:36,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 01:55:36,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 01:55:36,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 01:55:36,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 01:55:36,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 01:55:36,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 01:55:36,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-09 01:55:36,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-09 01:55:36,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-09 01:55:36,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:55:36,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:55:36,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 01:55:36,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:55:36,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:55:36,477 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:55:36,478 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:55:36,743 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L642: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-03-09 01:55:36,759 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-09 01:55:36,775 INFO L? ?]: Removed 80 outVars from TransFormulas that were not future-live. [2025-03-09 01:55:36,775 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:55:36,784 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:55:36,784 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:55:36,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:55:36 BoogieIcfgContainer [2025-03-09 01:55:36,785 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:55:36,787 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:55:36,787 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:55:36,790 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:55:36,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:55:35" (1/3) ... [2025-03-09 01:55:36,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe9e011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:55:36, skipping insertion in model container [2025-03-09 01:55:36,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:36" (2/3) ... [2025-03-09 01:55:36,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe9e011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:55:36, skipping insertion in model container [2025-03-09 01:55:36,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:55:36" (3/3) ... [2025-03-09 01:55:36,792 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2025-03-09 01:55:36,802 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:55:36,804 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_insert_unequal.i that has 2 procedures, 69 locations, 1 initial locations, 5 loop locations, and 14 error locations. [2025-03-09 01:55:36,836 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:55:36,843 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;@69956254, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:55:36,844 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-09 01:55:36,846 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 50 states have (on average 1.62) internal successors, (81), 64 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:55:36,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 01:55:36,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:36,851 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:55:36,851 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:55:36,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:36,855 INFO L85 PathProgramCache]: Analyzing trace with hash -34289904, now seen corresponding path program 1 times [2025-03-09 01:55:36,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:36,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063859508] [2025-03-09 01:55:36,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:36,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:36,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:55:36,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:55:36,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:36,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:37,124 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-09 01:55:37,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:37,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063859508] [2025-03-09 01:55:37,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063859508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:37,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:55:37,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:55:37,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391878114] [2025-03-09 01:55:37,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:37,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:55:37,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:37,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:55:37,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:55:37,148 INFO L87 Difference]: Start difference. First operand has 69 states, 50 states have (on average 1.62) internal successors, (81), 64 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 01:55:37,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:37,187 INFO L93 Difference]: Finished difference Result 129 states and 164 transitions. [2025-03-09 01:55:37,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:55:37,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-09 01:55:37,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:37,194 INFO L225 Difference]: With dead ends: 129 [2025-03-09 01:55:37,194 INFO L226 Difference]: Without dead ends: 63 [2025-03-09 01:55:37,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:55:37,199 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 4 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:55:37,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 154 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:55:37,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-09 01:55:37,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2025-03-09 01:55:37,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 54 states have internal predecessors, (61), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:55:37,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2025-03-09 01:55:37,235 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 12 [2025-03-09 01:55:37,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:37,235 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2025-03-09 01:55:37,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 01:55:37,236 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2025-03-09 01:55:37,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-09 01:55:37,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:37,237 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:55:37,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:55:37,238 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:55:37,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:37,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1858598668, now seen corresponding path program 1 times [2025-03-09 01:55:37,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:37,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318234711] [2025-03-09 01:55:37,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:37,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:37,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:55:37,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:55:37,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:37,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:37,420 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:55:37,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:37,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318234711] [2025-03-09 01:55:37,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318234711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:37,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:55:37,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:55:37,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933309996] [2025-03-09 01:55:37,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:37,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:55:37,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:37,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:55:37,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:55:37,424 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-09 01:55:37,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:37,457 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2025-03-09 01:55:37,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:55:37,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 20 [2025-03-09 01:55:37,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:37,460 INFO L225 Difference]: With dead ends: 67 [2025-03-09 01:55:37,460 INFO L226 Difference]: Without dead ends: 65 [2025-03-09 01:55:37,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:55:37,461 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 2 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:55:37,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 177 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:55:37,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-09 01:55:37,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-09 01:55:37,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 59 states have internal predecessors, (67), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 01:55:37,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2025-03-09 01:55:37,472 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 20 [2025-03-09 01:55:37,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:37,472 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2025-03-09 01:55:37,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-09 01:55:37,472 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2025-03-09 01:55:37,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-09 01:55:37,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:37,473 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:55:37,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:55:37,473 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:55:37,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:37,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1283887343, now seen corresponding path program 1 times [2025-03-09 01:55:37,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:37,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447202292] [2025-03-09 01:55:37,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:37,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:37,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:55:37,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:55:37,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:37,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:37,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:55:37,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:37,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447202292] [2025-03-09 01:55:37,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447202292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:37,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:55:37,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:55:37,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137145276] [2025-03-09 01:55:37,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:37,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:55:37,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:37,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:55:37,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:55:37,598 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-09 01:55:37,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:37,618 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2025-03-09 01:55:37,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:55:37,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 24 [2025-03-09 01:55:37,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:37,621 INFO L225 Difference]: With dead ends: 65 [2025-03-09 01:55:37,621 INFO L226 Difference]: Without dead ends: 59 [2025-03-09 01:55:37,621 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-09 01:55:37,622 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 41 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:55:37,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 67 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:55:37,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-09 01:55:37,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-09 01:55:37,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 53 states have internal predecessors, (61), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 01:55:37,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2025-03-09 01:55:37,631 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 24 [2025-03-09 01:55:37,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:37,632 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2025-03-09 01:55:37,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-09 01:55:37,632 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2025-03-09 01:55:37,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-09 01:55:37,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:37,633 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:55:37,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:55:37,633 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:55:37,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:37,635 INFO L85 PathProgramCache]: Analyzing trace with hash -2547723, now seen corresponding path program 1 times [2025-03-09 01:55:37,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:37,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888574043] [2025-03-09 01:55:37,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:37,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:37,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 01:55:37,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 01:55:37,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:37,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:37,809 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:55:37,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:37,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888574043] [2025-03-09 01:55:37,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888574043] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:37,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644308337] [2025-03-09 01:55:37,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:37,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:37,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:37,815 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-09 01:55:37,817 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-09 01:55:37,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 01:55:37,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 01:55:37,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:37,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:37,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:55:37,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:38,007 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:55:38,008 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:55:38,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644308337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:38,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:55:38,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 01:55:38,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361164749] [2025-03-09 01:55:38,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:38,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:55:38,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:38,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:55:38,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:55:38,010 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 01:55:38,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:38,038 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2025-03-09 01:55:38,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:55:38,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2025-03-09 01:55:38,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:38,039 INFO L225 Difference]: With dead ends: 99 [2025-03-09 01:55:38,039 INFO L226 Difference]: Without dead ends: 51 [2025-03-09 01:55:38,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:55:38,040 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 1 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:55:38,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 153 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:55:38,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-09 01:55:38,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-09 01:55:38,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 46 states have internal predecessors, (52), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:55:38,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2025-03-09 01:55:38,043 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 32 [2025-03-09 01:55:38,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:38,044 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2025-03-09 01:55:38,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 01:55:38,044 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2025-03-09 01:55:38,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-09 01:55:38,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:38,044 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:55:38,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 01:55:38,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:38,249 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:55:38,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:38,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1035892335, now seen corresponding path program 1 times [2025-03-09 01:55:38,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:38,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337034597] [2025-03-09 01:55:38,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:38,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:38,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 01:55:38,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:55:38,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:38,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:38,339 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 01:55:38,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:38,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337034597] [2025-03-09 01:55:38,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337034597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:38,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:55:38,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:55:38,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612995038] [2025-03-09 01:55:38,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:38,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:55:38,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:38,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:55:38,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:55:38,340 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:38,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:38,349 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2025-03-09 01:55:38,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:55:38,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2025-03-09 01:55:38,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:38,350 INFO L225 Difference]: With dead ends: 51 [2025-03-09 01:55:38,350 INFO L226 Difference]: Without dead ends: 50 [2025-03-09 01:55:38,350 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-09 01:55:38,351 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:55:38,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 105 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:55:38,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-09 01:55:38,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-09 01:55:38,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 45 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:55:38,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2025-03-09 01:55:38,354 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 34 [2025-03-09 01:55:38,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:38,354 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2025-03-09 01:55:38,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:38,354 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2025-03-09 01:55:38,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-09 01:55:38,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:38,355 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-09 01:55:38,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:55:38,355 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:55:38,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:38,355 INFO L85 PathProgramCache]: Analyzing trace with hash -2047891279, now seen corresponding path program 1 times [2025-03-09 01:55:38,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:38,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057587847] [2025-03-09 01:55:38,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:38,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:38,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 01:55:38,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 01:55:38,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:38,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:38,555 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 01:55:38,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:38,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057587847] [2025-03-09 01:55:38,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057587847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:38,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:55:38,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:55:38,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917387807] [2025-03-09 01:55:38,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:38,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:55:38,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:38,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:55:38,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:55:38,556 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 01:55:38,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:38,583 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2025-03-09 01:55:38,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:55:38,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2025-03-09 01:55:38,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:38,583 INFO L225 Difference]: With dead ends: 50 [2025-03-09 01:55:38,583 INFO L226 Difference]: Without dead ends: 49 [2025-03-09 01:55:38,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:55:38,584 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 34 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:55:38,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 154 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:55:38,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-09 01:55:38,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-09 01:55:38,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 44 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:55:38,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2025-03-09 01:55:38,592 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 35 [2025-03-09 01:55:38,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:38,592 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2025-03-09 01:55:38,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 01:55:38,593 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2025-03-09 01:55:38,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-09 01:55:38,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:38,594 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 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-09 01:55:38,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:55:38,594 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:55:38,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:38,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1303358529, now seen corresponding path program 1 times [2025-03-09 01:55:38,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:38,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944433237] [2025-03-09 01:55:38,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:38,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:38,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 01:55:38,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 01:55:38,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:38,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:38,688 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 01:55:38,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:38,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944433237] [2025-03-09 01:55:38,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944433237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:38,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:55:38,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:55:38,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262493595] [2025-03-09 01:55:38,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:38,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:55:38,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:38,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:55:38,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:55:38,691 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:38,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:38,713 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2025-03-09 01:55:38,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:55:38,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2025-03-09 01:55:38,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:38,717 INFO L225 Difference]: With dead ends: 72 [2025-03-09 01:55:38,717 INFO L226 Difference]: Without dead ends: 51 [2025-03-09 01:55:38,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:55:38,718 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:55:38,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:55:38,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-09 01:55:38,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-09 01:55:38,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 46 states have internal predecessors, (53), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:55:38,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2025-03-09 01:55:38,727 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 38 [2025-03-09 01:55:38,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:38,727 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-03-09 01:55:38,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:38,727 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2025-03-09 01:55:38,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-09 01:55:38,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:38,728 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 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-09 01:55:38,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:55:38,728 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:55:38,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:38,728 INFO L85 PathProgramCache]: Analyzing trace with hash 2036789092, now seen corresponding path program 1 times [2025-03-09 01:55:38,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:38,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986909795] [2025-03-09 01:55:38,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:38,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:38,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 01:55:38,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 01:55:38,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:38,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:38,834 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 01:55:38,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:38,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986909795] [2025-03-09 01:55:38,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986909795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:38,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:55:38,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:55:38,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324802257] [2025-03-09 01:55:38,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:38,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:55:38,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:38,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:55:38,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:55:38,835 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:38,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:38,859 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2025-03-09 01:55:38,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:55:38,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2025-03-09 01:55:38,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:38,861 INFO L225 Difference]: With dead ends: 57 [2025-03-09 01:55:38,861 INFO L226 Difference]: Without dead ends: 55 [2025-03-09 01:55:38,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:55:38,861 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 1 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:55:38,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 148 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:55:38,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-09 01:55:38,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-09 01:55:38,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 50 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:55:38,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2025-03-09 01:55:38,868 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 40 [2025-03-09 01:55:38,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:38,868 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2025-03-09 01:55:38,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:38,868 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2025-03-09 01:55:38,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-09 01:55:38,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:38,869 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-09 01:55:38,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:55:38,869 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:55:38,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:38,869 INFO L85 PathProgramCache]: Analyzing trace with hash -130951950, now seen corresponding path program 1 times [2025-03-09 01:55:38,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:38,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115343988] [2025-03-09 01:55:38,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:38,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:38,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 01:55:38,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 01:55:38,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:38,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:39,042 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-09 01:55:39,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:39,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115343988] [2025-03-09 01:55:39,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115343988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:39,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:55:39,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:55:39,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286401633] [2025-03-09 01:55:39,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:39,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:55:39,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:39,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:55:39,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:55:39,044 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 01:55:39,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:39,068 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2025-03-09 01:55:39,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:55:39,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2025-03-09 01:55:39,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:39,069 INFO L225 Difference]: With dead ends: 82 [2025-03-09 01:55:39,069 INFO L226 Difference]: Without dead ends: 54 [2025-03-09 01:55:39,070 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-09 01:55:39,070 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 35 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:55:39,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 106 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:55:39,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-09 01:55:39,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-09 01:55:39,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.25) internal successors, (55), 49 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:55:39,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2025-03-09 01:55:39,074 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 45 [2025-03-09 01:55:39,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:39,074 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2025-03-09 01:55:39,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 01:55:39,074 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2025-03-09 01:55:39,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-09 01:55:39,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:39,075 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-09 01:55:39,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:55:39,075 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:55:39,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:39,076 INFO L85 PathProgramCache]: Analyzing trace with hash 275583063, now seen corresponding path program 1 times [2025-03-09 01:55:39,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:39,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553298078] [2025-03-09 01:55:39,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:39,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:39,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 01:55:39,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 01:55:39,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:39,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:39,189 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:39,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:39,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553298078] [2025-03-09 01:55:39,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553298078] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:39,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882250907] [2025-03-09 01:55:39,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:39,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:39,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:39,191 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-09 01:55:39,192 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-09 01:55:39,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 01:55:39,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 01:55:39,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:39,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:39,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:55:39,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:39,401 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:39,401 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:55:39,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882250907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:39,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:55:39,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 01:55:39,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040736496] [2025-03-09 01:55:39,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:39,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:55:39,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:39,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:55:39,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:55:39,403 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:39,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:39,443 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2025-03-09 01:55:39,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:55:39,443 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2025-03-09 01:55:39,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:39,443 INFO L225 Difference]: With dead ends: 54 [2025-03-09 01:55:39,443 INFO L226 Difference]: Without dead ends: 53 [2025-03-09 01:55:39,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:55:39,444 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 3 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:55:39,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 228 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:55:39,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-09 01:55:39,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-09 01:55:39,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 48 states have internal predecessors, (54), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:55:39,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2025-03-09 01:55:39,451 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 46 [2025-03-09 01:55:39,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:39,451 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2025-03-09 01:55:39,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:39,451 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2025-03-09 01:55:39,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-09 01:55:39,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:39,453 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:55:39,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:55:39,654 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,SelfDestructingSolverStorable9 [2025-03-09 01:55:39,654 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:55:39,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:39,655 INFO L85 PathProgramCache]: Analyzing trace with hash 275600938, now seen corresponding path program 1 times [2025-03-09 01:55:39,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:39,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388186831] [2025-03-09 01:55:39,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:39,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:39,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 01:55:39,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 01:55:39,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:39,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:39,785 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:39,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:39,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388186831] [2025-03-09 01:55:39,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388186831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:39,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:55:39,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:55:39,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72593603] [2025-03-09 01:55:39,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:39,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:55:39,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:39,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:55:39,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:55:39,787 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:39,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:39,831 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2025-03-09 01:55:39,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:55:39,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2025-03-09 01:55:39,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:39,831 INFO L225 Difference]: With dead ends: 63 [2025-03-09 01:55:39,832 INFO L226 Difference]: Without dead ends: 62 [2025-03-09 01:55:39,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:55:39,832 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 4 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:55:39,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 218 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:55:39,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-09 01:55:39,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2025-03-09 01:55:39,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 52 states have internal predecessors, (59), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:55:39,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2025-03-09 01:55:39,836 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 46 [2025-03-09 01:55:39,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:39,836 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2025-03-09 01:55:39,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:39,836 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2025-03-09 01:55:39,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-09 01:55:39,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:39,837 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-09 01:55:39,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:55:39,837 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:55:39,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:39,837 INFO L85 PathProgramCache]: Analyzing trace with hash -46859622, now seen corresponding path program 1 times [2025-03-09 01:55:39,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:39,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904906395] [2025-03-09 01:55:39,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:39,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:39,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 01:55:39,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 01:55:39,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:39,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:39,948 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:39,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:39,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904906395] [2025-03-09 01:55:39,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904906395] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:39,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129603453] [2025-03-09 01:55:39,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:39,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:39,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:39,951 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-09 01:55:39,953 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-09 01:55:40,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 01:55:40,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 01:55:40,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:40,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:40,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:55:40,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:40,170 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:40,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:55:40,226 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:40,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129603453] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:55:40,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:55:40,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-09 01:55:40,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720917215] [2025-03-09 01:55:40,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:55:40,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:55:40,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:40,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:55:40,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:55:40,227 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:40,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:40,286 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2025-03-09 01:55:40,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:55:40,287 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-03-09 01:55:40,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:40,288 INFO L225 Difference]: With dead ends: 76 [2025-03-09 01:55:40,288 INFO L226 Difference]: Without dead ends: 75 [2025-03-09 01:55:40,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:55:40,288 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 7 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:55:40,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 324 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:55:40,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-09 01:55:40,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2025-03-09 01:55:40,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 66 states have internal predecessors, (75), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:55:40,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2025-03-09 01:55:40,295 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 47 [2025-03-09 01:55:40,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:40,296 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2025-03-09 01:55:40,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:40,296 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2025-03-09 01:55:40,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-09 01:55:40,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:40,296 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:55:40,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:55:40,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:40,497 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:55:40,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:40,497 INFO L85 PathProgramCache]: Analyzing trace with hash -46305509, now seen corresponding path program 1 times [2025-03-09 01:55:40,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:40,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647709218] [2025-03-09 01:55:40,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:40,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:40,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 01:55:40,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 01:55:40,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:40,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:40,604 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:40,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:40,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647709218] [2025-03-09 01:55:40,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647709218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:40,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:55:40,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:55:40,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644359855] [2025-03-09 01:55:40,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:40,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:55:40,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:40,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:55:40,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:55:40,605 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:40,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:40,640 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2025-03-09 01:55:40,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:55:40,640 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-03-09 01:55:40,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:40,641 INFO L225 Difference]: With dead ends: 73 [2025-03-09 01:55:40,641 INFO L226 Difference]: Without dead ends: 72 [2025-03-09 01:55:40,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:55:40,642 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:55:40,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 222 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:55:40,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-09 01:55:40,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-09 01:55:40,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 67 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:55:40,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2025-03-09 01:55:40,646 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 47 [2025-03-09 01:55:40,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:40,646 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2025-03-09 01:55:40,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:40,646 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2025-03-09 01:55:40,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 01:55:40,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:40,648 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:55:40,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:55:40,649 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:55:40,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:40,649 INFO L85 PathProgramCache]: Analyzing trace with hash -802913662, now seen corresponding path program 1 times [2025-03-09 01:55:40,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:40,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125672451] [2025-03-09 01:55:40,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:40,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:40,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 01:55:40,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 01:55:40,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:40,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:40,770 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:40,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:40,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125672451] [2025-03-09 01:55:40,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125672451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:40,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:55:40,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:55:40,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341714637] [2025-03-09 01:55:40,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:40,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:55:40,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:40,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:55:40,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:55:40,771 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:40,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:40,826 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2025-03-09 01:55:40,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:55:40,826 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2025-03-09 01:55:40,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:40,827 INFO L225 Difference]: With dead ends: 78 [2025-03-09 01:55:40,827 INFO L226 Difference]: Without dead ends: 77 [2025-03-09 01:55:40,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:55:40,827 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 4 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:55:40,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 293 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:55:40,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-09 01:55:40,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-09 01:55:40,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 72 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:55:40,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2025-03-09 01:55:40,830 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 50 [2025-03-09 01:55:40,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:40,830 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2025-03-09 01:55:40,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:40,830 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2025-03-09 01:55:40,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-09 01:55:40,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:40,832 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-09 01:55:40,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:55:40,833 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:55:40,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:40,833 INFO L85 PathProgramCache]: Analyzing trace with hash 245995954, now seen corresponding path program 1 times [2025-03-09 01:55:40,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:40,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063537582] [2025-03-09 01:55:40,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:40,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:40,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 01:55:40,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 01:55:40,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:40,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:40,943 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:40,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:40,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063537582] [2025-03-09 01:55:40,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063537582] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:40,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37817903] [2025-03-09 01:55:40,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:40,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:40,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:40,945 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:55:40,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:55:41,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 01:55:41,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 01:55:41,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:41,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:41,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:55:41,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:41,164 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:41,164 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:55:41,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37817903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:41,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:55:41,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2025-03-09 01:55:41,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320371455] [2025-03-09 01:55:41,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:41,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:55:41,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:41,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:55:41,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:55:41,165 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:41,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:41,215 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2025-03-09 01:55:41,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:55:41,215 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2025-03-09 01:55:41,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:41,216 INFO L225 Difference]: With dead ends: 79 [2025-03-09 01:55:41,216 INFO L226 Difference]: Without dead ends: 78 [2025-03-09 01:55:41,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:55:41,216 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 7 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:55:41,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 227 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:55:41,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-09 01:55:41,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2025-03-09 01:55:41,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 71 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:55:41,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2025-03-09 01:55:41,219 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 51 [2025-03-09 01:55:41,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:41,220 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2025-03-09 01:55:41,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:41,220 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2025-03-09 01:55:41,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-09 01:55:41,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:41,220 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:55:41,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 01:55:41,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-09 01:55:41,421 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:55:41,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:41,421 INFO L85 PathProgramCache]: Analyzing trace with hash 879480248, now seen corresponding path program 1 times [2025-03-09 01:55:41,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:41,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904503639] [2025-03-09 01:55:41,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:41,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:41,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 01:55:41,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 01:55:41,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:41,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:41,532 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:41,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:41,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904503639] [2025-03-09 01:55:41,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904503639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:41,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:55:41,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:55:41,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396149046] [2025-03-09 01:55:41,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:41,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:55:41,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:41,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:55:41,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:55:41,534 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:41,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:41,580 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2025-03-09 01:55:41,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:55:41,580 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2025-03-09 01:55:41,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:41,581 INFO L225 Difference]: With dead ends: 81 [2025-03-09 01:55:41,581 INFO L226 Difference]: Without dead ends: 80 [2025-03-09 01:55:41,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:55:41,581 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:55:41,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 249 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:55:41,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-09 01:55:41,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-09 01:55:41,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 72 states have (on average 1.1805555555555556) internal successors, (85), 75 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:55:41,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2025-03-09 01:55:41,588 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 51 [2025-03-09 01:55:41,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:41,588 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2025-03-09 01:55:41,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:41,588 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2025-03-09 01:55:41,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-09 01:55:41,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:41,589 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-09 01:55:41,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:55:41,589 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:55:41,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:41,589 INFO L85 PathProgramCache]: Analyzing trace with hash -964060013, now seen corresponding path program 1 times [2025-03-09 01:55:41,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:41,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109539329] [2025-03-09 01:55:41,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:41,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:41,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 01:55:41,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 01:55:41,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:41,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:41,711 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:41,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:41,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109539329] [2025-03-09 01:55:41,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109539329] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:41,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502295438] [2025-03-09 01:55:41,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:41,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:41,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:41,713 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:55:41,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:55:41,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 01:55:41,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 01:55:41,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:41,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:41,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:55:41,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:41,920 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:41,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:55:41,992 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:41,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502295438] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:55:41,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:55:41,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-09 01:55:41,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403242170] [2025-03-09 01:55:41,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:55:41,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:55:41,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:41,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:55:41,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:55:41,993 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand has 16 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 16 states have internal predecessors, (58), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:42,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:42,054 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2025-03-09 01:55:42,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 01:55:42,054 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 16 states have internal predecessors, (58), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2025-03-09 01:55:42,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:42,055 INFO L225 Difference]: With dead ends: 96 [2025-03-09 01:55:42,055 INFO L226 Difference]: Without dead ends: 95 [2025-03-09 01:55:42,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:55:42,055 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:55:42,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 268 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:55:42,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-09 01:55:42,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2025-03-09 01:55:42,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 80 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:55:42,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2025-03-09 01:55:42,060 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 52 [2025-03-09 01:55:42,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:42,061 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2025-03-09 01:55:42,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 16 states have internal predecessors, (58), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:42,061 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2025-03-09 01:55:42,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 01:55:42,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:42,062 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-09 01:55:42,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 01:55:42,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 01:55:42,268 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:55:42,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:42,269 INFO L85 PathProgramCache]: Analyzing trace with hash 134464010, now seen corresponding path program 1 times [2025-03-09 01:55:42,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:42,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142771599] [2025-03-09 01:55:42,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:42,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:42,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 01:55:42,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 01:55:42,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:42,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:42,400 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:42,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:42,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142771599] [2025-03-09 01:55:42,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142771599] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:42,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898316617] [2025-03-09 01:55:42,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:42,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:42,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:42,402 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:55:42,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:55:42,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 01:55:42,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 01:55:42,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:42,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:42,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:55:42,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:42,637 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:42,637 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:55:42,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898316617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:42,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:55:42,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 11 [2025-03-09 01:55:42,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043003672] [2025-03-09 01:55:42,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:42,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:55:42,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:42,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:55:42,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:55:42,638 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:42,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:42,712 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2025-03-09 01:55:42,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:55:42,712 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2025-03-09 01:55:42,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:42,713 INFO L225 Difference]: With dead ends: 85 [2025-03-09 01:55:42,713 INFO L226 Difference]: Without dead ends: 84 [2025-03-09 01:55:42,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:55:42,713 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 7 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:55:42,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 353 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:55:42,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-09 01:55:42,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2025-03-09 01:55:42,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 72 states have (on average 1.1666666666666667) internal successors, (84), 74 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:55:42,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2025-03-09 01:55:42,717 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 55 [2025-03-09 01:55:42,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:42,717 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2025-03-09 01:55:42,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:42,717 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2025-03-09 01:55:42,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-09 01:55:42,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:42,717 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-09 01:55:42,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 01:55:42,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 01:55:42,918 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:55:42,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:42,918 INFO L85 PathProgramCache]: Analyzing trace with hash -126582992, now seen corresponding path program 1 times [2025-03-09 01:55:42,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:42,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511515583] [2025-03-09 01:55:42,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:42,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:42,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 01:55:42,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 01:55:42,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:42,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:43,050 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:43,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:43,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511515583] [2025-03-09 01:55:43,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511515583] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:43,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798620203] [2025-03-09 01:55:43,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:43,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:43,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:43,052 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:55:43,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:55:43,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 01:55:43,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 01:55:43,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:43,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:43,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:55:43,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:43,277 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:43,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:55:43,375 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:43,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798620203] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:55:43,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:55:43,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-09 01:55:43,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189843252] [2025-03-09 01:55:43,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:55:43,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 01:55:43,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:43,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 01:55:43,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:55:43,377 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand has 20 states, 19 states have (on average 3.473684210526316) internal successors, (66), 20 states have internal predecessors, (66), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:43,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:43,457 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2025-03-09 01:55:43,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 01:55:43,458 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.473684210526316) internal successors, (66), 20 states have internal predecessors, (66), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 56 [2025-03-09 01:55:43,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:43,458 INFO L225 Difference]: With dead ends: 99 [2025-03-09 01:55:43,458 INFO L226 Difference]: Without dead ends: 98 [2025-03-09 01:55:43,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:55:43,459 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 16 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:55:43,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 378 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:55:43,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-09 01:55:43,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 84. [2025-03-09 01:55:43,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 77 states have (on average 1.155844155844156) internal successors, (89), 79 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:55:43,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2025-03-09 01:55:43,464 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 56 [2025-03-09 01:55:43,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:43,464 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2025-03-09 01:55:43,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.473684210526316) internal successors, (66), 20 states have internal predecessors, (66), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:43,464 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2025-03-09 01:55:43,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-09 01:55:43,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:43,467 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2025-03-09 01:55:43,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 01:55:43,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:43,667 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:55:43,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:43,668 INFO L85 PathProgramCache]: Analyzing trace with hash 506383576, now seen corresponding path program 1 times [2025-03-09 01:55:43,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:43,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883760745] [2025-03-09 01:55:43,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:43,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:43,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-09 01:55:43,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-09 01:55:43,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:43,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:43,815 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:43,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:43,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883760745] [2025-03-09 01:55:43,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883760745] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:43,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887843566] [2025-03-09 01:55:43,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:43,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:43,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:43,817 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:55:43,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:55:43,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-09 01:55:44,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-09 01:55:44,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:44,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:44,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 01:55:44,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:44,067 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:44,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:55:44,202 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:44,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887843566] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:55:44,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:55:44,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-09 01:55:44,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001626994] [2025-03-09 01:55:44,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:55:44,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 01:55:44,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:44,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 01:55:44,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2025-03-09 01:55:44,209 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand has 24 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 24 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:44,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:44,292 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2025-03-09 01:55:44,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 01:55:44,293 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 24 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 61 [2025-03-09 01:55:44,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:44,293 INFO L225 Difference]: With dead ends: 122 [2025-03-09 01:55:44,293 INFO L226 Difference]: Without dead ends: 121 [2025-03-09 01:55:44,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2025-03-09 01:55:44,294 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 14 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:55:44,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 424 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:55:44,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-09 01:55:44,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 108. [2025-03-09 01:55:44,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 101 states have (on average 1.118811881188119) internal successors, (113), 103 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:55:44,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2025-03-09 01:55:44,299 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 61 [2025-03-09 01:55:44,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:44,299 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2025-03-09 01:55:44,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 24 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:44,299 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2025-03-09 01:55:44,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-09 01:55:44,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:44,300 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 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-09 01:55:44,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 01:55:44,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:44,500 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:55:44,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:44,501 INFO L85 PathProgramCache]: Analyzing trace with hash 477781266, now seen corresponding path program 2 times [2025-03-09 01:55:44,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:44,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852075614] [2025-03-09 01:55:44,501 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:55:44,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:44,518 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-03-09 01:55:44,534 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 01:55:44,535 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:55:44,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:44,718 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:44,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:44,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852075614] [2025-03-09 01:55:44,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852075614] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:44,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531347030] [2025-03-09 01:55:44,718 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:55:44,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:44,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:44,720 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:55:44,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 01:55:44,877 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-03-09 01:55:44,954 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 01:55:44,955 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:55:44,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:44,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 01:55:44,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:44,998 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:44,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:55:45,126 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:45,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531347030] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:55:45,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:55:45,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-09 01:55:45,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55103372] [2025-03-09 01:55:45,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:55:45,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 01:55:45,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:45,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 01:55:45,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-09 01:55:45,128 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand has 24 states, 23 states have (on average 3.391304347826087) internal successors, (78), 24 states have internal predecessors, (78), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:45,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:45,197 INFO L93 Difference]: Finished difference Result 150 states and 171 transitions. [2025-03-09 01:55:45,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 01:55:45,198 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.391304347826087) internal successors, (78), 24 states have internal predecessors, (78), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 62 [2025-03-09 01:55:45,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:45,199 INFO L225 Difference]: With dead ends: 150 [2025-03-09 01:55:45,199 INFO L226 Difference]: Without dead ends: 149 [2025-03-09 01:55:45,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-09 01:55:45,200 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 31 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:55:45,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 317 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:55:45,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-09 01:55:45,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 137. [2025-03-09 01:55:45,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 130 states have (on average 1.1307692307692307) internal successors, (147), 132 states have internal predecessors, (147), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:55:45,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 153 transitions. [2025-03-09 01:55:45,207 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 153 transitions. Word has length 62 [2025-03-09 01:55:45,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:45,207 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 153 transitions. [2025-03-09 01:55:45,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.391304347826087) internal successors, (78), 24 states have internal predecessors, (78), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:45,208 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 153 transitions. [2025-03-09 01:55:45,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-09 01:55:45,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:45,208 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-09 01:55:45,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 01:55:45,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:45,409 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:55:45,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:45,409 INFO L85 PathProgramCache]: Analyzing trace with hash 2110743133, now seen corresponding path program 1 times [2025-03-09 01:55:45,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:45,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43812774] [2025-03-09 01:55:45,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:45,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:45,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 01:55:45,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 01:55:45,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:45,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:45,595 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:45,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:45,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43812774] [2025-03-09 01:55:45,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43812774] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:45,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060913092] [2025-03-09 01:55:45,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:45,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:45,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:45,598 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:55:45,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 01:55:45,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 01:55:45,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 01:55:45,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:45,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:45,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 01:55:45,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:45,859 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:45,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:55:46,020 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:46,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060913092] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:55:46,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:55:46,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 27 [2025-03-09 01:55:46,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11325817] [2025-03-09 01:55:46,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:55:46,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-09 01:55:46,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:46,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 01:55:46,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2025-03-09 01:55:46,022 INFO L87 Difference]: Start difference. First operand 137 states and 153 transitions. Second operand has 28 states, 27 states have (on average 3.185185185185185) internal successors, (86), 28 states have internal predecessors, (86), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:46,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:46,109 INFO L93 Difference]: Finished difference Result 186 states and 204 transitions. [2025-03-09 01:55:46,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-09 01:55:46,112 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.185185185185185) internal successors, (86), 28 states have internal predecessors, (86), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 66 [2025-03-09 01:55:46,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:46,113 INFO L225 Difference]: With dead ends: 186 [2025-03-09 01:55:46,113 INFO L226 Difference]: Without dead ends: 184 [2025-03-09 01:55:46,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2025-03-09 01:55:46,114 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 23 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:55:46,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 346 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:55:46,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-09 01:55:46,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 137. [2025-03-09 01:55:46,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 130 states have (on average 1.1307692307692307) internal successors, (147), 132 states have internal predecessors, (147), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:55:46,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 153 transitions. [2025-03-09 01:55:46,121 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 153 transitions. Word has length 66 [2025-03-09 01:55:46,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:46,121 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 153 transitions. [2025-03-09 01:55:46,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.185185185185185) internal successors, (86), 28 states have internal predecessors, (86), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:46,121 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 153 transitions. [2025-03-09 01:55:46,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-09 01:55:46,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:46,124 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-09 01:55:46,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 01:55:46,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-09 01:55:46,325 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:55:46,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:46,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1103463088, now seen corresponding path program 2 times [2025-03-09 01:55:46,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:46,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164122516] [2025-03-09 01:55:46,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:55:46,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:46,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-03-09 01:55:46,354 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-03-09 01:55:46,354 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:55:46,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:46,603 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:46,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:46,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164122516] [2025-03-09 01:55:46,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164122516] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:46,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614163043] [2025-03-09 01:55:46,603 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:55:46,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:46,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:46,605 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:55:46,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 01:55:46,777 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-03-09 01:55:46,868 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-03-09 01:55:46,868 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:55:46,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:46,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 01:55:46,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:46,926 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:46,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:55:47,164 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:47,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614163043] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:55:47,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:55:47,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 35 [2025-03-09 01:55:47,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530564827] [2025-03-09 01:55:47,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:55:47,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-09 01:55:47,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:47,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-09 01:55:47,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1003, Unknown=0, NotChecked=0, Total=1260 [2025-03-09 01:55:47,166 INFO L87 Difference]: Start difference. First operand 137 states and 153 transitions. Second operand has 36 states, 35 states have (on average 3.0285714285714285) internal successors, (106), 36 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:47,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:47,279 INFO L93 Difference]: Finished difference Result 212 states and 231 transitions. [2025-03-09 01:55:47,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-09 01:55:47,280 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.0285714285714285) internal successors, (106), 36 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 76 [2025-03-09 01:55:47,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:47,281 INFO L225 Difference]: With dead ends: 212 [2025-03-09 01:55:47,281 INFO L226 Difference]: Without dead ends: 210 [2025-03-09 01:55:47,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1003, Unknown=0, NotChecked=0, Total=1260 [2025-03-09 01:55:47,283 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 31 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:55:47,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 474 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:55:47,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-09 01:55:47,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 133. [2025-03-09 01:55:47,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 126 states have (on average 1.1349206349206349) internal successors, (143), 128 states have internal predecessors, (143), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:55:47,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 149 transitions. [2025-03-09 01:55:47,291 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 149 transitions. Word has length 76 [2025-03-09 01:55:47,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:47,291 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 149 transitions. [2025-03-09 01:55:47,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.0285714285714285) internal successors, (106), 36 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:47,291 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 149 transitions. [2025-03-09 01:55:47,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-09 01:55:47,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:47,292 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:55:47,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 01:55:47,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-09 01:55:47,493 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:55:47,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:47,493 INFO L85 PathProgramCache]: Analyzing trace with hash 209818392, now seen corresponding path program 2 times [2025-03-09 01:55:47,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:47,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36527471] [2025-03-09 01:55:47,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:55:47,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:47,510 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 81 statements into 2 equivalence classes. [2025-03-09 01:55:47,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-03-09 01:55:47,520 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:55:47,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:47,785 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:47,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:47,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36527471] [2025-03-09 01:55:47,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36527471] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:47,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91278171] [2025-03-09 01:55:47,786 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:55:47,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:47,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:47,788 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:55:47,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 01:55:47,974 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 81 statements into 2 equivalence classes. [2025-03-09 01:55:48,093 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-03-09 01:55:48,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:55:48,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:48,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 01:55:48,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:48,162 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:48,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:55:48,469 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:55:48,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91278171] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:55:48,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:55:48,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 39 [2025-03-09 01:55:48,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990728278] [2025-03-09 01:55:48,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:55:48,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-09 01:55:48,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:48,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-09 01:55:48,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=1217, Unknown=0, NotChecked=0, Total=1560 [2025-03-09 01:55:48,472 INFO L87 Difference]: Start difference. First operand 133 states and 149 transitions. Second operand has 40 states, 39 states have (on average 2.9743589743589745) internal successors, (116), 40 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:48,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:48,612 INFO L93 Difference]: Finished difference Result 240 states and 263 transitions. [2025-03-09 01:55:48,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-09 01:55:48,612 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.9743589743589745) internal successors, (116), 40 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 81 [2025-03-09 01:55:48,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:48,613 INFO L225 Difference]: With dead ends: 240 [2025-03-09 01:55:48,613 INFO L226 Difference]: Without dead ends: 239 [2025-03-09 01:55:48,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=343, Invalid=1217, Unknown=0, NotChecked=0, Total=1560 [2025-03-09 01:55:48,614 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 12 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:55:48,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 596 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:55:48,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-09 01:55:48,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 181. [2025-03-09 01:55:48,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 174 states have (on average 1.0977011494252873) internal successors, (191), 176 states have internal predecessors, (191), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:55:48,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 197 transitions. [2025-03-09 01:55:48,625 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 197 transitions. Word has length 81 [2025-03-09 01:55:48,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:48,625 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 197 transitions. [2025-03-09 01:55:48,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.9743589743589745) internal successors, (116), 40 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:55:48,625 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 197 transitions. [2025-03-09 01:55:48,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-09 01:55:48,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:48,626 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:55:48,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-09 01:55:48,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-09 01:55:48,826 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:55:48,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:48,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1317352387, now seen corresponding path program 3 times [2025-03-09 01:55:48,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:48,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529047423] [2025-03-09 01:55:48,827 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:55:48,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:48,845 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 86 statements into 5 equivalence classes. [2025-03-09 01:55:48,930 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 81 of 86 statements. [2025-03-09 01:55:48,930 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-09 01:55:48,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:49,653 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-09 01:55:49,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:49,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529047423] [2025-03-09 01:55:49,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529047423] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:49,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147216547] [2025-03-09 01:55:49,654 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:55:49,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:49,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:49,656 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:55:49,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 01:55:49,831 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 86 statements into 5 equivalence classes. [2025-03-09 01:55:50,659 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 81 of 86 statements. [2025-03-09 01:55:50,659 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-09 01:55:50,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:50,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-09 01:55:50,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:51,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 19 treesize of output 11 [2025-03-09 01:55:51,703 INFO L349 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2025-03-09 01:55:51,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 35 [2025-03-09 01:55:51,802 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 3 proven. 48 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-09 01:55:51,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:55:52,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:55:52,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 66 [2025-03-09 01:55:52,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 8 treesize of output 4 [2025-03-09 01:55:52,790 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:55:52,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147216547] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:55:52,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:55:52,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 29, 19] total 61 [2025-03-09 01:55:52,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455824316] [2025-03-09 01:55:52,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:55:52,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-03-09 01:55:52,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:52,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-03-09 01:55:52,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=3545, Unknown=0, NotChecked=0, Total=3782 [2025-03-09 01:55:52,793 INFO L87 Difference]: Start difference. First operand 181 states and 197 transitions. Second operand has 62 states, 61 states have (on average 2.442622950819672) internal successors, (149), 60 states have internal predecessors, (149), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-09 01:55:55,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:55,304 INFO L93 Difference]: Finished difference Result 570 states and 611 transitions. [2025-03-09 01:55:55,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-03-09 01:55:55,308 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 2.442622950819672) internal successors, (149), 60 states have internal predecessors, (149), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) Word has length 86 [2025-03-09 01:55:55,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:55,310 INFO L225 Difference]: With dead ends: 570 [2025-03-09 01:55:55,311 INFO L226 Difference]: Without dead ends: 568 [2025-03-09 01:55:55,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3582 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1313, Invalid=13939, Unknown=0, NotChecked=0, Total=15252 [2025-03-09 01:55:55,314 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 516 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 01:55:55,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 666 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1305 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 01:55:55,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-03-09 01:55:55,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 173. [2025-03-09 01:55:55,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 166 states have (on average 1.0963855421686748) internal successors, (182), 167 states have internal predecessors, (182), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:55:55,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 188 transitions. [2025-03-09 01:55:55,325 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 188 transitions. Word has length 86 [2025-03-09 01:55:55,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:55,325 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 188 transitions. [2025-03-09 01:55:55,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 2.442622950819672) internal successors, (149), 60 states have internal predecessors, (149), 6 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-09 01:55:55,326 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 188 transitions. [2025-03-09 01:55:55,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-09 01:55:55,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:55,327 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 3, 3, 3, 3, 1, 1, 1, 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-09 01:55:55,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-09 01:55:55,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-09 01:55:55,527 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:55:55,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:55,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1076919314, now seen corresponding path program 3 times [2025-03-09 01:55:55,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:55,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069107282] [2025-03-09 01:55:55,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:55:55,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:55,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 92 statements into 11 equivalence classes. [2025-03-09 01:55:55,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 67 of 92 statements. [2025-03-09 01:55:55,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-09 01:55:55,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2025-03-09 01:55:55,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:55,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069107282] [2025-03-09 01:55:55,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069107282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:55,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:55:55,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:55:55,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620640891] [2025-03-09 01:55:55,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:55,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:55:55,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:55,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:55:55,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:55:55,810 INFO L87 Difference]: Start difference. First operand 173 states and 188 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 01:55:55,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:55,855 INFO L93 Difference]: Finished difference Result 218 states and 233 transitions. [2025-03-09 01:55:55,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:55:55,856 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 92 [2025-03-09 01:55:55,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:55,856 INFO L225 Difference]: With dead ends: 218 [2025-03-09 01:55:55,857 INFO L226 Difference]: Without dead ends: 119 [2025-03-09 01:55:55,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:55:55,859 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 32 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:55:55,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 167 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:55:55,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-09 01:55:55,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-09 01:55:55,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 113 states have (on average 1.0442477876106195) internal successors, (118), 113 states have internal predecessors, (118), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:55:55,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 124 transitions. [2025-03-09 01:55:55,872 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 124 transitions. Word has length 92 [2025-03-09 01:55:55,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:55,872 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 124 transitions. [2025-03-09 01:55:55,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 01:55:55,872 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2025-03-09 01:55:55,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-09 01:55:55,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:55,873 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 01:55:55,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-09 01:55:55,873 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2025-03-09 01:55:55,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:55,874 INFO L85 PathProgramCache]: Analyzing trace with hash -812499048, now seen corresponding path program 3 times [2025-03-09 01:55:55,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:55,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420232927] [2025-03-09 01:55:55,874 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:55:55,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:55,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 121 statements into 15 equivalence classes. [2025-03-09 01:55:55,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 76 of 121 statements. [2025-03-09 01:55:55,989 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-09 01:55:55,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:59,394 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 76 proven. 10 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2025-03-09 01:55:59,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:59,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420232927] [2025-03-09 01:55:59,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420232927] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:59,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274827496] [2025-03-09 01:55:59,395 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:55:59,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:59,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:59,405 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:55:59,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 01:55:59,621 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 121 statements into 15 equivalence classes. [2025-03-09 01:56:01,917 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 76 of 121 statements. [2025-03-09 01:56:01,917 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-09 01:56:01,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:01,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 155 conjuncts are in the unsatisfiable core [2025-03-09 01:56:01,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:56:01,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-09 01:56:02,214 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-09 01:56:02,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-09 01:56:02,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-09 01:56:02,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-09 01:56:02,345 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-09 01:56:02,345 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2025-03-09 01:56:02,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-09 01:56:02,495 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-09 01:56:02,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 58 [2025-03-09 01:56:02,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 22 [2025-03-09 01:56:02,736 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-09 01:56:02,736 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 31 [2025-03-09 01:56:02,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-09 01:56:02,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 01:56:02,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:56:02,936 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-03-09 01:56:02,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 55 [2025-03-09 01:56:02,952 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-09 01:56:02,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-03-09 01:56:02,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2025-03-09 01:56:03,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 63 [2025-03-09 01:56:03,371 INFO L349 Elim1Store]: treesize reduction 130, result has 17.2 percent of original size [2025-03-09 01:56:03,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 299 treesize of output 97 [2025-03-09 01:56:03,944 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2025-03-09 01:56:03,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 131 treesize of output 65 [2025-03-09 01:56:03,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2025-03-09 01:56:04,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2025-03-09 01:56:04,052 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 76 proven. 10 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2025-03-09 01:56:04,052 INFO L312 TraceCheckSpWp]: Computing backward predicates...