./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrncat-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-memsafety/openbsd_cstrncat-alloca-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 34885b99d6eef31987b044fabc3622fa239d5dff7e774ca124915f70431dc2b3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:52:16,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:52:16,875 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 08:52:16,878 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:52:16,878 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:52:16,896 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:52:16,896 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:52:16,896 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:52:16,897 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:52:16,897 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:52:16,897 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:52:16,897 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:52:16,897 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:52:16,897 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:52:16,897 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:52:16,898 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:52:16,898 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 08:52:16,898 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:52:16,898 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:52:16,898 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:52:16,898 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:52:16,898 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 08:52:16,898 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:52:16,898 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 08:52:16,898 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 08:52:16,898 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:52:16,899 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:52:16,899 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 08:52:16,899 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:52:16,899 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:52:16,899 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:52:16,899 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:52:16,899 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:52:16,899 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:52:16,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:52:16,899 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:52:16,900 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:52:16,900 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 08:52:16,900 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 08:52:16,900 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:52:16,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:52:16,900 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:52:16,900 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:52:16,900 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:52:16,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:52:16,900 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-jdk21/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 -> 34885b99d6eef31987b044fabc3622fa239d5dff7e774ca124915f70431dc2b3 [2025-02-08 08:52:17,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:52:17,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:52:17,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:52:17,084 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:52:17,084 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:52:17,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrncat-alloca-2.i [2025-02-08 08:52:18,212 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a1f975b86/a9084e1468f4487db51c5caba8c82117/FLAGce7636a98 [2025-02-08 08:52:18,492 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:52:18,498 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrncat-alloca-2.i [2025-02-08 08:52:18,512 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a1f975b86/a9084e1468f4487db51c5caba8c82117/FLAGce7636a98 [2025-02-08 08:52:18,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a1f975b86/a9084e1468f4487db51c5caba8c82117 [2025-02-08 08:52:18,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:52:18,530 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:52:18,531 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:52:18,532 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:52:18,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:52:18,535 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:52:18" (1/1) ... [2025-02-08 08:52:18,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a317b05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:52:18, skipping insertion in model container [2025-02-08 08:52:18,536 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:52:18" (1/1) ... [2025-02-08 08:52:18,560 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:52:18,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:52:18,783 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:52:18,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:52:18,843 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:52:18,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:52:18 WrapperNode [2025-02-08 08:52:18,844 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:52:18,845 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:52:18,845 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:52:18,846 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:52:18,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:52:18" (1/1) ... [2025-02-08 08:52:18,858 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:52:18" (1/1) ... [2025-02-08 08:52:18,875 INFO L138 Inliner]: procedures = 117, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 126 [2025-02-08 08:52:18,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:52:18,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:52:18,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:52:18,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:52:18,884 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:52:18" (1/1) ... [2025-02-08 08:52:18,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:52:18" (1/1) ... [2025-02-08 08:52:18,886 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:52:18" (1/1) ... [2025-02-08 08:52:18,901 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [3, 5]. 63 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 6 writes are split as follows [2, 4]. [2025-02-08 08:52:18,904 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:52:18" (1/1) ... [2025-02-08 08:52:18,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:52:18" (1/1) ... [2025-02-08 08:52:18,908 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:52:18" (1/1) ... [2025-02-08 08:52:18,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:52:18" (1/1) ... [2025-02-08 08:52:18,912 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:52:18" (1/1) ... [2025-02-08 08:52:18,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:52:18" (1/1) ... [2025-02-08 08:52:18,917 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:52:18,918 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:52:18,918 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:52:18,918 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:52:18,919 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:52:18" (1/1) ... [2025-02-08 08:52:18,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:52:18,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:52:18,945 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:52:18,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:52:18,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:52:18,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:52:18,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:52:18,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:52:18,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 08:52:18,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 08:52:18,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:52:18,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:52:19,051 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:52:19,052 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:52:19,218 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L544: call ULTIMATE.dealloc(main_#t~malloc12#1.base, main_#t~malloc12#1.offset);havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call ULTIMATE.dealloc(main_#t~malloc13#1.base, main_#t~malloc13#1.offset);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset; [2025-02-08 08:52:19,229 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2025-02-08 08:52:19,230 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:52:19,240 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:52:19,240 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:52:19,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:52:19 BoogieIcfgContainer [2025-02-08 08:52:19,244 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:52:19,246 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:52:19,246 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:52:19,252 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:52:19,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:52:18" (1/3) ... [2025-02-08 08:52:19,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bc25f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:52:19, skipping insertion in model container [2025-02-08 08:52:19,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:52:18" (2/3) ... [2025-02-08 08:52:19,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bc25f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:52:19, skipping insertion in model container [2025-02-08 08:52:19,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:52:19" (3/3) ... [2025-02-08 08:52:19,256 INFO L128 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncat-alloca-2.i [2025-02-08 08:52:19,275 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:52:19,279 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG openbsd_cstrncat-alloca-2.i that has 1 procedures, 56 locations, 1 initial locations, 4 loop locations, and 16 error locations. [2025-02-08 08:52:19,320 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:52:19,335 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;@4b5d3c8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:52:19,335 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-08 08:52:19,337 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 39 states have (on average 1.794871794871795) internal successors, (70), 55 states have internal predecessors, (70), 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-02-08 08:52:19,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 08:52:19,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:52:19,345 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:52:19,349 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:52:19,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:52:19,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1315051862, now seen corresponding path program 1 times [2025-02-08 08:52:19,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:52:19,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330409905] [2025-02-08 08:52:19,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:52:19,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:52:19,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:52:19,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:52:19,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:52:19,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:19,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:52:19,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:52:19,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330409905] [2025-02-08 08:52:19,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330409905] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:52:19,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:52:19,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:52:19,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513752863] [2025-02-08 08:52:19,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:52:19,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:52:19,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:52:19,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:52:19,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:52:19,566 INFO L87 Difference]: Start difference. First operand has 56 states, 39 states have (on average 1.794871794871795) internal successors, (70), 55 states have internal predecessors, (70), 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) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:52:19,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:52:19,683 INFO L93 Difference]: Finished difference Result 123 states and 157 transitions. [2025-02-08 08:52:19,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:52:19,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 08:52:19,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:52:19,690 INFO L225 Difference]: With dead ends: 123 [2025-02-08 08:52:19,690 INFO L226 Difference]: Without dead ends: 73 [2025-02-08 08:52:19,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:52:19,695 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 97 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:52:19,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 102 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:52:19,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-08 08:52:19,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2025-02-08 08:52:19,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 65 states have internal predecessors, (83), 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-02-08 08:52:19,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2025-02-08 08:52:19,729 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 7 [2025-02-08 08:52:19,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:52:19,729 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2025-02-08 08:52:19,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:52:19,729 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2025-02-08 08:52:19,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 08:52:19,729 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:52:19,729 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:52:19,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:52:19,730 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:52:19,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:52:19,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1315022071, now seen corresponding path program 1 times [2025-02-08 08:52:19,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:52:19,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378640067] [2025-02-08 08:52:19,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:52:19,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:52:19,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 08:52:19,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 08:52:19,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:52:19,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:19,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:52:19,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:52:19,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378640067] [2025-02-08 08:52:19,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378640067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:52:19,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:52:19,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:52:19,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725284491] [2025-02-08 08:52:19,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:52:19,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:52:19,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:52:19,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:52:19,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:52:19,783 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:52:19,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:52:19,855 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2025-02-08 08:52:19,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:52:19,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 08:52:19,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:52:19,856 INFO L225 Difference]: With dead ends: 73 [2025-02-08 08:52:19,856 INFO L226 Difference]: Without dead ends: 70 [2025-02-08 08:52:19,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-02-08 08:52:19,857 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 71 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:52:19,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 77 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:52:19,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-08 08:52:19,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 41. [2025-02-08 08:52:19,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 40 states have internal predecessors, (46), 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-02-08 08:52:19,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2025-02-08 08:52:19,860 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 7 [2025-02-08 08:52:19,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:52:19,860 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2025-02-08 08:52:19,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:52:19,860 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2025-02-08 08:52:19,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 08:52:19,861 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:52:19,861 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:52:19,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:52:19,861 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:52:19,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:52:19,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2111902020, now seen corresponding path program 1 times [2025-02-08 08:52:19,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:52:19,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777044970] [2025-02-08 08:52:19,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:52:19,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:52:19,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:52:19,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:52:19,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:52:19,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:19,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:52:19,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:52:19,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777044970] [2025-02-08 08:52:19,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777044970] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:52:19,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:52:19,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:52:19,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939415887] [2025-02-08 08:52:19,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:52:19,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:52:19,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:52:19,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:52:19,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:52:19,940 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-02-08 08:52:19,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:52:19,986 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2025-02-08 08:52:19,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:52:19,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-02-08 08:52:19,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:52:19,986 INFO L225 Difference]: With dead ends: 41 [2025-02-08 08:52:19,987 INFO L226 Difference]: Without dead ends: 37 [2025-02-08 08:52:19,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-02-08 08:52:19,987 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 62 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:52:19,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 36 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:52:19,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-08 08:52:19,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-02-08 08:52:19,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 36 states have internal predecessors, (42), 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-02-08 08:52:19,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2025-02-08 08:52:19,991 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 8 [2025-02-08 08:52:19,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:52:19,991 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-02-08 08:52:19,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-02-08 08:52:19,991 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2025-02-08 08:52:19,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 08:52:19,991 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:52:19,991 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:52:19,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:52:19,992 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:52:19,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:52:19,992 INFO L85 PathProgramCache]: Analyzing trace with hash 754409072, now seen corresponding path program 1 times [2025-02-08 08:52:19,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:52:19,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133979742] [2025-02-08 08:52:19,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:52:19,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:52:19,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:52:20,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:52:20,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:52:20,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:20,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:52:20,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:52:20,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133979742] [2025-02-08 08:52:20,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133979742] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:52:20,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:52:20,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:52:20,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737843317] [2025-02-08 08:52:20,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:52:20,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:52:20,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:52:20,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:52:20,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:52:20,054 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-02-08 08:52:20,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:52:20,115 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2025-02-08 08:52:20,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:52:20,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2025-02-08 08:52:20,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:52:20,116 INFO L225 Difference]: With dead ends: 95 [2025-02-08 08:52:20,116 INFO L226 Difference]: Without dead ends: 66 [2025-02-08 08:52:20,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:52:20,117 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 68 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:52:20,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 120 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:52:20,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-08 08:52:20,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 39. [2025-02-08 08:52:20,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 38 states have internal predecessors, (44), 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-02-08 08:52:20,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2025-02-08 08:52:20,121 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 12 [2025-02-08 08:52:20,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:52:20,121 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2025-02-08 08:52:20,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-02-08 08:52:20,121 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2025-02-08 08:52:20,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 08:52:20,122 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:52:20,122 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:52:20,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:52:20,122 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:52:20,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:52:20,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1053045391, now seen corresponding path program 1 times [2025-02-08 08:52:20,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:52:20,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742041420] [2025-02-08 08:52:20,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:52:20,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:52:20,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:52:20,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:52:20,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:52:20,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:20,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:52:20,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:52:20,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742041420] [2025-02-08 08:52:20,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742041420] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:52:20,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:52:20,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:52:20,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559667603] [2025-02-08 08:52:20,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:52:20,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:52:20,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:52:20,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:52:20,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:52:20,150 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-02-08 08:52:20,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:52:20,159 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2025-02-08 08:52:20,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:52:20,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2025-02-08 08:52:20,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:52:20,160 INFO L225 Difference]: With dead ends: 68 [2025-02-08 08:52:20,160 INFO L226 Difference]: Without dead ends: 39 [2025-02-08 08:52:20,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:52:20,160 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:52:20,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:52:20,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-08 08:52:20,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2025-02-08 08:52:20,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 36 states have internal predecessors, (41), 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-02-08 08:52:20,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2025-02-08 08:52:20,163 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 12 [2025-02-08 08:52:20,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:52:20,163 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2025-02-08 08:52:20,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-02-08 08:52:20,164 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2025-02-08 08:52:20,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 08:52:20,164 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:52:20,164 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:52:20,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:52:20,164 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:52:20,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:52:20,165 INFO L85 PathProgramCache]: Analyzing trace with hash 414036143, now seen corresponding path program 1 times [2025-02-08 08:52:20,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:52:20,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937006219] [2025-02-08 08:52:20,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:52:20,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:52:20,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 08:52:20,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 08:52:20,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:52:20,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:20,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:52:20,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:52:20,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937006219] [2025-02-08 08:52:20,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937006219] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:52:20,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:52:20,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:52:20,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383989705] [2025-02-08 08:52:20,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:52:20,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:52:20,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:52:20,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:52:20,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:52:20,217 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-02-08 08:52:20,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:52:20,234 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2025-02-08 08:52:20,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:52:20,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2025-02-08 08:52:20,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:52:20,235 INFO L225 Difference]: With dead ends: 45 [2025-02-08 08:52:20,235 INFO L226 Difference]: Without dead ends: 43 [2025-02-08 08:52:20,235 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-02-08 08:52:20,236 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:52:20,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 105 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:52:20,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-08 08:52:20,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-08 08:52:20,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 42 states have internal predecessors, (48), 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-02-08 08:52:20,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2025-02-08 08:52:20,239 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 14 [2025-02-08 08:52:20,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:52:20,239 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2025-02-08 08:52:20,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-02-08 08:52:20,240 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2025-02-08 08:52:20,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 08:52:20,240 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:52:20,240 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:52:20,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:52:20,240 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:52:20,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:52:20,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1543257269, now seen corresponding path program 1 times [2025-02-08 08:52:20,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:52:20,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183112087] [2025-02-08 08:52:20,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:52:20,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:52:20,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 08:52:20,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 08:52:20,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:52:20,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:20,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:52:20,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:52:20,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183112087] [2025-02-08 08:52:20,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183112087] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:52:20,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:52:20,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:52:20,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048761034] [2025-02-08 08:52:20,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:52:20,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:52:20,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:52:20,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:52:20,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:52:20,276 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-02-08 08:52:20,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:52:20,290 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2025-02-08 08:52:20,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:52:20,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2025-02-08 08:52:20,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:52:20,291 INFO L225 Difference]: With dead ends: 43 [2025-02-08 08:52:20,291 INFO L226 Difference]: Without dead ends: 41 [2025-02-08 08:52:20,291 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-02-08 08:52:20,292 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 20 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:52:20,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 32 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:52:20,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-08 08:52:20,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-02-08 08:52:20,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 40 states have internal predecessors, (46), 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-02-08 08:52:20,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2025-02-08 08:52:20,295 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 16 [2025-02-08 08:52:20,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:52:20,295 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2025-02-08 08:52:20,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-02-08 08:52:20,295 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2025-02-08 08:52:20,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 08:52:20,295 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:52:20,295 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:52:20,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:52:20,296 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:52:20,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:52:20,296 INFO L85 PathProgramCache]: Analyzing trace with hash -596335071, now seen corresponding path program 1 times [2025-02-08 08:52:20,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:52:20,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484558052] [2025-02-08 08:52:20,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:52:20,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:52:20,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:52:20,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:52:20,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:52:20,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:52:20,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:52:20,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484558052] [2025-02-08 08:52:20,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484558052] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:52:20,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:52:20,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:52:20,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361222364] [2025-02-08 08:52:20,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:52:20,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:52:20,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:52:20,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:52:20,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:52:20,324 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-02-08 08:52:20,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:52:20,348 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2025-02-08 08:52:20,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:52:20,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2025-02-08 08:52:20,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:52:20,349 INFO L225 Difference]: With dead ends: 79 [2025-02-08 08:52:20,349 INFO L226 Difference]: Without dead ends: 70 [2025-02-08 08:52:20,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:52:20,350 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 19 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:52:20,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 59 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:52:20,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-08 08:52:20,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2025-02-08 08:52:20,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 60 states have (on average 1.3) internal successors, (78), 65 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:52:20,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2025-02-08 08:52:20,361 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 17 [2025-02-08 08:52:20,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:52:20,361 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2025-02-08 08:52:20,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-02-08 08:52:20,361 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2025-02-08 08:52:20,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 08:52:20,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:52:20,362 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:52:20,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:52:20,362 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:52:20,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:52:20,363 INFO L85 PathProgramCache]: Analyzing trace with hash 911216738, now seen corresponding path program 1 times [2025-02-08 08:52:20,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:52:20,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433443085] [2025-02-08 08:52:20,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:52:20,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:52:20,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:52:20,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:52:20,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:52:20,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:20,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:52:20,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:52:20,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433443085] [2025-02-08 08:52:20,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433443085] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:52:20,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:52:20,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:52:20,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762833745] [2025-02-08 08:52:20,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:52:20,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:52:20,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:52:20,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:52:20,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:52:20,388 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-02-08 08:52:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:52:20,401 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2025-02-08 08:52:20,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:52:20,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 17 [2025-02-08 08:52:20,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:52:20,402 INFO L225 Difference]: With dead ends: 66 [2025-02-08 08:52:20,402 INFO L226 Difference]: Without dead ends: 57 [2025-02-08 08:52:20,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-02-08 08:52:20,403 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:52:20,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 28 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:52:20,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-08 08:52:20,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 32. [2025-02-08 08:52:20,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 31 states have internal predecessors, (37), 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-02-08 08:52:20,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2025-02-08 08:52:20,406 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 17 [2025-02-08 08:52:20,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:52:20,406 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2025-02-08 08:52:20,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-02-08 08:52:20,406 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2025-02-08 08:52:20,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 08:52:20,407 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:52:20,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:52:20,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:52:20,407 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:52:20,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:52:20,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1847352516, now seen corresponding path program 1 times [2025-02-08 08:52:20,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:52:20,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217825803] [2025-02-08 08:52:20,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:52:20,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:52:20,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:52:20,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:52:20,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:52:20,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:20,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:52:20,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:52:20,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217825803] [2025-02-08 08:52:20,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217825803] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:52:20,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:52:20,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:52:20,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222546310] [2025-02-08 08:52:20,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:52:20,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:52:20,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:52:20,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:52:20,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:52:20,450 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-02-08 08:52:20,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:52:20,491 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2025-02-08 08:52:20,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:52:20,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2025-02-08 08:52:20,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:52:20,492 INFO L225 Difference]: With dead ends: 65 [2025-02-08 08:52:20,492 INFO L226 Difference]: Without dead ends: 52 [2025-02-08 08:52:20,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-02-08 08:52:20,493 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:52:20,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 62 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:52:20,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-08 08:52:20,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2025-02-08 08:52:20,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 49 states have internal predecessors, (58), 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-02-08 08:52:20,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2025-02-08 08:52:20,497 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 19 [2025-02-08 08:52:20,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:52:20,497 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-02-08 08:52:20,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-02-08 08:52:20,497 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2025-02-08 08:52:20,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 08:52:20,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:52:20,498 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:52:20,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:52:20,498 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:52:20,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:52:20,498 INFO L85 PathProgramCache]: Analyzing trace with hash -494042819, now seen corresponding path program 1 times [2025-02-08 08:52:20,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:52:20,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285400597] [2025-02-08 08:52:20,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:52:20,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:52:20,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:52:20,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:52:20,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:52:20,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:20,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:52:20,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:52:20,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285400597] [2025-02-08 08:52:20,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285400597] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:52:20,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:52:20,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:52:20,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649378015] [2025-02-08 08:52:20,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:52:20,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:52:20,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:52:20,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:52:20,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:52:20,536 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-02-08 08:52:20,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:52:20,551 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2025-02-08 08:52:20,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:52:20,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2025-02-08 08:52:20,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:52:20,552 INFO L225 Difference]: With dead ends: 58 [2025-02-08 08:52:20,552 INFO L226 Difference]: Without dead ends: 56 [2025-02-08 08:52:20,552 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-02-08 08:52:20,553 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:52:20,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 76 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:52:20,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-08 08:52:20,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-02-08 08:52:20,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 55 states have internal predecessors, (64), 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-02-08 08:52:20,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2025-02-08 08:52:20,557 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 19 [2025-02-08 08:52:20,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:52:20,558 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2025-02-08 08:52:20,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-02-08 08:52:20,558 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2025-02-08 08:52:20,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 08:52:20,558 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:52:20,558 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:52:20,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:52:20,558 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:52:20,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:52:20,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1220889292, now seen corresponding path program 1 times [2025-02-08 08:52:20,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:52:20,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612817562] [2025-02-08 08:52:20,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:52:20,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:52:20,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 08:52:20,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:52:20,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:52:20,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:20,636 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:52:20,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:52:20,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612817562] [2025-02-08 08:52:20,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612817562] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:52:20,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560891949] [2025-02-08 08:52:20,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:52:20,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:52:20,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:52:20,643 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:52:20,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 08:52:20,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 08:52:20,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:52:20,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:52:20,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:20,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:52:20,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:52:20,768 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:52:20,768 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:52:20,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560891949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:52:20,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:52:20,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-08 08:52:20,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645358037] [2025-02-08 08:52:20,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:52:20,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:52:20,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:52:20,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:52:20,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:52:20,771 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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-02-08 08:52:20,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:52:20,793 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2025-02-08 08:52:20,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:52:20,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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 20 [2025-02-08 08:52:20,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:52:20,794 INFO L225 Difference]: With dead ends: 56 [2025-02-08 08:52:20,794 INFO L226 Difference]: Without dead ends: 55 [2025-02-08 08:52:20,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 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-02-08 08:52:20,795 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:52:20,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 74 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:52:20,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-08 08:52:20,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-02-08 08:52:20,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 54 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:52:20,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2025-02-08 08:52:20,802 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 20 [2025-02-08 08:52:20,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:52:20,802 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2025-02-08 08:52:20,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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-02-08 08:52:20,802 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2025-02-08 08:52:20,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 08:52:20,803 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:52:20,803 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:52:20,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 08:52:21,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-08 08:52:21,005 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:52:21,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:52:21,006 INFO L85 PathProgramCache]: Analyzing trace with hash 807137631, now seen corresponding path program 1 times [2025-02-08 08:52:21,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:52:21,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754060692] [2025-02-08 08:52:21,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:52:21,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:52:21,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 08:52:21,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 08:52:21,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:52:21,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:21,064 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:52:21,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:52:21,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754060692] [2025-02-08 08:52:21,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754060692] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:52:21,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202433152] [2025-02-08 08:52:21,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:52:21,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:52:21,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:52:21,066 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:52:21,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 08:52:21,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 08:52:21,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 08:52:21,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:52:21,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:21,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:52:21,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:52:21,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:52:21,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:52:21,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:52:21,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202433152] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:52:21,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:52:21,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-08 08:52:21,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020986730] [2025-02-08 08:52:21,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:52:21,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 08:52:21,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:52:21,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 08:52:21,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:52:21,180 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 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-02-08 08:52:21,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:52:21,206 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2025-02-08 08:52:21,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:52:21,207 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 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 21 [2025-02-08 08:52:21,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:52:21,208 INFO L225 Difference]: With dead ends: 92 [2025-02-08 08:52:21,208 INFO L226 Difference]: Without dead ends: 91 [2025-02-08 08:52:21,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:52:21,209 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:52:21,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:52:21,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-08 08:52:21,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-02-08 08:52:21,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 88 states have (on average 1.1477272727272727) internal successors, (101), 90 states have internal predecessors, (101), 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-02-08 08:52:21,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2025-02-08 08:52:21,215 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 21 [2025-02-08 08:52:21,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:52:21,215 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2025-02-08 08:52:21,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 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-02-08 08:52:21,215 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2025-02-08 08:52:21,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 08:52:21,216 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:52:21,216 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:52:21,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 08:52:21,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:52:21,420 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:52:21,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:52:21,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1421851230, now seen corresponding path program 1 times [2025-02-08 08:52:21,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:52:21,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093798595] [2025-02-08 08:52:21,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:52:21,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:52:21,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:52:21,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:52:21,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:52:21,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:21,511 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:52:21,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:52:21,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093798595] [2025-02-08 08:52:21,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093798595] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:52:21,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:52:21,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:52:21,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596153582] [2025-02-08 08:52:21,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:52:21,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:52:21,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:52:21,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:52:21,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:52:21,512 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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-02-08 08:52:21,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:52:21,587 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2025-02-08 08:52:21,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:52:21,587 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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 25 [2025-02-08 08:52:21,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:52:21,588 INFO L225 Difference]: With dead ends: 106 [2025-02-08 08:52:21,588 INFO L226 Difference]: Without dead ends: 91 [2025-02-08 08:52:21,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:52:21,588 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 51 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:52:21,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 50 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:52:21,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-08 08:52:21,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-02-08 08:52:21,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 88 states have (on average 1.1363636363636365) internal successors, (100), 90 states have internal predecessors, (100), 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-02-08 08:52:21,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2025-02-08 08:52:21,602 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 25 [2025-02-08 08:52:21,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:52:21,602 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2025-02-08 08:52:21,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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-02-08 08:52:21,602 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2025-02-08 08:52:21,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 08:52:21,602 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:52:21,602 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] [2025-02-08 08:52:21,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 08:52:21,603 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:52:21,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:52:21,603 INFO L85 PathProgramCache]: Analyzing trace with hash 127006525, now seen corresponding path program 1 times [2025-02-08 08:52:21,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:52:21,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994031890] [2025-02-08 08:52:21,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:52:21,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:52:21,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 08:52:21,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 08:52:21,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:52:21,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:21,721 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:52:21,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:52:21,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994031890] [2025-02-08 08:52:21,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994031890] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:52:21,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965474811] [2025-02-08 08:52:21,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:52:21,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:52:21,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:52:21,726 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:52:21,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 08:52:21,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 08:52:21,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 08:52:21,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:52:21,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:21,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 08:52:21,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:52:21,900 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:52:21,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:52:22,031 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:52:22,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965474811] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:52:22,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:52:22,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-02-08 08:52:22,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261567723] [2025-02-08 08:52:22,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:52:22,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 08:52:22,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:52:22,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 08:52:22,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2025-02-08 08:52:22,033 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 18 states have internal predecessors, (64), 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-02-08 08:52:22,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:52:22,245 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2025-02-08 08:52:22,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 08:52:22,246 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 18 states have internal predecessors, (64), 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 31 [2025-02-08 08:52:22,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:52:22,246 INFO L225 Difference]: With dead ends: 107 [2025-02-08 08:52:22,246 INFO L226 Difference]: Without dead ends: 92 [2025-02-08 08:52:22,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=560, Unknown=0, NotChecked=0, Total=756 [2025-02-08 08:52:22,247 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 124 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:52:22,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 118 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:52:22,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-08 08:52:22,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2025-02-08 08:52:22,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 88 states have (on average 1.125) internal successors, (99), 90 states have internal predecessors, (99), 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-02-08 08:52:22,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2025-02-08 08:52:22,252 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 31 [2025-02-08 08:52:22,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:52:22,252 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2025-02-08 08:52:22,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 18 states have internal predecessors, (64), 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-02-08 08:52:22,253 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2025-02-08 08:52:22,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-08 08:52:22,253 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:52:22,253 INFO L218 NwaCegarLoop]: trace histogram [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-02-08 08:52:22,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 08:52:22,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:52:22,454 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:52:22,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:52:22,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1501612184, now seen corresponding path program 2 times [2025-02-08 08:52:22,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:52:22,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369019255] [2025-02-08 08:52:22,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:52:22,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:52:22,467 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-08 08:52:22,474 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 08:52:22,474 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:52:22,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:22,526 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-08 08:52:22,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:52:22,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369019255] [2025-02-08 08:52:22,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369019255] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:52:22,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456001830] [2025-02-08 08:52:22,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:52:22,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:52:22,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:52:22,528 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:52:22,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 08:52:22,575 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-08 08:52:22,588 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 08:52:22,588 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:52:22,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:22,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:52:22,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:52:22,617 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-08 08:52:22,617 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:52:22,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456001830] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:52:22,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:52:22,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-02-08 08:52:22,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042360081] [2025-02-08 08:52:22,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:52:22,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:52:22,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:52:22,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:52:22,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:52:22,618 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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-02-08 08:52:22,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:52:22,629 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2025-02-08 08:52:22,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:52:22,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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 37 [2025-02-08 08:52:22,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:52:22,630 INFO L225 Difference]: With dead ends: 91 [2025-02-08 08:52:22,631 INFO L226 Difference]: Without dead ends: 90 [2025-02-08 08:52:22,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:52:22,631 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:52:22,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 66 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:52:22,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-08 08:52:22,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-02-08 08:52:22,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 88 states have (on average 1.1136363636363635) internal successors, (98), 89 states have internal predecessors, (98), 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-02-08 08:52:22,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2025-02-08 08:52:22,636 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 37 [2025-02-08 08:52:22,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:52:22,636 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2025-02-08 08:52:22,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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-02-08 08:52:22,637 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2025-02-08 08:52:22,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 08:52:22,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:52:22,637 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:52:22,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 08:52:22,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-08 08:52:22,842 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:52:22,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:52:22,846 INFO L85 PathProgramCache]: Analyzing trace with hash -694662548, now seen corresponding path program 1 times [2025-02-08 08:52:22,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:52:22,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252216258] [2025-02-08 08:52:22,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:52:22,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:52:22,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 08:52:22,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 08:52:22,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:52:22,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:22,914 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-08 08:52:22,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:52:22,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252216258] [2025-02-08 08:52:22,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252216258] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:52:22,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766583285] [2025-02-08 08:52:22,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:52:22,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:52:22,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:52:22,921 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:52:22,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 08:52:22,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 08:52:22,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 08:52:22,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:52:22,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:22,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:52:22,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:52:23,009 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-08 08:52:23,010 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:52:23,049 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-08 08:52:23,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766583285] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:52:23,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:52:23,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-08 08:52:23,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752839176] [2025-02-08 08:52:23,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:52:23,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 08:52:23,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:52:23,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 08:52:23,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:52:23,051 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 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-02-08 08:52:23,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:52:23,080 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2025-02-08 08:52:23,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:52:23,080 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 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 38 [2025-02-08 08:52:23,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:52:23,081 INFO L225 Difference]: With dead ends: 109 [2025-02-08 08:52:23,081 INFO L226 Difference]: Without dead ends: 108 [2025-02-08 08:52:23,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:52:23,082 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:52:23,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:52:23,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-08 08:52:23,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-02-08 08:52:23,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 106 states have (on average 1.0943396226415094) internal successors, (116), 107 states have internal predecessors, (116), 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-02-08 08:52:23,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2025-02-08 08:52:23,087 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 38 [2025-02-08 08:52:23,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:52:23,087 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2025-02-08 08:52:23,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 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-02-08 08:52:23,088 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2025-02-08 08:52:23,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-08 08:52:23,088 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:52:23,088 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:52:23,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 08:52:23,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-08 08:52:23,293 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:52:23,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:52:23,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1772956624, now seen corresponding path program 2 times [2025-02-08 08:52:23,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:52:23,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874642380] [2025-02-08 08:52:23,294 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:52:23,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:52:23,312 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-08 08:52:23,319 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 39 statements. [2025-02-08 08:52:23,319 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:52:23,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:23,377 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-08 08:52:23,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:52:23,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874642380] [2025-02-08 08:52:23,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874642380] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:52:23,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679652360] [2025-02-08 08:52:23,378 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:52:23,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:52:23,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:52:23,380 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:52:23,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 08:52:23,426 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-08 08:52:23,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 39 statements. [2025-02-08 08:52:23,434 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:52:23,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:23,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:52:23,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:52:23,504 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-08 08:52:23,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:52:23,667 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-08 08:52:23,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679652360] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:52:23,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:52:23,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-02-08 08:52:23,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446143802] [2025-02-08 08:52:23,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:52:23,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:52:23,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:52:23,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:52:23,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:52:23,668 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-02-08 08:52:23,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:52:23,740 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2025-02-08 08:52:23,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:52:23,743 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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 39 [2025-02-08 08:52:23,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:52:23,743 INFO L225 Difference]: With dead ends: 108 [2025-02-08 08:52:23,743 INFO L226 Difference]: Without dead ends: 71 [2025-02-08 08:52:23,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:52:23,744 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 11 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:52:23,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 43 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 08:52:23,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-08 08:52:23,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 57. [2025-02-08 08:52:23,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 56 states have internal predecessors, (60), 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-02-08 08:52:23,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2025-02-08 08:52:23,750 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 39 [2025-02-08 08:52:23,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:52:23,750 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2025-02-08 08:52:23,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-02-08 08:52:23,750 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2025-02-08 08:52:23,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-08 08:52:23,750 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:52:23,751 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:52:23,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 08:52:23,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 08:52:23,951 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-02-08 08:52:23,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:52:23,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1553773341, now seen corresponding path program 2 times [2025-02-08 08:52:23,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:52:23,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507121177] [2025-02-08 08:52:23,952 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:52:23,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:52:23,969 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-02-08 08:52:23,975 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 56 statements. [2025-02-08 08:52:23,975 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:52:23,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:24,035 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-02-08 08:52:24,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:52:24,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507121177] [2025-02-08 08:52:24,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507121177] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:52:24,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131326022] [2025-02-08 08:52:24,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:52:24,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:52:24,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:52:24,037 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:52:24,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 08:52:24,082 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-02-08 08:52:24,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 56 statements. [2025-02-08 08:52:24,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:52:24,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:52:24,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:52:24,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:52:24,172 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-02-08 08:52:24,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:52:24,235 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-02-08 08:52:24,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131326022] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:52:24,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:52:24,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 2, 2] total 9 [2025-02-08 08:52:24,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553237934] [2025-02-08 08:52:24,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:52:24,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:52:24,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:52:24,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:52:24,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:52:24,236 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 11 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:52:24,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:52:24,300 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2025-02-08 08:52:24,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:52:24,300 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-02-08 08:52:24,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:52:24,301 INFO L225 Difference]: With dead ends: 57 [2025-02-08 08:52:24,301 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 08:52:24,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2025-02-08 08:52:24,302 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 41 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:52:24,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 22 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 08:52:24,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 08:52:24,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 08:52:24,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-02-08 08:52:24,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 08:52:24,302 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2025-02-08 08:52:24,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:52:24,303 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 08:52:24,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.8) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:52:24,303 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 08:52:24,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 08:52:24,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2025-02-08 08:52:24,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-02-08 08:52:24,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-02-08 08:52:24,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2025-02-08 08:52:24,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-02-08 08:52:24,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-02-08 08:52:24,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-02-08 08:52:24,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-02-08 08:52:24,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-02-08 08:52:24,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-02-08 08:52:24,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-02-08 08:52:24,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-02-08 08:52:24,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-02-08 08:52:24,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-02-08 08:52:24,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-02-08 08:52:24,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-02-08 08:52:24,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 08:52:24,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:52:24,510 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:52:24,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 08:52:24,919 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:52:24,926 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~short11 [2025-02-08 08:52:24,933 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~short11 [2025-02-08 08:52:24,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:52:24 BoogieIcfgContainer [2025-02-08 08:52:24,933 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:52:24,934 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:52:24,934 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:52:24,934 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:52:24,934 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:52:19" (3/4) ... [2025-02-08 08:52:24,936 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:52:24,952 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-08 08:52:24,952 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 08:52:24,952 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 08:52:24,953 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 08:52:25,063 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:52:25,068 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:52:25,068 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:52:25,068 INFO L158 Benchmark]: Toolchain (without parser) took 6538.30ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 110.5MB in the beginning and 89.7MB in the end (delta: 20.8MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. [2025-02-08 08:52:25,068 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:52:25,068 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.99ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 93.2MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 08:52:25,069 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.21ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 91.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:52:25,069 INFO L158 Benchmark]: Boogie Preprocessor took 39.91ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 90.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:52:25,069 INFO L158 Benchmark]: IcfgBuilder took 326.46ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 72.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 08:52:25,069 INFO L158 Benchmark]: TraceAbstraction took 5687.23ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 72.5MB in the beginning and 97.0MB in the end (delta: -24.4MB). Peak memory consumption was 52.8MB. Max. memory is 16.1GB. [2025-02-08 08:52:25,069 INFO L158 Benchmark]: Witness Printer took 133.84ms. Allocated memory is still 176.2MB. Free memory was 97.0MB in the beginning and 89.7MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:52:25,070 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.99ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 93.2MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.21ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 91.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.91ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 90.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 326.46ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 72.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5687.23ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 72.5MB in the beginning and 97.0MB in the end (delta: -24.4MB). Peak memory consumption was 52.8MB. Max. memory is 16.1GB. * Witness Printer took 133.84ms. Allocated memory is still 176.2MB. Free memory was 97.0MB in the beginning and 89.7MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~short11 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~short11 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 558]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 558]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 552]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 552]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 552]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 552]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 547]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 547]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 547]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 547]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 543]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 543]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 56 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 19, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 594 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 594 mSDsluCounter, 1398 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 842 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 711 IncrementalHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 556 mSDtfsCounter, 711 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 513 GetRequests, 400 SyntacticMatches, 2 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=17, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 111 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 657 NumberOfCodeBlocks, 537 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 811 ConstructedInterpolants, 0 QuantifiedInterpolants, 2235 SizeOfPredicates, 8 NumberOfNonLiveVariables, 663 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 31 InterpolantComputations, 14 PerfectInterpolantSequences, 454/560 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 547]: Location Invariant Derived location invariant: ((((((((n <= 2147483647) && (1 <= i)) && (1 <= length1)) && (length2 <= 2147483646)) && (1 <= length2)) && (length1 <= 2147483647)) && (1 <= n)) || (((((((n <= 2147483647) && (((long long) length2 + 1) <= length1)) && (i == 0)) && (1 <= length1)) && (1 <= length2)) && (length1 <= 2147483647)) && (1 <= n))) - InvariantResult [Line: 552]: Location Invariant Derived location invariant: (((((((((n <= 2147483647) && (1 <= length1)) && (length2 <= 2147483646)) && (1 <= length2)) && (0 <= (i + 2147483648))) && (length1 <= 2147483647)) && (1 <= n)) && (n <= ((long long) length1 + 2147483646))) || (((((((n <= 2147483647) && (i == 0)) && (length2 == 1)) && (1 <= length1)) && (length1 <= 2147483647)) && (length1 <= ((long long) n + 2147483646))) && (n <= ((long long) length1 + 2147483646)))) RESULT: Ultimate proved your program to be correct! [2025-02-08 08:52:25,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE