./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:09:42,894 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:09:42,942 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 19:09:42,949 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:09:42,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:09:42,967 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:09:42,968 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:09:42,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:09:42,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:09:42,969 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:09:42,969 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 19:09:42,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 19:09:42,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:09:42,969 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:09:42,969 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:09:42,969 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:09:42,969 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 19:09:42,969 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 19:09:42,970 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:09:42,970 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 19:09:42,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:09:42,970 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 19:09:42,970 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 19:09:42,970 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 19:09:42,970 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 19:09:42,970 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:09:42,970 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 19:09:42,970 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:09:42,970 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:09:42,970 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:09:42,971 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:09:42,971 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:09:42,971 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 19:09:42,971 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 19:09:42,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:09:42,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:09:42,971 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 19:09:42,971 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 19:09:42,971 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 19:09:42,971 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:09:42,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 19:09:42,971 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 19:09:42,971 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 19:09:42,972 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 19:09:42,972 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 19:09:42,972 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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2025-03-17 19:09:43,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:09:43,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:09:43,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:09:43,206 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:09:43,206 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:09:43,208 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test1-1.i [2025-03-17 19:09:44,352 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8496bcd9b/048c52ce720d45709e68c61322a148f8/FLAG0c525ad14 [2025-03-17 19:09:44,608 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:09:44,609 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test1-1.i [2025-03-17 19:09:44,621 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8496bcd9b/048c52ce720d45709e68c61322a148f8/FLAG0c525ad14 [2025-03-17 19:09:44,632 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8496bcd9b/048c52ce720d45709e68c61322a148f8 [2025-03-17 19:09:44,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:09:44,635 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:09:44,636 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:09:44,636 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:09:44,639 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:09:44,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:09:44" (1/1) ... [2025-03-17 19:09:44,640 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fadb9f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:09:44, skipping insertion in model container [2025-03-17 19:09:44,640 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:09:44" (1/1) ... [2025-03-17 19:09:44,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:09:44,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:09:44,951 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:09:45,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:09:45,061 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:09:45,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:09:45 WrapperNode [2025-03-17 19:09:45,063 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:09:45,064 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:09:45,064 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:09:45,064 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:09:45,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:09:45" (1/1) ... [2025-03-17 19:09:45,094 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:09:45" (1/1) ... [2025-03-17 19:09:45,135 INFO L138 Inliner]: procedures = 176, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 779 [2025-03-17 19:09:45,135 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:09:45,136 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:09:45,136 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:09:45,136 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:09:45,142 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:09:45" (1/1) ... [2025-03-17 19:09:45,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:09:45" (1/1) ... [2025-03-17 19:09:45,147 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:09:45" (1/1) ... [2025-03-17 19:09:45,192 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2025-03-17 19:09:45,193 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:09:45" (1/1) ... [2025-03-17 19:09:45,194 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:09:45" (1/1) ... [2025-03-17 19:09:45,213 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:09:45" (1/1) ... [2025-03-17 19:09:45,217 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:09:45" (1/1) ... [2025-03-17 19:09:45,219 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:09:45" (1/1) ... [2025-03-17 19:09:45,223 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:09:45" (1/1) ... [2025-03-17 19:09:45,227 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:09:45,228 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:09:45,228 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:09:45,228 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:09:45,228 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:09:45" (1/1) ... [2025-03-17 19:09:45,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:09:45,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:09:45,257 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 19:09:45,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 19:09:45,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:09:45,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 19:09:45,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:09:45,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 19:09:45,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 19:09:45,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 19:09:45,280 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 19:09:45,280 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 19:09:45,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 19:09:45,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 19:09:45,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 19:09:45,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 19:09:45,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 19:09:45,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 19:09:45,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 19:09:45,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 19:09:45,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 19:09:45,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:09:45,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:09:45,424 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:09:45,425 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:09:46,148 INFO L? ?]: Removed 205 outVars from TransFormulas that were not future-live. [2025-03-17 19:09:46,149 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:09:46,181 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:09:46,181 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 19:09:46,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:09:46 BoogieIcfgContainer [2025-03-17 19:09:46,183 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:09:46,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 19:09:46,185 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 19:09:46,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 19:09:46,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:09:44" (1/3) ... [2025-03-17 19:09:46,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595e150d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:09:46, skipping insertion in model container [2025-03-17 19:09:46,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:09:45" (2/3) ... [2025-03-17 19:09:46,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595e150d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:09:46, skipping insertion in model container [2025-03-17 19:09:46,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:09:46" (3/3) ... [2025-03-17 19:09:46,192 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test1-1.i [2025-03-17 19:09:46,202 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 19:09:46,203 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_nondet_test1-1.i that has 3 procedures, 219 locations, 1 initial locations, 19 loop locations, and 6 error locations. [2025-03-17 19:09:46,248 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:09:46,255 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;@372f3fcf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:09:46,255 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 19:09:46,258 INFO L276 IsEmpty]: Start isEmpty. Operand has 215 states, 204 states have (on average 1.6176470588235294) internal successors, (330), 210 states have internal predecessors, (330), 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-17 19:09:46,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 19:09:46,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:09:46,264 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 19:09:46,265 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:09:46,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:09:46,268 INFO L85 PathProgramCache]: Analyzing trace with hash 11638317, now seen corresponding path program 1 times [2025-03-17 19:09:46,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:09:46,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968242178] [2025-03-17 19:09:46,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:09:46,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:09:46,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:09:46,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:09:46,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:09:46,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:09:46,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:09:46,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:09:46,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968242178] [2025-03-17 19:09:46,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968242178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:09:46,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:09:46,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:09:46,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972084589] [2025-03-17 19:09:46,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:09:46,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:09:46,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:09:46,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:09:46,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:09:46,459 INFO L87 Difference]: Start difference. First operand has 215 states, 204 states have (on average 1.6176470588235294) internal successors, (330), 210 states have internal predecessors, (330), 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 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:09:46,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:09:46,606 INFO L93 Difference]: Finished difference Result 623 states and 984 transitions. [2025-03-17 19:09:46,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:09:46,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-17 19:09:46,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:09:46,618 INFO L225 Difference]: With dead ends: 623 [2025-03-17 19:09:46,618 INFO L226 Difference]: Without dead ends: 404 [2025-03-17 19:09:46,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:09:46,623 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 275 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:09:46,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 550 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:09:46,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-03-17 19:09:46,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 210. [2025-03-17 19:09:46,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 200 states have (on average 1.46) internal successors, (292), 205 states have internal predecessors, (292), 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-17 19:09:46,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 298 transitions. [2025-03-17 19:09:46,679 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 298 transitions. Word has length 4 [2025-03-17 19:09:46,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:09:46,679 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 298 transitions. [2025-03-17 19:09:46,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:09:46,679 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 298 transitions. [2025-03-17 19:09:46,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 19:09:46,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:09:46,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 19:09:46,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 19:09:46,680 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:09:46,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:09:46,681 INFO L85 PathProgramCache]: Analyzing trace with hash 371192804, now seen corresponding path program 1 times [2025-03-17 19:09:46,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:09:46,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123043850] [2025-03-17 19:09:46,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:09:46,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:09:46,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:09:46,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:09:46,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:09:46,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:09:46,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:09:46,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:09:46,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123043850] [2025-03-17 19:09:46,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123043850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:09:46,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:09:46,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:09:46,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260168485] [2025-03-17 19:09:46,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:09:46,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:09:46,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:09:46,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:09:46,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:09:46,877 INFO L87 Difference]: Start difference. First operand 210 states and 298 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:09:46,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:09:46,933 INFO L93 Difference]: Finished difference Result 215 states and 304 transitions. [2025-03-17 19:09:46,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:09:46,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 19:09:46,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:09:46,935 INFO L225 Difference]: With dead ends: 215 [2025-03-17 19:09:46,935 INFO L226 Difference]: Without dead ends: 214 [2025-03-17 19:09:46,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:09:46,936 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 2 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 19:09:46,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 540 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 19:09:46,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-17 19:09:46,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2025-03-17 19:09:46,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 203 states have (on average 1.4532019704433496) internal successors, (295), 208 states have internal predecessors, (295), 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-17 19:09:46,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 301 transitions. [2025-03-17 19:09:46,944 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 301 transitions. Word has length 5 [2025-03-17 19:09:46,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:09:46,944 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 301 transitions. [2025-03-17 19:09:46,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:09:46,944 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 301 transitions. [2025-03-17 19:09:46,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 19:09:46,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:09:46,944 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:09:46,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 19:09:46,945 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:09:46,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:09:46,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1377924643, now seen corresponding path program 1 times [2025-03-17 19:09:46,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:09:46,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795891057] [2025-03-17 19:09:46,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:09:46,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:09:46,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:09:46,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:09:46,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:09:46,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:09:47,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:09:47,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:09:47,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795891057] [2025-03-17 19:09:47,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795891057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:09:47,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:09:47,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:09:47,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175554881] [2025-03-17 19:09:47,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:09:47,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:09:47,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:09:47,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:09:47,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:09:47,059 INFO L87 Difference]: Start difference. First operand 213 states and 301 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:09:47,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:09:47,127 INFO L93 Difference]: Finished difference Result 215 states and 303 transitions. [2025-03-17 19:09:47,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:09:47,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 19:09:47,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:09:47,129 INFO L225 Difference]: With dead ends: 215 [2025-03-17 19:09:47,129 INFO L226 Difference]: Without dead ends: 214 [2025-03-17 19:09:47,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:09:47,129 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 0 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:09:47,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 804 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:09:47,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-17 19:09:47,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2025-03-17 19:09:47,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 204 states have (on average 1.4509803921568627) internal successors, (296), 209 states have internal predecessors, (296), 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-17 19:09:47,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 302 transitions. [2025-03-17 19:09:47,139 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 302 transitions. Word has length 6 [2025-03-17 19:09:47,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:09:47,139 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 302 transitions. [2025-03-17 19:09:47,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:09:47,140 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 302 transitions. [2025-03-17 19:09:47,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-17 19:09:47,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:09:47,144 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:09:47,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 19:09:47,144 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:09:47,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:09:47,145 INFO L85 PathProgramCache]: Analyzing trace with hash 91902548, now seen corresponding path program 1 times [2025-03-17 19:09:47,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:09:47,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794972922] [2025-03-17 19:09:47,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:09:47,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:09:47,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 19:09:47,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 19:09:47,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:09:47,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:09:47,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:09:47,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:09:47,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794972922] [2025-03-17 19:09:47,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794972922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:09:47,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:09:47,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:09:47,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923576796] [2025-03-17 19:09:47,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:09:47,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:09:47,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:09:47,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:09:47,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:09:47,418 INFO L87 Difference]: Start difference. First operand 214 states and 302 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:09:47,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:09:47,528 INFO L93 Difference]: Finished difference Result 425 states and 601 transitions. [2025-03-17 19:09:47,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:09:47,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-17 19:09:47,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:09:47,529 INFO L225 Difference]: With dead ends: 425 [2025-03-17 19:09:47,529 INFO L226 Difference]: Without dead ends: 217 [2025-03-17 19:09:47,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:09:47,532 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 105 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:09:47,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 660 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:09:47,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-17 19:09:47,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 214. [2025-03-17 19:09:47,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 204 states have (on average 1.4166666666666667) internal successors, (289), 209 states have internal predecessors, (289), 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-17 19:09:47,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 295 transitions. [2025-03-17 19:09:47,542 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 295 transitions. Word has length 77 [2025-03-17 19:09:47,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:09:47,542 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 295 transitions. [2025-03-17 19:09:47,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:09:47,542 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 295 transitions. [2025-03-17 19:09:47,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-17 19:09:47,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:09:47,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:09:47,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 19:09:47,547 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:09:47,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:09:47,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1294041171, now seen corresponding path program 1 times [2025-03-17 19:09:47,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:09:47,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735979951] [2025-03-17 19:09:47,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:09:47,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:09:47,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 19:09:47,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 19:09:47,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:09:47,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:09:47,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:09:47,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:09:47,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735979951] [2025-03-17 19:09:47,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735979951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:09:47,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:09:47,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:09:47,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490064552] [2025-03-17 19:09:47,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:09:47,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:09:47,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:09:47,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:09:47,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:09:47,694 INFO L87 Difference]: Start difference. First operand 214 states and 295 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:09:47,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:09:47,790 INFO L93 Difference]: Finished difference Result 547 states and 769 transitions. [2025-03-17 19:09:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:09:47,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-17 19:09:47,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:09:47,792 INFO L225 Difference]: With dead ends: 547 [2025-03-17 19:09:47,792 INFO L226 Difference]: Without dead ends: 339 [2025-03-17 19:09:47,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:09:47,793 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 134 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:09:47,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 526 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:09:47,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-03-17 19:09:47,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2025-03-17 19:09:47,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 329 states have (on average 1.4376899696048633) internal successors, (473), 334 states have internal predecessors, (473), 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-17 19:09:47,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 479 transitions. [2025-03-17 19:09:47,802 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 479 transitions. Word has length 77 [2025-03-17 19:09:47,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:09:47,803 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 479 transitions. [2025-03-17 19:09:47,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:09:47,803 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 479 transitions. [2025-03-17 19:09:47,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 19:09:47,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:09:47,809 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:09:47,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 19:09:47,809 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:09:47,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:09:47,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1596369666, now seen corresponding path program 1 times [2025-03-17 19:09:47,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:09:47,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833400085] [2025-03-17 19:09:47,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:09:47,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:09:47,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 19:09:47,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 19:09:47,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:09:47,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:09:48,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:09:48,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:09:48,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833400085] [2025-03-17 19:09:48,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833400085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:09:48,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:09:48,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:09:48,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474434770] [2025-03-17 19:09:48,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:09:48,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:09:48,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:09:48,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:09:48,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:09:48,040 INFO L87 Difference]: Start difference. First operand 339 states and 479 transitions. Second operand has 4 states, 3 states have (on average 28.333333333333332) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:09:48,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:09:48,141 INFO L93 Difference]: Finished difference Result 404 states and 564 transitions. [2025-03-17 19:09:48,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:09:48,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 28.333333333333332) internal successors, (85), 4 states have internal predecessors, (85), 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 92 [2025-03-17 19:09:48,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:09:48,143 INFO L225 Difference]: With dead ends: 404 [2025-03-17 19:09:48,143 INFO L226 Difference]: Without dead ends: 402 [2025-03-17 19:09:48,143 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-17 19:09:48,144 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 185 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:09:48,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 862 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:09:48,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-03-17 19:09:48,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2025-03-17 19:09:48,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 389 states have (on average 1.4138817480719794) internal successors, (550), 394 states have internal predecessors, (550), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 19:09:48,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 562 transitions. [2025-03-17 19:09:48,158 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 562 transitions. Word has length 92 [2025-03-17 19:09:48,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:09:48,159 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 562 transitions. [2025-03-17 19:09:48,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 28.333333333333332) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:09:48,159 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 562 transitions. [2025-03-17 19:09:48,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 19:09:48,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:09:48,161 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:09:48,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 19:09:48,162 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:09:48,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:09:48,162 INFO L85 PathProgramCache]: Analyzing trace with hash -974054465, now seen corresponding path program 1 times [2025-03-17 19:09:48,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:09:48,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167404134] [2025-03-17 19:09:48,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:09:48,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:09:48,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 19:09:48,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 19:09:48,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:09:48,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:09:48,395 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:09:48,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:09:48,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167404134] [2025-03-17 19:09:48,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167404134] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:09:48,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423003704] [2025-03-17 19:09:48,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:09:48,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:09:48,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:09:48,399 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:09:48,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 19:09:48,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 19:09:48,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 19:09:48,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:09:48,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:09:48,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 19:09:48,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:09:48,776 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:09:48,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:09:48,920 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:09:48,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423003704] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:09:48,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:09:48,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 19:09:48,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631068880] [2025-03-17 19:09:48,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:09:48,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 19:09:48,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:09:48,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 19:09:48,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:09:48,922 INFO L87 Difference]: Start difference. First operand 402 states and 562 transitions. Second operand has 10 states, 10 states have (on average 25.6) internal successors, (256), 10 states have internal predecessors, (256), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 19:09:49,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:09:49,092 INFO L93 Difference]: Finished difference Result 606 states and 849 transitions. [2025-03-17 19:09:49,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:09:49,093 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 25.6) internal successors, (256), 10 states have internal predecessors, (256), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 96 [2025-03-17 19:09:49,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:09:49,095 INFO L225 Difference]: With dead ends: 606 [2025-03-17 19:09:49,095 INFO L226 Difference]: Without dead ends: 600 [2025-03-17 19:09:49,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:09:49,099 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 1088 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 1670 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:09:49,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1095 Valid, 1670 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:09:49,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-03-17 19:09:49,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 598. [2025-03-17 19:09:49,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 582 states have (on average 1.4140893470790379) internal successors, (823), 587 states have internal predecessors, (823), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 19:09:49,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 841 transitions. [2025-03-17 19:09:49,122 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 841 transitions. Word has length 96 [2025-03-17 19:09:49,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:09:49,123 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 841 transitions. [2025-03-17 19:09:49,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 25.6) internal successors, (256), 10 states have internal predecessors, (256), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 19:09:49,123 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 841 transitions. [2025-03-17 19:09:49,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 19:09:49,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:09:49,124 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:09:49,132 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-17 19:09:49,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:09:49,325 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:09:49,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:09:49,325 INFO L85 PathProgramCache]: Analyzing trace with hash -120512366, now seen corresponding path program 1 times [2025-03-17 19:09:49,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:09:49,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137171147] [2025-03-17 19:09:49,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:09:49,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:09:49,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 19:09:49,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 19:09:49,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:09:49,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:09:49,858 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:09:49,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:09:49,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137171147] [2025-03-17 19:09:49,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137171147] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:09:49,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253534453] [2025-03-17 19:09:49,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:09:49,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:09:49,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:09:49,863 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:09:49,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 19:09:50,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 19:09:50,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 19:09:50,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:09:50,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:09:50,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 19:09:50,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:09:50,273 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:09:50,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:09:50,408 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:09:50,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253534453] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:09:50,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:09:50,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-17 19:09:50,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075498492] [2025-03-17 19:09:50,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:09:50,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 19:09:50,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:09:50,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 19:09:50,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-03-17 19:09:50,410 INFO L87 Difference]: Start difference. First operand 598 states and 841 transitions. Second operand has 13 states, 12 states have (on average 15.416666666666666) internal successors, (185), 13 states have internal predecessors, (185), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:09:50,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:09:50,656 INFO L93 Difference]: Finished difference Result 804 states and 1132 transitions. [2025-03-17 19:09:50,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 19:09:50,657 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 15.416666666666666) internal successors, (185), 13 states have internal predecessors, (185), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 97 [2025-03-17 19:09:50,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:09:50,660 INFO L225 Difference]: With dead ends: 804 [2025-03-17 19:09:50,660 INFO L226 Difference]: Without dead ends: 803 [2025-03-17 19:09:50,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-03-17 19:09:50,660 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 649 mSDsluCounter, 2137 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 2398 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:09:50,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 2398 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:09:50,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-03-17 19:09:50,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 796. [2025-03-17 19:09:50,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 777 states have (on average 1.4131274131274132) internal successors, (1098), 782 states have internal predecessors, (1098), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 19:09:50,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1122 transitions. [2025-03-17 19:09:50,686 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1122 transitions. Word has length 97 [2025-03-17 19:09:50,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:09:50,686 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1122 transitions. [2025-03-17 19:09:50,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 15.416666666666666) internal successors, (185), 13 states have internal predecessors, (185), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:09:50,686 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1122 transitions. [2025-03-17 19:09:50,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 19:09:50,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:09:50,687 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:09:50,695 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-17 19:09:50,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-17 19:09:50,892 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:09:50,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:09:50,893 INFO L85 PathProgramCache]: Analyzing trace with hash 559084271, now seen corresponding path program 1 times [2025-03-17 19:09:50,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:09:50,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615687808] [2025-03-17 19:09:50,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:09:50,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:09:50,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 19:09:50,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 19:09:50,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:09:50,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:09:51,315 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:09:51,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:09:51,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615687808] [2025-03-17 19:09:51,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615687808] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:09:51,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963007332] [2025-03-17 19:09:51,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:09:51,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:09:51,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:09:51,318 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:09:51,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 19:09:51,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 19:09:51,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 19:09:51,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:09:51,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:09:51,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 19:09:51,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:09:51,681 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:09:51,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:09:51,815 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:09:51,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963007332] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:09:51,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:09:51,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-17 19:09:51,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948935818] [2025-03-17 19:09:51,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:09:51,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 19:09:51,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:09:51,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 19:09:51,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-03-17 19:09:51,817 INFO L87 Difference]: Start difference. First operand 796 states and 1122 transitions. Second operand has 13 states, 12 states have (on average 15.666666666666666) internal successors, (188), 13 states have internal predecessors, (188), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:09:52,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:09:52,058 INFO L93 Difference]: Finished difference Result 804 states and 1129 transitions. [2025-03-17 19:09:52,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 19:09:52,058 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 15.666666666666666) internal successors, (188), 13 states have internal predecessors, (188), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 98 [2025-03-17 19:09:52,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:09:52,061 INFO L225 Difference]: With dead ends: 804 [2025-03-17 19:09:52,062 INFO L226 Difference]: Without dead ends: 803 [2025-03-17 19:09:52,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-03-17 19:09:52,062 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 645 mSDsluCounter, 2239 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 2540 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:09:52,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 2540 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:09:52,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-03-17 19:09:52,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 797. [2025-03-17 19:09:52,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 778 states have (on average 1.4100257069408741) internal successors, (1097), 783 states have internal predecessors, (1097), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 19:09:52,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1121 transitions. [2025-03-17 19:09:52,080 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1121 transitions. Word has length 98 [2025-03-17 19:09:52,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:09:52,080 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 1121 transitions. [2025-03-17 19:09:52,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 15.666666666666666) internal successors, (188), 13 states have internal predecessors, (188), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:09:52,081 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1121 transitions. [2025-03-17 19:09:52,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-17 19:09:52,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:09:52,082 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:09:52,089 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-17 19:09:52,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:09:52,283 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:09:52,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:09:52,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1571115429, now seen corresponding path program 1 times [2025-03-17 19:09:52,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:09:52,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819438390] [2025-03-17 19:09:52,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:09:52,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:09:52,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 19:09:52,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 19:09:52,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:09:52,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:09:52,596 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:09:52,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:09:52,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819438390] [2025-03-17 19:09:52,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819438390] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:09:52,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198419703] [2025-03-17 19:09:52,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:09:52,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:09:52,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:09:52,601 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-17 19:09:52,606 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-17 19:09:52,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 19:09:52,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 19:09:52,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:09:52,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:09:52,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 915 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:09:52,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:09:53,078 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:09:53,078 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:09:53,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198419703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:09:53,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:09:53,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 19:09:53,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537301129] [2025-03-17 19:09:53,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:09:53,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:09:53,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:09:53,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:09:53,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:09:53,079 INFO L87 Difference]: Start difference. First operand 797 states and 1121 transitions. Second operand has 6 states, 5 states have (on average 32.4) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:09:53,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:09:53,227 INFO L93 Difference]: Finished difference Result 797 states and 1121 transitions. [2025-03-17 19:09:53,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:09:53,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 32.4) internal successors, (162), 6 states have internal predecessors, (162), 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 169 [2025-03-17 19:09:53,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:09:53,230 INFO L225 Difference]: With dead ends: 797 [2025-03-17 19:09:53,230 INFO L226 Difference]: Without dead ends: 796 [2025-03-17 19:09:53,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 167 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-17 19:09:53,231 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 379 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:09:53,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1665 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:09:53,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2025-03-17 19:09:53,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 796. [2025-03-17 19:09:53,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 778 states have (on average 1.4061696658097687) internal successors, (1094), 782 states have internal predecessors, (1094), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 19:09:53,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1118 transitions. [2025-03-17 19:09:53,252 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1118 transitions. Word has length 169 [2025-03-17 19:09:53,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:09:53,252 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1118 transitions. [2025-03-17 19:09:53,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 32.4) internal successors, (162), 6 states have internal predecessors, (162), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:09:53,253 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1118 transitions. [2025-03-17 19:09:53,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-03-17 19:09:53,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:09:53,255 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:09:53,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 19:09:53,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:09:53,456 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:09:53,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:09:53,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1727231851, now seen corresponding path program 1 times [2025-03-17 19:09:53,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:09:53,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635658369] [2025-03-17 19:09:53,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:09:53,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:09:53,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-17 19:09:53,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-17 19:09:53,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:09:53,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:09:53,705 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-17 19:09:53,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:09:53,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635658369] [2025-03-17 19:09:53,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635658369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:09:53,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:09:53,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:09:53,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312790758] [2025-03-17 19:09:53,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:09:53,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:09:53,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:09:53,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:09:53,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:09:53,707 INFO L87 Difference]: Start difference. First operand 796 states and 1118 transitions. Second operand has 4 states, 3 states have (on average 55.333333333333336) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:09:53,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:09:53,761 INFO L93 Difference]: Finished difference Result 796 states and 1118 transitions. [2025-03-17 19:09:53,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:09:53,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 55.333333333333336) internal successors, (166), 4 states have internal predecessors, (166), 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 247 [2025-03-17 19:09:53,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:09:53,764 INFO L225 Difference]: With dead ends: 796 [2025-03-17 19:09:53,765 INFO L226 Difference]: Without dead ends: 795 [2025-03-17 19:09:53,766 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-17 19:09:53,766 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 194 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 19:09:53,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 533 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 19:09:53,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2025-03-17 19:09:53,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 795. [2025-03-17 19:09:53,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 778 states have (on average 1.4035989717223651) internal successors, (1092), 781 states have internal predecessors, (1092), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 19:09:53,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1116 transitions. [2025-03-17 19:09:53,787 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1116 transitions. Word has length 247 [2025-03-17 19:09:53,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:09:53,787 INFO L471 AbstractCegarLoop]: Abstraction has 795 states and 1116 transitions. [2025-03-17 19:09:53,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 55.333333333333336) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:09:53,788 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1116 transitions. [2025-03-17 19:09:53,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-17 19:09:53,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:09:53,793 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:09:53,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 19:09:53,794 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:09:53,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:09:53,794 INFO L85 PathProgramCache]: Analyzing trace with hash 2039090271, now seen corresponding path program 1 times [2025-03-17 19:09:53,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:09:53,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797978113] [2025-03-17 19:09:53,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:09:53,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:09:53,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-17 19:09:53,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-17 19:09:53,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:09:53,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:09:54,332 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 230 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:09:54,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:09:54,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797978113] [2025-03-17 19:09:54,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797978113] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:09:54,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002038409] [2025-03-17 19:09:54,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:09:54,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:09:54,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:09:54,335 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-17 19:09:54,337 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-17 19:09:54,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-17 19:09:54,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-17 19:09:54,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:09:54,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:09:54,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 1303 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:09:54,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:09:54,949 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 230 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:09:54,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:09:55,234 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 230 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:09:55,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002038409] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:09:55,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:09:55,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-17 19:09:55,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68141714] [2025-03-17 19:09:55,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:09:55,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 19:09:55,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:09:55,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 19:09:55,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-17 19:09:55,237 INFO L87 Difference]: Start difference. First operand 795 states and 1116 transitions. Second operand has 18 states, 18 states have (on average 31.333333333333332) internal successors, (564), 18 states have internal predecessors, (564), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 19:09:55,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:09:55,590 INFO L93 Difference]: Finished difference Result 1385 states and 1949 transitions. [2025-03-17 19:09:55,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 19:09:55,591 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 31.333333333333332) internal successors, (564), 18 states have internal predecessors, (564), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 250 [2025-03-17 19:09:55,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:09:55,596 INFO L225 Difference]: With dead ends: 1385 [2025-03-17 19:09:55,596 INFO L226 Difference]: Without dead ends: 1380 [2025-03-17 19:09:55,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 491 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-17 19:09:55,597 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 2626 mSDsluCounter, 2693 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2645 SdHoareTripleChecker+Valid, 3032 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 19:09:55,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2645 Valid, 3032 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 19:09:55,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2025-03-17 19:09:55,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1376. [2025-03-17 19:09:55,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1350 states have (on average 1.405925925925926) internal successors, (1898), 1353 states have internal predecessors, (1898), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 19:09:55,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 1940 transitions. [2025-03-17 19:09:55,630 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 1940 transitions. Word has length 250 [2025-03-17 19:09:55,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:09:55,631 INFO L471 AbstractCegarLoop]: Abstraction has 1376 states and 1940 transitions. [2025-03-17 19:09:55,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 31.333333333333332) internal successors, (564), 18 states have internal predecessors, (564), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 19:09:55,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1940 transitions. [2025-03-17 19:09:55,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-17 19:09:55,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:09:55,635 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:09:55,643 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-17 19:09:55,835 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,SelfDestructingSolverStorable11 [2025-03-17 19:09:55,836 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:09:55,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:09:55,837 INFO L85 PathProgramCache]: Analyzing trace with hash -473389703, now seen corresponding path program 1 times [2025-03-17 19:09:55,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:09:55,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580401618] [2025-03-17 19:09:55,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:09:55,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:09:55,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-17 19:09:56,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-17 19:09:56,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:09:56,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:09:57,714 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 472 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:09:57,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:09:57,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580401618] [2025-03-17 19:09:57,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580401618] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:09:57,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444435944] [2025-03-17 19:09:57,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:09:57,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:09:57,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:09:57,716 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-17 19:09:57,718 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-17 19:09:58,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-17 19:09:58,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-17 19:09:58,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:09:58,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:09:58,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 1711 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 19:09:58,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:09:58,609 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 472 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:09:58,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:09:58,990 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 472 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:09:58,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444435944] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:09:58,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:09:58,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-03-17 19:09:58,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215615955] [2025-03-17 19:09:58,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:09:58,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 19:09:58,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:09:58,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 19:09:58,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=498, Unknown=0, NotChecked=0, Total=756 [2025-03-17 19:09:58,992 INFO L87 Difference]: Start difference. First operand 1376 states and 1940 transitions. Second operand has 28 states, 27 states have (on average 24.296296296296298) internal successors, (656), 28 states have internal predecessors, (656), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:09:59,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:09:59,498 INFO L93 Difference]: Finished difference Result 1975 states and 2795 transitions. [2025-03-17 19:09:59,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 19:09:59,499 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 24.296296296296298) internal successors, (656), 28 states have internal predecessors, (656), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 328 [2025-03-17 19:09:59,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:09:59,506 INFO L225 Difference]: With dead ends: 1975 [2025-03-17 19:09:59,506 INFO L226 Difference]: Without dead ends: 1974 [2025-03-17 19:09:59,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 670 GetRequests, 639 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=338, Invalid=718, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 19:09:59,508 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 2691 mSDsluCounter, 3634 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2714 SdHoareTripleChecker+Valid, 3971 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 19:09:59,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2714 Valid, 3971 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 19:09:59,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2025-03-17 19:09:59,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1964. [2025-03-17 19:09:59,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1964 states, 1929 states have (on average 1.405909797822706) internal successors, (2712), 1932 states have internal predecessors, (2712), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 19:09:59,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 2772 transitions. [2025-03-17 19:09:59,550 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 2772 transitions. Word has length 328 [2025-03-17 19:09:59,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:09:59,550 INFO L471 AbstractCegarLoop]: Abstraction has 1964 states and 2772 transitions. [2025-03-17 19:09:59,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 24.296296296296298) internal successors, (656), 28 states have internal predecessors, (656), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:09:59,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 2772 transitions. [2025-03-17 19:09:59,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-03-17 19:09:59,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:09:59,554 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:09:59,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 19:09:59,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:09:59,755 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:09:59,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:09:59,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1790178584, now seen corresponding path program 1 times [2025-03-17 19:09:59,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:09:59,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012208229] [2025-03-17 19:09:59,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:09:59,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:09:59,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-17 19:09:59,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-17 19:09:59,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:09:59,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:10:01,342 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 476 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:10:01,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:10:01,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012208229] [2025-03-17 19:10:01,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012208229] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:10:01,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138670048] [2025-03-17 19:10:01,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:10:01,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:10:01,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:10:01,345 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-17 19:10:01,345 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-17 19:10:01,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-17 19:10:01,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-17 19:10:01,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:10:01,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:10:01,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 1712 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 19:10:01,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:10:02,191 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 476 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:10:02,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:10:02,528 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 476 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:10:02,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138670048] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:10:02,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:10:02,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-03-17 19:10:02,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622131121] [2025-03-17 19:10:02,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:10:02,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 19:10:02,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:10:02,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 19:10:02,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=498, Unknown=0, NotChecked=0, Total=756 [2025-03-17 19:10:02,530 INFO L87 Difference]: Start difference. First operand 1964 states and 2772 transitions. Second operand has 28 states, 27 states have (on average 24.40740740740741) internal successors, (659), 28 states have internal predecessors, (659), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:10:03,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:10:03,045 INFO L93 Difference]: Finished difference Result 1975 states and 2789 transitions. [2025-03-17 19:10:03,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 19:10:03,046 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 24.40740740740741) internal successors, (659), 28 states have internal predecessors, (659), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 329 [2025-03-17 19:10:03,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:10:03,052 INFO L225 Difference]: With dead ends: 1975 [2025-03-17 19:10:03,052 INFO L226 Difference]: Without dead ends: 1974 [2025-03-17 19:10:03,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 641 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=338, Invalid=718, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 19:10:03,053 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 2725 mSDsluCounter, 3854 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2748 SdHoareTripleChecker+Valid, 4192 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 19:10:03,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2748 Valid, 4192 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 19:10:03,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2025-03-17 19:10:03,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1965. [2025-03-17 19:10:03,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1965 states, 1930 states have (on average 1.4031088082901555) internal successors, (2708), 1933 states have internal predecessors, (2708), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 19:10:03,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 2768 transitions. [2025-03-17 19:10:03,100 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 2768 transitions. Word has length 329 [2025-03-17 19:10:03,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:10:03,100 INFO L471 AbstractCegarLoop]: Abstraction has 1965 states and 2768 transitions. [2025-03-17 19:10:03,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 24.40740740740741) internal successors, (659), 28 states have internal predecessors, (659), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:10:03,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2768 transitions. [2025-03-17 19:10:03,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2025-03-17 19:10:03,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:10:03,109 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:10:03,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 19:10:03,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:10:03,309 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:10:03,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:10:03,310 INFO L85 PathProgramCache]: Analyzing trace with hash 531846559, now seen corresponding path program 2 times [2025-03-17 19:10:03,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:10:03,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654415093] [2025-03-17 19:10:03,310 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:10:03,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:10:03,420 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 558 statements into 2 equivalence classes. [2025-03-17 19:10:03,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 558 of 558 statements. [2025-03-17 19:10:03,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:10:03,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:10:04,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1616 backedges. 0 proven. 1612 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:10:04,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:10:04,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654415093] [2025-03-17 19:10:04,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654415093] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:10:04,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945524151] [2025-03-17 19:10:04,504 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:10:04,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:10:04,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:10:04,506 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-17 19:10:04,506 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-17 19:10:04,902 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 558 statements into 2 equivalence classes. [2025-03-17 19:10:05,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 558 of 558 statements. [2025-03-17 19:10:05,134 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:10:05,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:10:05,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 2807 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 19:10:05,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:10:05,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1616 backedges. 0 proven. 1612 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:10:05,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:10:05,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1616 backedges. 0 proven. 1612 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:10:05,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945524151] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:10:05,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:10:05,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-17 19:10:05,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920683726] [2025-03-17 19:10:05,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:10:05,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 19:10:05,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:10:05,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 19:10:05,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-17 19:10:05,959 INFO L87 Difference]: Start difference. First operand 1965 states and 2768 transitions. Second operand has 23 states, 23 states have (on average 34.69565217391305) internal successors, (798), 23 states have internal predecessors, (798), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 19:10:06,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:10:06,308 INFO L93 Difference]: Finished difference Result 1970 states and 2773 transitions. [2025-03-17 19:10:06,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 19:10:06,309 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 34.69565217391305) internal successors, (798), 23 states have internal predecessors, (798), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 558 [2025-03-17 19:10:06,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:10:06,314 INFO L225 Difference]: With dead ends: 1970 [2025-03-17 19:10:06,314 INFO L226 Difference]: Without dead ends: 1965 [2025-03-17 19:10:06,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1131 GetRequests, 1099 SyntacticMatches, 11 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-17 19:10:06,316 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 3169 mSDsluCounter, 3488 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3195 SdHoareTripleChecker+Valid, 3749 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 19:10:06,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3195 Valid, 3749 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 19:10:06,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states. [2025-03-17 19:10:06,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 1965. [2025-03-17 19:10:06,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1965 states, 1930 states have (on average 1.4015544041450778) internal successors, (2705), 1933 states have internal predecessors, (2705), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 19:10:06,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 2765 transitions. [2025-03-17 19:10:06,349 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 2765 transitions. Word has length 558 [2025-03-17 19:10:06,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:10:06,350 INFO L471 AbstractCegarLoop]: Abstraction has 1965 states and 2765 transitions. [2025-03-17 19:10:06,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 34.69565217391305) internal successors, (798), 23 states have internal predecessors, (798), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 19:10:06,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2765 transitions. [2025-03-17 19:10:06,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 790 [2025-03-17 19:10:06,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:10:06,362 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:10:06,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 19:10:06,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 19:10:06,563 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:10:06,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:10:06,564 INFO L85 PathProgramCache]: Analyzing trace with hash -624867304, now seen corresponding path program 3 times [2025-03-17 19:10:06,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:10:06,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726581740] [2025-03-17 19:10:06,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:10:06,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:10:06,725 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 789 statements into 12 equivalence classes. [2025-03-17 19:10:06,810 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 81 of 789 statements. [2025-03-17 19:10:06,810 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 19:10:06,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:10:07,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3461 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 2823 trivial. 0 not checked. [2025-03-17 19:10:07,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:10:07,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726581740] [2025-03-17 19:10:07,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726581740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:10:07,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:10:07,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 19:10:07,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864032501] [2025-03-17 19:10:07,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:10:07,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:10:07,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:10:07,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:10:07,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:10:07,038 INFO L87 Difference]: Start difference. First operand 1965 states and 2765 transitions. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:10:07,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:10:07,543 INFO L93 Difference]: Finished difference Result 4186 states and 5861 transitions. [2025-03-17 19:10:07,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:10:07,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 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 789 [2025-03-17 19:10:07,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:10:07,550 INFO L225 Difference]: With dead ends: 4186 [2025-03-17 19:10:07,551 INFO L226 Difference]: Without dead ends: 2305 [2025-03-17 19:10:07,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:10:07,557 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 13 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 19:10:07,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 787 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 19:10:07,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2025-03-17 19:10:07,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 2265. [2025-03-17 19:10:07,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2265 states, 2230 states have (on average 1.3789237668161436) internal successors, (3075), 2233 states have internal predecessors, (3075), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 19:10:07,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 2265 states and 3135 transitions. [2025-03-17 19:10:07,614 INFO L78 Accepts]: Start accepts. Automaton has 2265 states and 3135 transitions. Word has length 789 [2025-03-17 19:10:07,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:10:07,615 INFO L471 AbstractCegarLoop]: Abstraction has 2265 states and 3135 transitions. [2025-03-17 19:10:07,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:10:07,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2265 states and 3135 transitions. [2025-03-17 19:10:07,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 800 [2025-03-17 19:10:07,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:10:07,627 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:10:07,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 19:10:07,627 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:10:07,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:10:07,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1063356940, now seen corresponding path program 1 times [2025-03-17 19:10:07,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:10:07,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913436724] [2025-03-17 19:10:07,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:10:07,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:10:07,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 799 statements into 1 equivalence classes. [2025-03-17 19:10:08,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 799 of 799 statements. [2025-03-17 19:10:08,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:10:08,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:10:08,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3506 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 3172 trivial. 0 not checked. [2025-03-17 19:10:08,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:10:08,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913436724] [2025-03-17 19:10:08,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913436724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:10:08,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:10:08,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 19:10:08,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494777507] [2025-03-17 19:10:08,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:10:08,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:10:08,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:10:08,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:10:08,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:10:08,726 INFO L87 Difference]: Start difference. First operand 2265 states and 3135 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 7 states have internal predecessors, (130), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:10:09,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:10:09,050 INFO L93 Difference]: Finished difference Result 4526 states and 6288 transitions. [2025-03-17 19:10:09,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:10:09,051 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 7 states have internal predecessors, (130), 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 799 [2025-03-17 19:10:09,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:10:09,056 INFO L225 Difference]: With dead ends: 4526 [2025-03-17 19:10:09,056 INFO L226 Difference]: Without dead ends: 2385 [2025-03-17 19:10:09,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:10:09,058 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 14 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 19:10:09,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 946 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 19:10:09,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2025-03-17 19:10:09,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 2355. [2025-03-17 19:10:09,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2355 states, 2320 states have (on average 1.3814655172413792) internal successors, (3205), 2323 states have internal predecessors, (3205), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 19:10:09,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 2355 states and 3265 transitions. [2025-03-17 19:10:09,091 INFO L78 Accepts]: Start accepts. Automaton has 2355 states and 3265 transitions. Word has length 799 [2025-03-17 19:10:09,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:10:09,091 INFO L471 AbstractCegarLoop]: Abstraction has 2355 states and 3265 transitions. [2025-03-17 19:10:09,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 7 states have internal predecessors, (130), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:10:09,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2355 states and 3265 transitions. [2025-03-17 19:10:09,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 810 [2025-03-17 19:10:09,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:10:09,097 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:10:09,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 19:10:09,097 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:10:09,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:10:09,098 INFO L85 PathProgramCache]: Analyzing trace with hash -467594010, now seen corresponding path program 1 times [2025-03-17 19:10:09,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:10:09,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361239460] [2025-03-17 19:10:09,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:10:09,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:10:09,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 809 statements into 1 equivalence classes. [2025-03-17 19:10:09,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 809 of 809 statements. [2025-03-17 19:10:09,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:10:09,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:10:10,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3551 backedges. 361 proven. 0 refuted. 0 times theorem prover too weak. 3190 trivial. 0 not checked. [2025-03-17 19:10:10,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:10:10,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361239460] [2025-03-17 19:10:10,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361239460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:10:10,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:10:10,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 19:10:10,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109250936] [2025-03-17 19:10:10,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:10:10,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 19:10:10,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:10:10,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 19:10:10,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 19:10:10,599 INFO L87 Difference]: Start difference. First operand 2355 states and 3265 transitions. Second operand has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 9 states have internal predecessors, (134), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:10:11,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:10:11,261 INFO L93 Difference]: Finished difference Result 4722 states and 6561 transitions. [2025-03-17 19:10:11,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 19:10:11,262 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 9 states have internal predecessors, (134), 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 809 [2025-03-17 19:10:11,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:10:11,267 INFO L225 Difference]: With dead ends: 4722 [2025-03-17 19:10:11,267 INFO L226 Difference]: Without dead ends: 2495 [2025-03-17 19:10:11,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 19:10:11,270 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 31 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 19:10:11,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1354 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 19:10:11,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2025-03-17 19:10:11,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2435. [2025-03-17 19:10:11,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2435 states, 2400 states have (on average 1.3770833333333334) internal successors, (3305), 2403 states have internal predecessors, (3305), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 19:10:11,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 3365 transitions. [2025-03-17 19:10:11,302 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 3365 transitions. Word has length 809 [2025-03-17 19:10:11,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:10:11,302 INFO L471 AbstractCegarLoop]: Abstraction has 2435 states and 3365 transitions. [2025-03-17 19:10:11,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.88888888888889) internal successors, (134), 9 states have internal predecessors, (134), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:10:11,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 3365 transitions. [2025-03-17 19:10:11,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 810 [2025-03-17 19:10:11,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:10:11,308 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:10:11,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 19:10:11,309 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:10:11,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:10:11,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1956280034, now seen corresponding path program 1 times [2025-03-17 19:10:11,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:10:11,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620194903] [2025-03-17 19:10:11,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:10:11,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:10:11,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 809 statements into 1 equivalence classes. [2025-03-17 19:10:11,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 809 of 809 statements. [2025-03-17 19:10:11,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:10:11,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:10:12,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3551 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 3226 trivial. 0 not checked. [2025-03-17 19:10:12,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:10:12,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620194903] [2025-03-17 19:10:12,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620194903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:10:12,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:10:12,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 19:10:12,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244435270] [2025-03-17 19:10:12,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:10:12,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:10:12,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:10:12,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:10:12,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:10:12,599 INFO L87 Difference]: Start difference. First operand 2435 states and 3365 transitions. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:10:12,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:10:12,913 INFO L93 Difference]: Finished difference Result 4766 states and 6596 transitions. [2025-03-17 19:10:12,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:10:12,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 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 809 [2025-03-17 19:10:12,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:10:12,919 INFO L225 Difference]: With dead ends: 4766 [2025-03-17 19:10:12,920 INFO L226 Difference]: Without dead ends: 2465 [2025-03-17 19:10:12,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-17 19:10:12,922 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 8 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 19:10:12,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 813 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 19:10:12,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2465 states. [2025-03-17 19:10:12,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2465 to 2465. [2025-03-17 19:10:12,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2465 states, 2430 states have (on average 1.3724279835390947) internal successors, (3335), 2433 states have internal predecessors, (3335), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 19:10:12,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 3395 transitions. [2025-03-17 19:10:12,975 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 3395 transitions. Word has length 809 [2025-03-17 19:10:12,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:10:12,975 INFO L471 AbstractCegarLoop]: Abstraction has 2465 states and 3395 transitions. [2025-03-17 19:10:12,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:10:12,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3395 transitions. [2025-03-17 19:10:12,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2025-03-17 19:10:12,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:10:12,987 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:10:12,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 19:10:12,987 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:10:12,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:10:12,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1346491348, now seen corresponding path program 1 times [2025-03-17 19:10:12,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:10:12,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499083207] [2025-03-17 19:10:12,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:10:12,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:10:13,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 819 statements into 1 equivalence classes.