./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/Addition01-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 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/recursive/Addition01-2.c -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 4af9e26294eb81d37b6ccb692d0b40e4bed5b0d6d3dd72d6af1a80634692c297 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:29:39,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:29:40,002 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 02:29:40,006 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:29:40,006 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:29:40,021 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:29:40,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:29:40,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:29:40,022 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:29:40,022 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:29:40,022 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:29:40,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:29:40,022 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:29:40,022 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:29:40,022 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:29:40,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:29:40,023 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:29:40,023 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:29:40,023 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:29:40,023 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:29:40,023 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:29:40,023 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:29:40,023 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:29:40,023 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:29:40,023 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:29:40,024 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:29:40,024 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:29:40,024 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:29:40,024 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:29:40,024 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:29:40,024 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:29:40,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:29:40,024 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:29:40,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:29:40,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:29:40,024 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:29:40,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:29:40,024 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:29:40,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:29:40,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:29:40,024 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:29:40,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:29:40,025 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:29:40,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:29:40,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:29:40,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:29:40,025 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:29:40,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:29:40,025 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:29:40,025 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:29:40,025 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 -> 4af9e26294eb81d37b6ccb692d0b40e4bed5b0d6d3dd72d6af1a80634692c297 [2025-01-10 02:29:40,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:29:40,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:29:40,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:29:40,223 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:29:40,223 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:29:40,224 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Addition01-2.c [2025-01-10 02:29:41,327 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9073c8a2/573ec8ddaefa434387c3b3f17322e1a6/FLAGaff16e2a5 [2025-01-10 02:29:41,561 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:29:41,565 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive/Addition01-2.c [2025-01-10 02:29:41,570 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9073c8a2/573ec8ddaefa434387c3b3f17322e1a6/FLAGaff16e2a5 [2025-01-10 02:29:41,907 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9073c8a2/573ec8ddaefa434387c3b3f17322e1a6 [2025-01-10 02:29:41,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:29:41,911 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:29:41,913 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:29:41,913 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:29:41,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:29:41,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:29:41" (1/1) ... [2025-01-10 02:29:41,918 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79150c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:41, skipping insertion in model container [2025-01-10 02:29:41,918 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:29:41" (1/1) ... [2025-01-10 02:29:41,928 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:29:42,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:29:42,032 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:29:42,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:29:42,052 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:29:42,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:42 WrapperNode [2025-01-10 02:29:42,053 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:29:42,054 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:29:42,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:29:42,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:29:42,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:42" (1/1) ... [2025-01-10 02:29:42,064 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:42" (1/1) ... [2025-01-10 02:29:42,072 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 36 [2025-01-10 02:29:42,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:29:42,073 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:29:42,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:29:42,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:29:42,078 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:42" (1/1) ... [2025-01-10 02:29:42,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:42" (1/1) ... [2025-01-10 02:29:42,079 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:42" (1/1) ... [2025-01-10 02:29:42,085 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 02:29:42,086 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:42" (1/1) ... [2025-01-10 02:29:42,086 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:42" (1/1) ... [2025-01-10 02:29:42,087 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:42" (1/1) ... [2025-01-10 02:29:42,088 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:42" (1/1) ... [2025-01-10 02:29:42,089 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:42" (1/1) ... [2025-01-10 02:29:42,089 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:42" (1/1) ... [2025-01-10 02:29:42,090 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:42" (1/1) ... [2025-01-10 02:29:42,090 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:29:42,091 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:29:42,091 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:29:42,091 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:29:42,092 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:42" (1/1) ... [2025-01-10 02:29:42,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:29:42,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:42,119 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-01-10 02:29:42,126 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-01-10 02:29:42,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:29:42,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:29:42,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:29:42,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:29:42,141 INFO L130 BoogieDeclarations]: Found specification of procedure addition [2025-01-10 02:29:42,141 INFO L138 BoogieDeclarations]: Found implementation of procedure addition [2025-01-10 02:29:42,182 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:29:42,184 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:29:42,292 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-01-10 02:29:42,293 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:29:42,299 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:29:42,299 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 02:29:42,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:29:42 BoogieIcfgContainer [2025-01-10 02:29:42,300 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:29:42,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:29:42,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:29:42,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:29:42,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:29:41" (1/3) ... [2025-01-10 02:29:42,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485760d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:29:42, skipping insertion in model container [2025-01-10 02:29:42,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:42" (2/3) ... [2025-01-10 02:29:42,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485760d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:29:42, skipping insertion in model container [2025-01-10 02:29:42,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:29:42" (3/3) ... [2025-01-10 02:29:42,306 INFO L128 eAbstractionObserver]: Analyzing ICFG Addition01-2.c [2025-01-10 02:29:42,315 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:29:42,316 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Addition01-2.c that has 2 procedures, 42 locations, 1 initial locations, 0 loop locations, and 10 error locations. [2025-01-10 02:29:42,346 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:29:42,353 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;@799ce7f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:29:42,353 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-10 02:29:42,356 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:29:42,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 02:29:42,359 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:42,360 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:42,360 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:29:42,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:42,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1316235390, now seen corresponding path program 1 times [2025-01-10 02:29:42,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:42,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603605837] [2025-01-10 02:29:42,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:42,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:42,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 02:29:42,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 02:29:42,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:42,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:42,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:42,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:42,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603605837] [2025-01-10 02:29:42,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603605837] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:42,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:29:42,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:29:42,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927958876] [2025-01-10 02:29:42,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:42,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:29:42,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:42,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:29:42,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:29:42,521 INFO L87 Difference]: Start difference. First operand has 42 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:42,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:42,649 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2025-01-10 02:29:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:29:42,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 02:29:42,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:42,657 INFO L225 Difference]: With dead ends: 74 [2025-01-10 02:29:42,657 INFO L226 Difference]: Without dead ends: 62 [2025-01-10 02:29:42,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:29:42,662 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 46 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:42,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 122 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:42,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-10 02:29:42,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2025-01-10 02:29:42,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 46 states have internal predecessors, (58), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:29:42,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2025-01-10 02:29:42,695 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 9 [2025-01-10 02:29:42,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:42,695 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2025-01-10 02:29:42,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:42,695 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2025-01-10 02:29:42,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-10 02:29:42,696 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:42,696 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:42,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:29:42,696 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:29:42,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:42,697 INFO L85 PathProgramCache]: Analyzing trace with hash -2146375798, now seen corresponding path program 1 times [2025-01-10 02:29:42,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:42,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383515380] [2025-01-10 02:29:42,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:42,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:42,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 02:29:42,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 02:29:42,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:42,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:42,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:42,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:42,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383515380] [2025-01-10 02:29:42,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383515380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:42,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:29:42,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:29:42,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305634007] [2025-01-10 02:29:42,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:42,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:29:42,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:42,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:29:42,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:29:42,752 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:42,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:42,826 INFO L93 Difference]: Finished difference Result 102 states and 131 transitions. [2025-01-10 02:29:42,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:29:42,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-10 02:29:42,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:42,827 INFO L225 Difference]: With dead ends: 102 [2025-01-10 02:29:42,827 INFO L226 Difference]: Without dead ends: 100 [2025-01-10 02:29:42,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:29:42,828 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 43 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:42,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 106 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:42,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-10 02:29:42,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2025-01-10 02:29:42,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 76 states have internal predecessors, (104), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 02:29:42,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 122 transitions. [2025-01-10 02:29:42,842 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 122 transitions. Word has length 10 [2025-01-10 02:29:42,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:42,842 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 122 transitions. [2025-01-10 02:29:42,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:42,842 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 122 transitions. [2025-01-10 02:29:42,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 02:29:42,842 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:42,842 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:42,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:29:42,843 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:29:42,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:42,843 INFO L85 PathProgramCache]: Analyzing trace with hash -2113265089, now seen corresponding path program 1 times [2025-01-10 02:29:42,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:42,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601563003] [2025-01-10 02:29:42,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:42,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:42,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 02:29:42,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 02:29:42,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:42,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:42,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:42,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:42,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601563003] [2025-01-10 02:29:42,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601563003] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:42,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:29:42,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:29:42,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095825034] [2025-01-10 02:29:42,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:42,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:29:42,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:42,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:29:42,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:29:42,883 INFO L87 Difference]: Start difference. First operand 90 states and 122 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:29:42,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:42,909 INFO L93 Difference]: Finished difference Result 90 states and 122 transitions. [2025-01-10 02:29:42,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:29:42,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-01-10 02:29:42,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:42,911 INFO L225 Difference]: With dead ends: 90 [2025-01-10 02:29:42,911 INFO L226 Difference]: Without dead ends: 89 [2025-01-10 02:29:42,911 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-01-10 02:29:42,911 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:42,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 101 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:29:42,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-10 02:29:42,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-01-10 02:29:42,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.537313432835821) internal successors, (103), 75 states have internal predecessors, (103), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 02:29:42,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2025-01-10 02:29:42,929 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 11 [2025-01-10 02:29:42,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:42,930 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2025-01-10 02:29:42,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:29:42,930 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2025-01-10 02:29:42,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-10 02:29:42,931 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:42,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:42,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 02:29:42,932 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting additionErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:29:42,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:42,934 INFO L85 PathProgramCache]: Analyzing trace with hash -2113140224, now seen corresponding path program 1 times [2025-01-10 02:29:42,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:42,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423401306] [2025-01-10 02:29:42,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:42,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:42,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 02:29:42,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 02:29:42,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:42,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:42,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:42,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:42,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423401306] [2025-01-10 02:29:42,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423401306] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:42,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:29:42,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:29:42,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950323385] [2025-01-10 02:29:42,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:42,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:29:42,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:42,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:29:42,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:29:42,976 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:43,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:43,005 INFO L93 Difference]: Finished difference Result 97 states and 134 transitions. [2025-01-10 02:29:43,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:29:43,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-10 02:29:43,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:43,006 INFO L225 Difference]: With dead ends: 97 [2025-01-10 02:29:43,007 INFO L226 Difference]: Without dead ends: 96 [2025-01-10 02:29:43,007 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-01-10 02:29:43,007 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 59 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-01-10 02:29:43,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 59 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:29:43,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-10 02:29:43,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2025-01-10 02:29:43,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 74 states have internal predecessors, (99), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 02:29:43,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 117 transitions. [2025-01-10 02:29:43,016 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 117 transitions. Word has length 11 [2025-01-10 02:29:43,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:43,016 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 117 transitions. [2025-01-10 02:29:43,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:43,016 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 117 transitions. [2025-01-10 02:29:43,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 02:29:43,016 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:43,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:43,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 02:29:43,016 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:29:43,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:43,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1086708271, now seen corresponding path program 1 times [2025-01-10 02:29:43,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:43,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929666658] [2025-01-10 02:29:43,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:43,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:43,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 02:29:43,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 02:29:43,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:43,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:43,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:43,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:43,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929666658] [2025-01-10 02:29:43,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929666658] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:43,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:29:43,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:29:43,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813458974] [2025-01-10 02:29:43,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:43,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:29:43,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:43,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:29:43,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:29:43,070 INFO L87 Difference]: Start difference. First operand 88 states and 117 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:29:43,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:43,086 INFO L93 Difference]: Finished difference Result 88 states and 117 transitions. [2025-01-10 02:29:43,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:29:43,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-01-10 02:29:43,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:43,087 INFO L225 Difference]: With dead ends: 88 [2025-01-10 02:29:43,087 INFO L226 Difference]: Without dead ends: 68 [2025-01-10 02:29:43,087 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-01-10 02:29:43,087 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:43,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 98 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:29:43,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-01-10 02:29:43,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2025-01-10 02:29:43,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 49 states have internal predecessors, (59), 5 states have call successors, (5), 4 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:43,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2025-01-10 02:29:43,095 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 12 [2025-01-10 02:29:43,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:43,095 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2025-01-10 02:29:43,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:29:43,095 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2025-01-10 02:29:43,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 02:29:43,095 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:43,095 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:43,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 02:29:43,096 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting additionErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:29:43,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:43,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1072309289, now seen corresponding path program 1 times [2025-01-10 02:29:43,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:43,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550503685] [2025-01-10 02:29:43,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:43,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:43,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 02:29:43,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 02:29:43,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:43,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:43,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:43,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:43,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550503685] [2025-01-10 02:29:43,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550503685] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:43,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:29:43,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:29:43,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319348122] [2025-01-10 02:29:43,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:43,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:29:43,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:43,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:29:43,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:29:43,176 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 5 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:43,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:43,240 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2025-01-10 02:29:43,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:29:43,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-10 02:29:43,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:43,241 INFO L225 Difference]: With dead ends: 79 [2025-01-10 02:29:43,241 INFO L226 Difference]: Without dead ends: 45 [2025-01-10 02:29:43,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:29:43,241 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 20 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:43,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 66 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:29:43,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-10 02:29:43,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2025-01-10 02:29:43,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 37 states have internal predecessors, (41), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:43,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2025-01-10 02:29:43,252 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 12 [2025-01-10 02:29:43,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:43,252 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2025-01-10 02:29:43,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:43,252 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2025-01-10 02:29:43,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 02:29:43,252 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:43,252 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:43,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 02:29:43,253 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting additionErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:29:43,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:43,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1082837428, now seen corresponding path program 1 times [2025-01-10 02:29:43,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:43,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083207592] [2025-01-10 02:29:43,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:43,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:43,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 02:29:43,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 02:29:43,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:43,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:43,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:43,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:43,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083207592] [2025-01-10 02:29:43,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083207592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:43,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:29:43,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:29:43,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881043937] [2025-01-10 02:29:43,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:43,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:29:43,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:43,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:29:43,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:29:43,286 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 5 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:43,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:43,322 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2025-01-10 02:29:43,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:29:43,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-10 02:29:43,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:43,323 INFO L225 Difference]: With dead ends: 49 [2025-01-10 02:29:43,323 INFO L226 Difference]: Without dead ends: 47 [2025-01-10 02:29:43,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:29:43,323 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 32 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:43,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 54 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:29:43,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-01-10 02:29:43,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2025-01-10 02:29:43,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 30 states have (on average 1.3) internal successors, (39), 36 states have internal predecessors, (39), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:43,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2025-01-10 02:29:43,327 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 12 [2025-01-10 02:29:43,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:43,327 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2025-01-10 02:29:43,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:43,327 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2025-01-10 02:29:43,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 02:29:43,327 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:43,327 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:43,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 02:29:43,328 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:29:43,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:43,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2121363603, now seen corresponding path program 1 times [2025-01-10 02:29:43,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:43,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237031407] [2025-01-10 02:29:43,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:43,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:43,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 02:29:43,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 02:29:43,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:43,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:43,378 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:43,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:43,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237031407] [2025-01-10 02:29:43,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237031407] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:43,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955232714] [2025-01-10 02:29:43,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:43,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:43,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:43,381 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-01-10 02:29:43,383 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-01-10 02:29:43,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 02:29:43,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 02:29:43,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:43,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:43,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 02:29:43,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:43,446 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:43,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:43,496 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:43,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955232714] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:43,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:43,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-01-10 02:29:43,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490596800] [2025-01-10 02:29:43,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:43,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 02:29:43,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:43,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 02:29:43,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:29:43,498 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:43,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:43,614 INFO L93 Difference]: Finished difference Result 147 states and 166 transitions. [2025-01-10 02:29:43,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 02:29:43,615 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-10 02:29:43,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:43,616 INFO L225 Difference]: With dead ends: 147 [2025-01-10 02:29:43,619 INFO L226 Difference]: Without dead ends: 145 [2025-01-10 02:29:43,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-01-10 02:29:43,620 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 170 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:43,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 163 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:43,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-01-10 02:29:43,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 109. [2025-01-10 02:29:43,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 98 states have internal predecessors, (118), 12 states have call successors, (12), 10 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:43,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 130 transitions. [2025-01-10 02:29:43,641 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 130 transitions. Word has length 18 [2025-01-10 02:29:43,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:43,641 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 130 transitions. [2025-01-10 02:29:43,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 8 states have internal predecessors, (30), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:43,641 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 130 transitions. [2025-01-10 02:29:43,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-10 02:29:43,642 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:43,642 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:43,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 02:29:43,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:43,843 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting additionErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:29:43,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:43,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1489573626, now seen corresponding path program 1 times [2025-01-10 02:29:43,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:43,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439487617] [2025-01-10 02:29:43,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:43,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:43,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 02:29:43,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 02:29:43,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:43,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:43,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:43,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:43,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439487617] [2025-01-10 02:29:43,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439487617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:43,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:29:43,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:29:43,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301158464] [2025-01-10 02:29:43,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:43,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:29:43,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:43,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:29:43,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:29:43,890 INFO L87 Difference]: Start difference. First operand 109 states and 130 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:43,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:43,924 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2025-01-10 02:29:43,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:29:43,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-10 02:29:43,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:43,924 INFO L225 Difference]: With dead ends: 110 [2025-01-10 02:29:43,925 INFO L226 Difference]: Without dead ends: 43 [2025-01-10 02:29:43,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:29:43,925 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:43,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 29 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:29:43,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-01-10 02:29:43,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-01-10 02:29:43,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:43,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2025-01-10 02:29:43,929 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 20 [2025-01-10 02:29:43,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:43,929 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2025-01-10 02:29:43,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:43,929 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2025-01-10 02:29:43,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-10 02:29:43,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:43,930 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:43,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 02:29:43,930 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:29:43,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:43,930 INFO L85 PathProgramCache]: Analyzing trace with hash -459270890, now seen corresponding path program 2 times [2025-01-10 02:29:43,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:43,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442143738] [2025-01-10 02:29:43,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:29:43,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:43,935 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-10 02:29:43,941 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 02:29:43,942 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:29:43,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:44,153 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:44,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:44,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442143738] [2025-01-10 02:29:44,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442143738] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:44,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527763805] [2025-01-10 02:29:44,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:29:44,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:44,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:44,156 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-01-10 02:29:44,160 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-01-10 02:29:44,189 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-10 02:29:44,202 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 02:29:44,202 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:29:44,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:44,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 02:29:44,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:44,253 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:44,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:44,432 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:44,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527763805] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:44,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:44,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-01-10 02:29:44,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797031587] [2025-01-10 02:29:44,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:44,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 02:29:44,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:44,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 02:29:44,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2025-01-10 02:29:44,434 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 14 states have internal predecessors, (72), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:44,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:44,596 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2025-01-10 02:29:44,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 02:29:44,596 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 14 states have internal predecessors, (72), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-01-10 02:29:44,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:44,598 INFO L225 Difference]: With dead ends: 95 [2025-01-10 02:29:44,598 INFO L226 Difference]: Without dead ends: 94 [2025-01-10 02:29:44,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=311, Invalid=811, Unknown=0, NotChecked=0, Total=1122 [2025-01-10 02:29:44,599 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 127 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:44,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 138 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:44,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-10 02:29:44,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2025-01-10 02:29:44,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.0126582278481013) internal successors, (80), 79 states have internal predecessors, (80), 11 states have call successors, (11), 11 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:44,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2025-01-10 02:29:44,609 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 42 [2025-01-10 02:29:44,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:44,611 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2025-01-10 02:29:44,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 14 states have internal predecessors, (72), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:44,611 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2025-01-10 02:29:44,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-10 02:29:44,612 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:44,613 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:44,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 02:29:44,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:44,817 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:29:44,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:44,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1937793176, now seen corresponding path program 3 times [2025-01-10 02:29:44,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:44,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250701074] [2025-01-10 02:29:44,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:29:44,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:44,831 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 90 statements into 11 equivalence classes. [2025-01-10 02:29:44,876 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 90 of 90 statements. [2025-01-10 02:29:44,876 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 02:29:44,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:45,390 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:45,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:45,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250701074] [2025-01-10 02:29:45,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250701074] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:45,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533131654] [2025-01-10 02:29:45,390 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:29:45,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:45,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:45,394 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-01-10 02:29:45,395 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-01-10 02:29:45,422 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 90 statements into 11 equivalence classes. [2025-01-10 02:29:45,446 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 90 of 90 statements. [2025-01-10 02:29:45,446 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-10 02:29:45,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:45,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 02:29:45,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:45,554 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:45,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:46,081 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:46,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533131654] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:46,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:46,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-01-10 02:29:46,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180968638] [2025-01-10 02:29:46,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:46,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-01-10 02:29:46,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:46,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-10 02:29:46,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1700, Unknown=0, NotChecked=0, Total=2256 [2025-01-10 02:29:46,088 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand has 48 states, 47 states have (on average 3.3191489361702127) internal successors, (156), 26 states have internal predecessors, (156), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:46,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:46,553 INFO L93 Difference]: Finished difference Result 191 states and 202 transitions. [2025-01-10 02:29:46,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-01-10 02:29:46,553 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 3.3191489361702127) internal successors, (156), 26 states have internal predecessors, (156), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-01-10 02:29:46,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:46,555 INFO L225 Difference]: With dead ends: 191 [2025-01-10 02:29:46,555 INFO L226 Difference]: Without dead ends: 190 [2025-01-10 02:29:46,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1337, Invalid=3493, Unknown=0, NotChecked=0, Total=4830 [2025-01-10 02:29:46,557 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 414 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:46,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 234 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:46,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-01-10 02:29:46,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2025-01-10 02:29:46,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 163 states have (on average 1.0061349693251533) internal successors, (164), 163 states have internal predecessors, (164), 23 states have call successors, (23), 23 states have call predecessors, (23), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:46,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2025-01-10 02:29:46,568 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 90 [2025-01-10 02:29:46,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:46,569 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2025-01-10 02:29:46,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 3.3191489361702127) internal successors, (156), 26 states have internal predecessors, (156), 22 states have call successors, (22), 22 states have call predecessors, (22), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:46,569 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2025-01-10 02:29:46,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-10 02:29:46,570 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:46,570 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:46,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 02:29:46,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:46,771 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:29:46,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:46,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1611444236, now seen corresponding path program 4 times [2025-01-10 02:29:46,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:46,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432653760] [2025-01-10 02:29:46,776 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 02:29:46,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:46,794 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 186 statements into 2 equivalence classes. [2025-01-10 02:29:46,844 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 186 of 186 statements. [2025-01-10 02:29:46,844 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 02:29:46,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:48,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 0 proven. 1958 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:48,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:48,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432653760] [2025-01-10 02:29:48,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432653760] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:48,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254593580] [2025-01-10 02:29:48,135 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 02:29:48,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:48,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:48,139 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-01-10 02:29:48,141 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-01-10 02:29:48,164 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 186 statements into 2 equivalence classes. [2025-01-10 02:29:48,203 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 186 of 186 statements. [2025-01-10 02:29:48,203 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 02:29:48,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:48,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-10 02:29:48,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:48,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 0 proven. 1958 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:48,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:50,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 0 proven. 1958 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:50,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254593580] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:50,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:50,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-01-10 02:29:50,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085487826] [2025-01-10 02:29:50,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:50,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-01-10 02:29:50,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:50,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-01-10 02:29:50,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2260, Invalid=6860, Unknown=0, NotChecked=0, Total=9120 [2025-01-10 02:29:50,066 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand has 96 states, 95 states have (on average 3.4105263157894736) internal successors, (324), 50 states have internal predecessors, (324), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:51,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:51,640 INFO L93 Difference]: Finished difference Result 383 states and 406 transitions. [2025-01-10 02:29:51,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-01-10 02:29:51,642 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 3.4105263157894736) internal successors, (324), 50 states have internal predecessors, (324), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 186 [2025-01-10 02:29:51,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:51,644 INFO L225 Difference]: With dead ends: 383 [2025-01-10 02:29:51,644 INFO L226 Difference]: Without dead ends: 382 [2025-01-10 02:29:51,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5549, Invalid=14473, Unknown=0, NotChecked=0, Total=20022 [2025-01-10 02:29:51,649 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 1177 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:51,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1177 Valid, 438 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:29:51,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-01-10 02:29:51,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 379. [2025-01-10 02:29:51,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 331 states have (on average 1.0030211480362539) internal successors, (332), 331 states have internal predecessors, (332), 47 states have call successors, (47), 47 states have call predecessors, (47), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:51,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 379 transitions. [2025-01-10 02:29:51,663 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 379 transitions. Word has length 186 [2025-01-10 02:29:51,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:51,664 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 379 transitions. [2025-01-10 02:29:51,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 3.4105263157894736) internal successors, (324), 50 states have internal predecessors, (324), 46 states have call successors, (46), 46 states have call predecessors, (46), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:29:51,664 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 379 transitions. [2025-01-10 02:29:51,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-01-10 02:29:51,672 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:51,672 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:51,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 02:29:51,873 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,SelfDestructingSolverStorable11 [2025-01-10 02:29:51,873 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:29:51,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:51,874 INFO L85 PathProgramCache]: Analyzing trace with hash 624869716, now seen corresponding path program 5 times [2025-01-10 02:29:51,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:51,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060731703] [2025-01-10 02:29:51,874 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 02:29:51,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:51,888 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 378 statements into 47 equivalence classes. [2025-01-10 02:29:52,000 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 378 of 378 statements. [2025-01-10 02:29:52,000 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-10 02:29:52,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:55,966 INFO L134 CoverageAnalysis]: Checked inductivity of 8510 backedges. 0 proven. 8510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:55,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:55,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060731703] [2025-01-10 02:29:55,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060731703] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:55,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593907141] [2025-01-10 02:29:55,967 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 02:29:55,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:55,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:55,972 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-01-10 02:29:55,973 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-01-10 02:29:56,008 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 378 statements into 47 equivalence classes. [2025-01-10 02:29:56,118 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 378 of 378 statements. [2025-01-10 02:29:56,118 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-10 02:29:56,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:56,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-01-10 02:29:56,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:56,479 INFO L134 CoverageAnalysis]: Checked inductivity of 8510 backedges. 0 proven. 8510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:29:56,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:30:01,932 INFO L134 CoverageAnalysis]: Checked inductivity of 8510 backedges. 0 proven. 8510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:30:01,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593907141] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:30:01,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:30:01,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2025-01-10 02:30:01,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279790156] [2025-01-10 02:30:01,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:30:01,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-01-10 02:30:01,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:01,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-01-10 02:30:01,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9124, Invalid=27548, Unknown=0, NotChecked=0, Total=36672 [2025-01-10 02:30:01,943 INFO L87 Difference]: Start difference. First operand 379 states and 379 transitions. Second operand has 192 states, 191 states have (on average 3.4554973821989527) internal successors, (660), 98 states have internal predecessors, (660), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:08,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:08,346 INFO L93 Difference]: Finished difference Result 767 states and 814 transitions. [2025-01-10 02:30:08,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-01-10 02:30:08,347 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 191 states have (on average 3.4554973821989527) internal successors, (660), 98 states have internal predecessors, (660), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 378 [2025-01-10 02:30:08,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:08,350 INFO L225 Difference]: With dead ends: 767 [2025-01-10 02:30:08,351 INFO L226 Difference]: Without dead ends: 766 [2025-01-10 02:30:08,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 944 GetRequests, 660 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17484 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=22613, Invalid=58897, Unknown=0, NotChecked=0, Total=81510 [2025-01-10 02:30:08,358 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 2927 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2927 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:08,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2927 Valid, 822 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 02:30:08,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2025-01-10 02:30:08,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 763. [2025-01-10 02:30:08,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 667 states have (on average 1.0014992503748126) internal successors, (668), 667 states have internal predecessors, (668), 95 states have call successors, (95), 95 states have call predecessors, (95), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:08,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 763 transitions. [2025-01-10 02:30:08,389 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 763 transitions. Word has length 378 [2025-01-10 02:30:08,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:08,390 INFO L471 AbstractCegarLoop]: Abstraction has 763 states and 763 transitions. [2025-01-10 02:30:08,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 191 states have (on average 3.4554973821989527) internal successors, (660), 98 states have internal predecessors, (660), 94 states have call successors, (94), 94 states have call predecessors, (94), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:08,390 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 763 transitions. [2025-01-10 02:30:08,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 763 [2025-01-10 02:30:08,403 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:08,404 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 95, 94, 94, 94, 94, 1, 1, 1, 1, 1, 1] [2025-01-10 02:30:08,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 02:30:08,608 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,SelfDestructingSolverStorable12 [2025-01-10 02:30:08,609 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-01-10 02:30:08,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:08,610 INFO L85 PathProgramCache]: Analyzing trace with hash 520266724, now seen corresponding path program 6 times [2025-01-10 02:30:08,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:08,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545046266] [2025-01-10 02:30:08,610 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 02:30:08,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:08,631 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 762 statements into 95 equivalence classes. [2025-01-10 02:30:08,794 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 762 of 762 statements. [2025-01-10 02:30:08,795 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-01-10 02:30:08,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:25,261 INFO L134 CoverageAnalysis]: Checked inductivity of 35438 backedges. 0 proven. 35438 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:30:25,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:25,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545046266] [2025-01-10 02:30:25,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545046266] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:25,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89392355] [2025-01-10 02:30:25,262 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 02:30:25,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:25,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:25,264 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-01-10 02:30:25,265 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-01-10 02:30:25,319 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 762 statements into 95 equivalence classes. [2025-01-10 02:30:25,636 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 762 of 762 statements. [2025-01-10 02:30:25,636 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-01-10 02:30:25,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:25,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 1547 conjuncts, 192 conjuncts are in the unsatisfiable core [2025-01-10 02:30:25,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:26,314 INFO L134 CoverageAnalysis]: Checked inductivity of 35438 backedges. 0 proven. 35438 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:30:26,314 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:30:47,327 INFO L134 CoverageAnalysis]: Checked inductivity of 35438 backedges. 0 proven. 35438 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:30:47,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89392355] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:30:47,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:30:47,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [192, 192, 192] total 383 [2025-01-10 02:30:47,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594879209] [2025-01-10 02:30:47,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:30:47,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 384 states [2025-01-10 02:30:47,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:47,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 384 interpolants. [2025-01-10 02:30:47,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36676, Invalid=110396, Unknown=0, NotChecked=0, Total=147072 [2025-01-10 02:30:47,340 INFO L87 Difference]: Start difference. First operand 763 states and 763 transitions. Second operand has 384 states, 383 states have (on average 3.4778067885117494) internal successors, (1332), 194 states have internal predecessors, (1332), 190 states have call successors, (190), 190 states have call predecessors, (190), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)