./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 c00e63dc 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-?-c00e63d-m [2025-02-06 14:29:01,816 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 14:29:01,860 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 14:29:01,863 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 14:29:01,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 14:29:01,877 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 14:29:01,877 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 14:29:01,877 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 14:29:01,877 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 14:29:01,877 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 14:29:01,877 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 14:29:01,877 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 14:29:01,878 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 14:29:01,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 14:29:01,878 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 14:29:01,878 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 14:29:01,878 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 14:29:01,878 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 14:29:01,878 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 14:29:01,878 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 14:29:01,878 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 14:29:01,878 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 14:29:01,878 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 14:29:01,878 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 14:29:01,878 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 14:29:01,878 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 14:29:01,878 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 14:29:01,878 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 14:29:01,878 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 14:29:01,879 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 14:29:01,879 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 14:29:01,879 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 14:29:01,879 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 14:29:01,879 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 14:29:01,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:29:01,879 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 14:29:01,879 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 14:29:01,879 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 14:29:01,879 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 14:29:01,879 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 14:29:01,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 14:29:01,879 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 14:29:01,879 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 14:29:01,879 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 14:29:01,879 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 14:29:01,879 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-02-06 14:29:02,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 14:29:02,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 14:29:02,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 14:29:02,167 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 14:29:02,167 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 14:29:02,168 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-02-06 14:29:03,354 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61572d33b/29f4d8e7c5c64a80a57566b7ac97bd3f/FLAGde998efc9 [2025-02-06 14:29:03,574 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 14:29:03,574 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive/Addition01-2.c [2025-02-06 14:29:03,594 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61572d33b/29f4d8e7c5c64a80a57566b7ac97bd3f/FLAGde998efc9 [2025-02-06 14:29:03,610 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/61572d33b/29f4d8e7c5c64a80a57566b7ac97bd3f [2025-02-06 14:29:03,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 14:29:03,614 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 14:29:03,619 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 14:29:03,619 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 14:29:03,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 14:29:03,625 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:29:03" (1/1) ... [2025-02-06 14:29:03,627 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38784a1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:29:03, skipping insertion in model container [2025-02-06 14:29:03,627 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:29:03" (1/1) ... [2025-02-06 14:29:03,650 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 14:29:03,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:29:03,841 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 14:29:03,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:29:03,863 INFO L204 MainTranslator]: Completed translation [2025-02-06 14:29:03,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:29:03 WrapperNode [2025-02-06 14:29:03,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 14:29:03,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 14:29:03,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 14:29:03,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 14:29:03,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:29:03" (1/1) ... [2025-02-06 14:29:03,874 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:29:03" (1/1) ... [2025-02-06 14:29:03,883 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 36 [2025-02-06 14:29:03,884 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 14:29:03,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 14:29:03,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 14:29:03,885 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 14:29:03,890 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:29:03" (1/1) ... [2025-02-06 14:29:03,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:29:03" (1/1) ... [2025-02-06 14:29:03,893 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:29:03" (1/1) ... [2025-02-06 14:29:03,905 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-02-06 14:29:03,907 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:29:03" (1/1) ... [2025-02-06 14:29:03,907 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:29:03" (1/1) ... [2025-02-06 14:29:03,909 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:29:03" (1/1) ... [2025-02-06 14:29:03,910 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:29:03" (1/1) ... [2025-02-06 14:29:03,910 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:29:03" (1/1) ... [2025-02-06 14:29:03,911 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:29:03" (1/1) ... [2025-02-06 14:29:03,912 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 14:29:03,913 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 14:29:03,913 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 14:29:03,913 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 14:29:03,914 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:29:03" (1/1) ... [2025-02-06 14:29:03,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:29:03,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:29:03,947 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 14:29:03,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 14:29:03,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 14:29:03,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 14:29:03,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 14:29:03,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 14:29:03,966 INFO L130 BoogieDeclarations]: Found specification of procedure addition [2025-02-06 14:29:03,967 INFO L138 BoogieDeclarations]: Found implementation of procedure addition [2025-02-06 14:29:04,006 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 14:29:04,007 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 14:29:04,108 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L23: havoc #t~ret5; [2025-02-06 14:29:04,109 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L20: havoc #t~ret4; [2025-02-06 14:29:04,115 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-02-06 14:29:04,115 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 14:29:04,121 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 14:29:04,121 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 14:29:04,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:29:04 BoogieIcfgContainer [2025-02-06 14:29:04,121 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 14:29:04,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 14:29:04,123 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 14:29:04,125 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 14:29:04,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:29:03" (1/3) ... [2025-02-06 14:29:04,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29767a10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:29:04, skipping insertion in model container [2025-02-06 14:29:04,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:29:03" (2/3) ... [2025-02-06 14:29:04,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29767a10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:29:04, skipping insertion in model container [2025-02-06 14:29:04,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:29:04" (3/3) ... [2025-02-06 14:29:04,127 INFO L128 eAbstractionObserver]: Analyzing ICFG Addition01-2.c [2025-02-06 14:29:04,137 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 14:29:04,139 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-02-06 14:29:04,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 14:29:04,187 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;@1ac5a492, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 14:29:04,188 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-06 14:29:04,191 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-02-06 14:29:04,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 14:29:04,194 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:29:04,195 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:29:04,195 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting additionErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 14:29:04,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:29:04,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1132141144, now seen corresponding path program 1 times [2025-02-06 14:29:04,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:29:04,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630899532] [2025-02-06 14:29:04,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:29:04,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:29:04,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 14:29:04,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 14:29:04,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:29:04,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:04,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:29:04,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:29:04,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630899532] [2025-02-06 14:29:04,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630899532] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:29:04,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:29:04,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:29:04,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548884258] [2025-02-06 14:29:04,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:29:04,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:29:04,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:29:04,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:29:04,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:29:04,346 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-02-06 14:29:04,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:29:04,431 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2025-02-06 14:29:04,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:29:04,432 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-02-06 14:29:04,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:29:04,436 INFO L225 Difference]: With dead ends: 74 [2025-02-06 14:29:04,436 INFO L226 Difference]: Without dead ends: 62 [2025-02-06 14:29:04,438 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-02-06 14:29:04,440 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 46 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-02-06 14:29:04,440 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-02-06 14:29:04,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-06 14:29:04,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2025-02-06 14:29:04,466 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-02-06 14:29:04,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2025-02-06 14:29:04,469 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 9 [2025-02-06 14:29:04,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:29:04,469 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2025-02-06 14:29:04,470 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-02-06 14:29:04,470 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2025-02-06 14:29:04,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 14:29:04,470 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:29:04,470 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:29:04,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 14:29:04,471 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting additionErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 14:29:04,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:29:04,471 INFO L85 PathProgramCache]: Analyzing trace with hash 736637109, now seen corresponding path program 1 times [2025-02-06 14:29:04,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:29:04,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250956921] [2025-02-06 14:29:04,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:29:04,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:29:04,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 14:29:04,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 14:29:04,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:29:04,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:04,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:29:04,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:29:04,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250956921] [2025-02-06 14:29:04,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250956921] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:29:04,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:29:04,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:29:04,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760005683] [2025-02-06 14:29:04,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:29:04,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:29:04,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:29:04,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:29:04,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:29:04,542 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-02-06 14:29:04,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:29:04,602 INFO L93 Difference]: Finished difference Result 102 states and 131 transitions. [2025-02-06 14:29:04,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:29:04,602 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-02-06 14:29:04,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:29:04,603 INFO L225 Difference]: With dead ends: 102 [2025-02-06 14:29:04,603 INFO L226 Difference]: Without dead ends: 100 [2025-02-06 14:29:04,604 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-02-06 14:29:04,604 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.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:29:04,604 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.0s Time] [2025-02-06 14:29:04,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-06 14:29:04,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2025-02-06 14:29:04,611 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-02-06 14:29:04,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 122 transitions. [2025-02-06 14:29:04,613 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 122 transitions. Word has length 10 [2025-02-06 14:29:04,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:29:04,613 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 122 transitions. [2025-02-06 14:29:04,613 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-02-06 14:29:04,613 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 122 transitions. [2025-02-06 14:29:04,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 14:29:04,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:29:04,613 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:29:04,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 14:29:04,614 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 14:29:04,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:29:04,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1360146937, now seen corresponding path program 1 times [2025-02-06 14:29:04,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:29:04,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403130167] [2025-02-06 14:29:04,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:29:04,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:29:04,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 14:29:04,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 14:29:04,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:29:04,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:04,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:29:04,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:29:04,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403130167] [2025-02-06 14:29:04,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403130167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:29:04,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:29:04,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:29:04,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124572283] [2025-02-06 14:29:04,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:29:04,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:29:04,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:29:04,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:29:04,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:29:04,656 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-02-06 14:29:04,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:29:04,672 INFO L93 Difference]: Finished difference Result 90 states and 122 transitions. [2025-02-06 14:29:04,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:29:04,672 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-02-06 14:29:04,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:29:04,673 INFO L225 Difference]: With dead ends: 90 [2025-02-06 14:29:04,673 INFO L226 Difference]: Without dead ends: 89 [2025-02-06 14:29:04,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:29:04,674 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-02-06 14:29:04,674 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-02-06 14:29:04,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-06 14:29:04,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-02-06 14:29:04,679 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-02-06 14:29:04,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2025-02-06 14:29:04,681 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 11 [2025-02-06 14:29:04,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:29:04,681 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2025-02-06 14:29:04,681 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-02-06 14:29:04,681 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2025-02-06 14:29:04,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 14:29:04,682 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:29:04,682 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:29:04,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 14:29:04,682 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting additionErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 14:29:04,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:29:04,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1360913910, now seen corresponding path program 1 times [2025-02-06 14:29:04,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:29:04,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117369940] [2025-02-06 14:29:04,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:29:04,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:29:04,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 14:29:04,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 14:29:04,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:29:04,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:04,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:29:04,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:29:04,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117369940] [2025-02-06 14:29:04,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117369940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:29:04,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:29:04,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:29:04,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043621333] [2025-02-06 14:29:04,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:29:04,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:29:04,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:29:04,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:29:04,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:29:04,707 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-02-06 14:29:04,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:29:04,724 INFO L93 Difference]: Finished difference Result 97 states and 134 transitions. [2025-02-06 14:29:04,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:29:04,724 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-02-06 14:29:04,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:29:04,725 INFO L225 Difference]: With dead ends: 97 [2025-02-06 14:29:04,725 INFO L226 Difference]: Without dead ends: 96 [2025-02-06 14:29:04,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:29:04,726 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-02-06 14:29:04,726 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-02-06 14:29:04,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-06 14:29:04,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2025-02-06 14:29:04,733 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-02-06 14:29:04,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 117 transitions. [2025-02-06 14:29:04,734 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 117 transitions. Word has length 11 [2025-02-06 14:29:04,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:29:04,734 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 117 transitions. [2025-02-06 14:29:04,734 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-02-06 14:29:04,734 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 117 transitions. [2025-02-06 14:29:04,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 14:29:04,734 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:29:04,734 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:29:04,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 14:29:04,735 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 14:29:04,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:29:04,735 INFO L85 PathProgramCache]: Analyzing trace with hash -785117937, now seen corresponding path program 1 times [2025-02-06 14:29:04,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:29:04,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863225172] [2025-02-06 14:29:04,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:29:04,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:29:04,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 14:29:04,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 14:29:04,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:29:04,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:04,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:29:04,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:29:04,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863225172] [2025-02-06 14:29:04,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863225172] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:29:04,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:29:04,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:29:04,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649268351] [2025-02-06 14:29:04,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:29:04,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:29:04,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:29:04,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:29:04,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:29:04,773 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-02-06 14:29:04,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:29:04,787 INFO L93 Difference]: Finished difference Result 88 states and 117 transitions. [2025-02-06 14:29:04,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:29:04,788 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-02-06 14:29:04,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:29:04,788 INFO L225 Difference]: With dead ends: 88 [2025-02-06 14:29:04,788 INFO L226 Difference]: Without dead ends: 68 [2025-02-06 14:29:04,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:29:04,789 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-02-06 14:29:04,789 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-02-06 14:29:04,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-06 14:29:04,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2025-02-06 14:29:04,793 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-02-06 14:29:04,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2025-02-06 14:29:04,794 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 12 [2025-02-06 14:29:04,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:29:04,794 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2025-02-06 14:29:04,794 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-02-06 14:29:04,794 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2025-02-06 14:29:04,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 14:29:04,794 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:29:04,794 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:29:04,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 14:29:04,795 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 14:29:04,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:29:04,795 INFO L85 PathProgramCache]: Analyzing trace with hash -760756844, now seen corresponding path program 1 times [2025-02-06 14:29:04,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:29:04,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496174308] [2025-02-06 14:29:04,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:29:04,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:29:04,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 14:29:04,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 14:29:04,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:29:04,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:04,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:29:04,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:29:04,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496174308] [2025-02-06 14:29:04,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496174308] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:29:04,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:29:04,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:29:04,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816777755] [2025-02-06 14:29:04,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:29:04,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:29:04,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:29:04,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:29:04,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:29:04,831 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-02-06 14:29:04,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:29:04,863 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2025-02-06 14:29:04,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:29:04,863 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-02-06 14:29:04,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:29:04,864 INFO L225 Difference]: With dead ends: 79 [2025-02-06 14:29:04,864 INFO L226 Difference]: Without dead ends: 45 [2025-02-06 14:29:04,864 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-02-06 14:29:04,865 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-02-06 14:29:04,865 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-02-06 14:29:04,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-06 14:29:04,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2025-02-06 14:29:04,867 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-02-06 14:29:04,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2025-02-06 14:29:04,868 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 12 [2025-02-06 14:29:04,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:29:04,868 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2025-02-06 14:29:04,868 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-02-06 14:29:04,868 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2025-02-06 14:29:04,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 14:29:04,868 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:29:04,868 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:29:04,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 14:29:04,869 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting additionErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 14:29:04,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:29:04,869 INFO L85 PathProgramCache]: Analyzing trace with hash -761341741, now seen corresponding path program 1 times [2025-02-06 14:29:04,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:29:04,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856482764] [2025-02-06 14:29:04,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:29:04,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:29:04,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 14:29:04,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 14:29:04,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:29:04,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:04,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:29:04,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:29:04,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856482764] [2025-02-06 14:29:04,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856482764] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:29:04,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:29:04,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:29:04,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003547754] [2025-02-06 14:29:04,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:29:04,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:29:04,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:29:04,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:29:04,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:29:04,925 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-02-06 14:29:04,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:29:04,960 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2025-02-06 14:29:04,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:29:04,960 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-02-06 14:29:04,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:29:04,961 INFO L225 Difference]: With dead ends: 49 [2025-02-06 14:29:04,961 INFO L226 Difference]: Without dead ends: 47 [2025-02-06 14:29:04,961 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-02-06 14:29:04,962 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-02-06 14:29:04,962 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-02-06 14:29:04,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-06 14:29:04,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2025-02-06 14:29:04,965 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-02-06 14:29:04,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2025-02-06 14:29:04,965 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 12 [2025-02-06 14:29:04,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:29:04,965 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2025-02-06 14:29:04,965 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-02-06 14:29:04,965 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2025-02-06 14:29:04,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 14:29:04,966 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:29:04,966 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:29:04,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 14:29:04,966 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting additionErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 14:29:04,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:29:04,967 INFO L85 PathProgramCache]: Analyzing trace with hash -282866168, now seen corresponding path program 1 times [2025-02-06 14:29:04,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:29:04,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942989213] [2025-02-06 14:29:04,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:29:04,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:29:04,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 14:29:04,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 14:29:04,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:29:04,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:05,020 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:29:05,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:29:05,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942989213] [2025-02-06 14:29:05,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942989213] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:29:05,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858294282] [2025-02-06 14:29:05,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:29:05,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:29:05,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:29:05,023 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:29:05,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 14:29:05,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 14:29:05,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 14:29:05,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:29:05,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:05,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 14:29:05,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:29:05,103 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:29:05,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:29:05,155 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:29:05,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858294282] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:29:05,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:29:05,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-02-06 14:29:05,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133717920] [2025-02-06 14:29:05,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:29:05,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 14:29:05,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:29:05,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 14:29:05,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-06 14:29:05,157 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-02-06 14:29:05,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:29:05,256 INFO L93 Difference]: Finished difference Result 147 states and 166 transitions. [2025-02-06 14:29:05,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 14:29:05,256 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-02-06 14:29:05,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:29:05,257 INFO L225 Difference]: With dead ends: 147 [2025-02-06 14:29:05,257 INFO L226 Difference]: Without dead ends: 145 [2025-02-06 14:29:05,257 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-02-06 14:29:05,258 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 170 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-02-06 14:29:05,258 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-02-06 14:29:05,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-06 14:29:05,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 109. [2025-02-06 14:29:05,265 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-02-06 14:29:05,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 130 transitions. [2025-02-06 14:29:05,266 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 130 transitions. Word has length 18 [2025-02-06 14:29:05,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:29:05,266 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 130 transitions. [2025-02-06 14:29:05,266 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-02-06 14:29:05,266 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 130 transitions. [2025-02-06 14:29:05,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 14:29:05,267 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:29:05,267 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:29:05,273 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-02-06 14:29:05,471 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-02-06 14:29:05,471 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting additionErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 14:29:05,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:29:05,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1250862553, now seen corresponding path program 1 times [2025-02-06 14:29:05,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:29:05,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68026025] [2025-02-06 14:29:05,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:29:05,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:29:05,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 14:29:05,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 14:29:05,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:29:05,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:05,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:29:05,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:29:05,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68026025] [2025-02-06 14:29:05,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68026025] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:29:05,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:29:05,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:29:05,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756063508] [2025-02-06 14:29:05,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:29:05,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:29:05,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:29:05,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:29:05,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:29:05,515 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-02-06 14:29:05,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:29:05,536 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2025-02-06 14:29:05,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:29:05,537 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-02-06 14:29:05,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:29:05,537 INFO L225 Difference]: With dead ends: 110 [2025-02-06 14:29:05,537 INFO L226 Difference]: Without dead ends: 43 [2025-02-06 14:29:05,538 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-02-06 14:29:05,538 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-02-06 14:29:05,538 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-02-06 14:29:05,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-06 14:29:05,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-06 14:29:05,541 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-02-06 14:29:05,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2025-02-06 14:29:05,542 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 20 [2025-02-06 14:29:05,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:29:05,542 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2025-02-06 14:29:05,542 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-02-06 14:29:05,542 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2025-02-06 14:29:05,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 14:29:05,542 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:29:05,542 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-02-06 14:29:05,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 14:29:05,542 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting additionErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 14:29:05,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:29:05,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1875602431, now seen corresponding path program 2 times [2025-02-06 14:29:05,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:29:05,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540012713] [2025-02-06 14:29:05,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:29:05,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:29:05,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-02-06 14:29:05,555 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 14:29:05,555 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:29:05,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:05,709 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:29:05,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:29:05,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540012713] [2025-02-06 14:29:05,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540012713] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:29:05,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741635466] [2025-02-06 14:29:05,710 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:29:05,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:29:05,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:29:05,713 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:29:05,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 14:29:05,741 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-02-06 14:29:05,757 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 14:29:05,757 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 14:29:05,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:05,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 14:29:05,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:29:05,810 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:29:05,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:29:05,967 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:29:05,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741635466] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:29:05,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:29:05,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2025-02-06 14:29:05,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964885820] [2025-02-06 14:29:05,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:29:05,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 14:29:05,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:29:05,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 14:29:05,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2025-02-06 14:29:05,969 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-02-06 14:29:06,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:29:06,121 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2025-02-06 14:29:06,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 14:29:06,121 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-02-06 14:29:06,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:29:06,122 INFO L225 Difference]: With dead ends: 95 [2025-02-06 14:29:06,122 INFO L226 Difference]: Without dead ends: 94 [2025-02-06 14:29:06,123 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-02-06 14:29:06,123 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.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:29:06,123 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.0s Time] [2025-02-06 14:29:06,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-06 14:29:06,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2025-02-06 14:29:06,128 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-02-06 14:29:06,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2025-02-06 14:29:06,129 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 42 [2025-02-06 14:29:06,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:29:06,129 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2025-02-06 14:29:06,129 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-02-06 14:29:06,130 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2025-02-06 14:29:06,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-06 14:29:06,131 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:29:06,131 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-02-06 14:29:06,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 14:29:06,331 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-02-06 14:29:06,332 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting additionErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 14:29:06,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:29:06,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1894436595, now seen corresponding path program 3 times [2025-02-06 14:29:06,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:29:06,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748495576] [2025-02-06 14:29:06,333 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 14:29:06,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:29:06,355 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 90 statements into 11 equivalence classes. [2025-02-06 14:29:06,370 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 90 of 90 statements. [2025-02-06 14:29:06,370 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-06 14:29:06,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:06,747 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:29:06,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:29:06,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748495576] [2025-02-06 14:29:06,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748495576] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:29:06,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043518658] [2025-02-06 14:29:06,747 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 14:29:06,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:29:06,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:29:06,750 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:29:06,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 14:29:06,774 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 90 statements into 11 equivalence classes. [2025-02-06 14:29:06,795 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 90 of 90 statements. [2025-02-06 14:29:06,795 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-06 14:29:06,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:06,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 14:29:06,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:29:06,907 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:29:06,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:29:07,399 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:29:07,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043518658] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:29:07,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:29:07,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2025-02-06 14:29:07,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880988434] [2025-02-06 14:29:07,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:29:07,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-06 14:29:07,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:29:07,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-06 14:29:07,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1700, Unknown=0, NotChecked=0, Total=2256 [2025-02-06 14:29:07,402 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-02-06 14:29:08,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:29:08,028 INFO L93 Difference]: Finished difference Result 191 states and 202 transitions. [2025-02-06 14:29:08,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-02-06 14:29:08,032 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-02-06 14:29:08,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:29:08,033 INFO L225 Difference]: With dead ends: 191 [2025-02-06 14:29:08,033 INFO L226 Difference]: Without dead ends: 190 [2025-02-06 14:29:08,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1337, Invalid=3493, Unknown=0, NotChecked=0, Total=4830 [2025-02-06 14:29:08,037 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-02-06 14:29:08,037 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-02-06 14:29:08,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-02-06 14:29:08,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2025-02-06 14:29:08,056 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-02-06 14:29:08,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2025-02-06 14:29:08,056 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 90 [2025-02-06 14:29:08,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:29:08,057 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2025-02-06 14:29:08,057 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-02-06 14:29:08,057 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2025-02-06 14:29:08,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-02-06 14:29:08,058 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:29:08,058 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2025-02-06 14:29:08,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 14:29:08,258 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-02-06 14:29:08,259 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting additionErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 14:29:08,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:29:08,259 INFO L85 PathProgramCache]: Analyzing trace with hash 4587735, now seen corresponding path program 4 times [2025-02-06 14:29:08,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:29:08,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085066924] [2025-02-06 14:29:08,259 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 14:29:08,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:29:08,272 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 186 statements into 2 equivalence classes. [2025-02-06 14:29:08,326 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 186 of 186 statements. [2025-02-06 14:29:08,327 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 14:29:08,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:09,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 0 proven. 1958 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:29:09,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:29:09,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085066924] [2025-02-06 14:29:09,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085066924] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:29:09,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919578283] [2025-02-06 14:29:09,584 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 14:29:09,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:29:09,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:29:09,587 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:29:09,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 14:29:09,616 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 186 statements into 2 equivalence classes. [2025-02-06 14:29:09,656 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 186 of 186 statements. [2025-02-06 14:29:09,657 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 14:29:09,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:09,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-06 14:29:09,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:29:09,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 0 proven. 1958 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:29:09,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:29:11,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 0 proven. 1958 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:29:11,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919578283] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:29:11,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:29:11,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2025-02-06 14:29:11,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939680959] [2025-02-06 14:29:11,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:29:11,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-02-06 14:29:11,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:29:11,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-02-06 14:29:11,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2260, Invalid=6860, Unknown=0, NotChecked=0, Total=9120 [2025-02-06 14:29:11,652 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-02-06 14:29:13,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:29:13,105 INFO L93 Difference]: Finished difference Result 383 states and 406 transitions. [2025-02-06 14:29:13,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-02-06 14:29:13,105 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-02-06 14:29:13,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:29:13,108 INFO L225 Difference]: With dead ends: 383 [2025-02-06 14:29:13,108 INFO L226 Difference]: Without dead ends: 382 [2025-02-06 14:29:13,112 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-02-06 14:29:13,113 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-02-06 14:29:13,113 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-02-06 14:29:13,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-02-06 14:29:13,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 379. [2025-02-06 14:29:13,123 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-02-06 14:29:13,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 379 transitions. [2025-02-06 14:29:13,125 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 379 transitions. Word has length 186 [2025-02-06 14:29:13,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:29:13,126 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 379 transitions. [2025-02-06 14:29:13,127 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-02-06 14:29:13,127 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 379 transitions. [2025-02-06 14:29:13,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-02-06 14:29:13,131 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:29:13,131 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2025-02-06 14:29:13,141 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-02-06 14:29:13,333 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-02-06 14:29:13,333 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting additionErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 14:29:13,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:29:13,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1684581217, now seen corresponding path program 5 times [2025-02-06 14:29:13,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:29:13,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066183867] [2025-02-06 14:29:13,334 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 14:29:13,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:29:13,349 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 378 statements into 47 equivalence classes. [2025-02-06 14:29:13,439 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 378 of 378 statements. [2025-02-06 14:29:13,439 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-02-06 14:29:13,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:17,511 INFO L134 CoverageAnalysis]: Checked inductivity of 8510 backedges. 0 proven. 8510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:29:17,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:29:17,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066183867] [2025-02-06 14:29:17,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066183867] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:29:17,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064323900] [2025-02-06 14:29:17,511 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 14:29:17,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:29:17,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:29:17,520 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:29:17,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 14:29:17,584 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 378 statements into 47 equivalence classes. [2025-02-06 14:29:17,693 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 378 of 378 statements. [2025-02-06 14:29:17,693 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-02-06 14:29:17,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:17,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-02-06 14:29:17,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:29:18,051 INFO L134 CoverageAnalysis]: Checked inductivity of 8510 backedges. 0 proven. 8510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:29:18,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:29:23,442 INFO L134 CoverageAnalysis]: Checked inductivity of 8510 backedges. 0 proven. 8510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:29:23,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064323900] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:29:23,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:29:23,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2025-02-06 14:29:23,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656298275] [2025-02-06 14:29:23,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:29:23,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-02-06 14:29:23,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:29:23,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-02-06 14:29:23,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9124, Invalid=27548, Unknown=0, NotChecked=0, Total=36672 [2025-02-06 14:29:23,453 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-02-06 14:29:29,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:29:29,743 INFO L93 Difference]: Finished difference Result 767 states and 814 transitions. [2025-02-06 14:29:29,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-02-06 14:29:29,744 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-02-06 14:29:29,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:29:29,747 INFO L225 Difference]: With dead ends: 767 [2025-02-06 14:29:29,747 INFO L226 Difference]: Without dead ends: 766 [2025-02-06 14:29:29,755 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-02-06 14:29:29,757 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-02-06 14:29:29,758 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-02-06 14:29:29,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2025-02-06 14:29:29,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 763. [2025-02-06 14:29:29,780 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-02-06 14:29:29,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 763 transitions. [2025-02-06 14:29:29,782 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 763 transitions. Word has length 378 [2025-02-06 14:29:29,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:29:29,782 INFO L471 AbstractCegarLoop]: Abstraction has 763 states and 763 transitions. [2025-02-06 14:29:29,783 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-02-06 14:29:29,783 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 763 transitions. [2025-02-06 14:29:29,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 763 [2025-02-06 14:29:29,791 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:29:29,791 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 95, 94, 94, 94, 94, 1, 1, 1, 1, 1, 1] [2025-02-06 14:29:29,800 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-02-06 14:29:29,996 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-02-06 14:29:29,996 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting additionErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, additionErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 14:29:29,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:29:29,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1806023727, now seen corresponding path program 6 times [2025-02-06 14:29:29,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:29:29,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842773125] [2025-02-06 14:29:29,997 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 14:29:29,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:29:30,033 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 762 statements into 95 equivalence classes. [2025-02-06 14:29:30,264 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 762 of 762 statements. [2025-02-06 14:29:30,265 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-02-06 14:29:30,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:46,622 INFO L134 CoverageAnalysis]: Checked inductivity of 35438 backedges. 0 proven. 35438 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:29:46,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:29:46,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842773125] [2025-02-06 14:29:46,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842773125] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:29:46,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192471879] [2025-02-06 14:29:46,623 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 14:29:46,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:29:46,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:29:46,625 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:29:46,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 14:29:46,675 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 762 statements into 95 equivalence classes. [2025-02-06 14:29:46,941 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 762 of 762 statements. [2025-02-06 14:29:46,941 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-02-06 14:29:46,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:29:46,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 1547 conjuncts, 192 conjuncts are in the unsatisfiable core [2025-02-06 14:29:46,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:29:47,549 INFO L134 CoverageAnalysis]: Checked inductivity of 35438 backedges. 0 proven. 35438 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:29:47,550 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:30:08,187 INFO L134 CoverageAnalysis]: Checked inductivity of 35438 backedges. 0 proven. 35438 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:30:08,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192471879] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:30:08,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:30:08,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [192, 192, 192] total 383 [2025-02-06 14:30:08,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585247454] [2025-02-06 14:30:08,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:30:08,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 384 states [2025-02-06 14:30:08,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:30:08,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 384 interpolants. [2025-02-06 14:30:08,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36676, Invalid=110396, Unknown=0, NotChecked=0, Total=147072 [2025-02-06 14:30:08,205 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)