./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i --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/loop-invgen/apache-escape-absolute.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:42:23,450 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:42:23,504 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 13:42:23,508 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:42:23,509 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:42:23,528 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:42:23,529 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:42:23,529 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:42:23,529 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:42:23,529 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:42:23,530 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:42:23,530 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:42:23,530 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:42:23,530 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:42:23,530 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:42:23,530 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:42:23,530 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 13:42:23,530 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:42:23,530 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:42:23,531 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:42:23,531 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:42:23,531 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 13:42:23,531 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:42:23,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 13:42:23,531 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 13:42:23,531 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:42:23,531 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:42:23,531 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 13:42:23,531 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:42:23,531 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:42:23,531 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:42:23,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:42:23,531 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:42:23,531 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:42:23,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:42:23,532 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:42:23,532 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:42:23,532 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 13:42:23,532 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 13:42:23,532 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:42:23,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:42:23,532 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:42:23,532 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:42:23,532 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:42:23,532 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:42:23,532 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 -> b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5 [2025-02-06 13:42:23,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:42:23,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:42:23,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:42:23,795 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:42:23,795 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:42:23,796 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2025-02-06 13:42:25,028 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f2f9b63da/450a07d44e974edbacadfb1feaefcff9/FLAG2825bff00 [2025-02-06 13:42:25,271 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:42:25,276 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2025-02-06 13:42:25,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f2f9b63da/450a07d44e974edbacadfb1feaefcff9/FLAG2825bff00 [2025-02-06 13:42:25,309 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f2f9b63da/450a07d44e974edbacadfb1feaefcff9 [2025-02-06 13:42:25,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:42:25,314 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:42:25,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:42:25,316 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:42:25,319 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:42:25,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:42:25" (1/1) ... [2025-02-06 13:42:25,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b52740c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:25, skipping insertion in model container [2025-02-06 13:42:25,321 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:42:25" (1/1) ... [2025-02-06 13:42:25,338 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:42:25,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:42:25,479 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:42:25,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:42:25,516 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:42:25,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:25 WrapperNode [2025-02-06 13:42:25,518 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:42:25,519 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:42:25,519 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:42:25,519 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:42:25,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:25" (1/1) ... [2025-02-06 13:42:25,533 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:25" (1/1) ... [2025-02-06 13:42:25,551 INFO L138 Inliner]: procedures = 16, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 158 [2025-02-06 13:42:25,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:42:25,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:42:25,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:42:25,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:42:25,559 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:25" (1/1) ... [2025-02-06 13:42:25,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:25" (1/1) ... [2025-02-06 13:42:25,562 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:25" (1/1) ... [2025-02-06 13:42:25,578 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 13:42:25,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:25" (1/1) ... [2025-02-06 13:42:25,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:25" (1/1) ... [2025-02-06 13:42:25,583 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:25" (1/1) ... [2025-02-06 13:42:25,584 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:25" (1/1) ... [2025-02-06 13:42:25,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:25" (1/1) ... [2025-02-06 13:42:25,589 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:25" (1/1) ... [2025-02-06 13:42:25,590 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:42:25,591 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:42:25,591 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:42:25,591 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:42:25,592 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:25" (1/1) ... [2025-02-06 13:42:25,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:42:25,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:42:25,629 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 13:42:25,631 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 13:42:25,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:42:25,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:42:25,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:42:25,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:42:25,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 13:42:25,650 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 13:42:25,701 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:42:25,703 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:42:25,979 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-02-06 13:42:25,979 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:42:25,989 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:42:25,990 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:42:25,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:42:25 BoogieIcfgContainer [2025-02-06 13:42:25,991 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:42:25,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:42:25,994 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:42:25,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:42:25,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:42:25" (1/3) ... [2025-02-06 13:42:25,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@239cc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:42:25, skipping insertion in model container [2025-02-06 13:42:25,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:42:25" (2/3) ... [2025-02-06 13:42:25,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@239cc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:42:25, skipping insertion in model container [2025-02-06 13:42:25,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:42:25" (3/3) ... [2025-02-06 13:42:25,999 INFO L128 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2025-02-06 13:42:26,009 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:42:26,011 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG apache-escape-absolute.i that has 2 procedures, 112 locations, 1 initial locations, 2 loop locations, and 30 error locations. [2025-02-06 13:42:26,049 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:42:26,056 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;@6b820b20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:42:26,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-02-06 13:42:26,059 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 62 states have (on average 1.8225806451612903) internal successors, (113), 95 states have internal predecessors, (113), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 13:42:26,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 13:42:26,062 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:42:26,063 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:42:26,063 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-02-06 13:42:26,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:42:26,068 INFO L85 PathProgramCache]: Analyzing trace with hash 760677589, now seen corresponding path program 1 times [2025-02-06 13:42:26,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:42:26,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24722023] [2025-02-06 13:42:26,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:42:26,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:42:26,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:42:26,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:42:26,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:42:26,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:42:26,237 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 13:42:26,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:42:26,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24722023] [2025-02-06 13:42:26,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24722023] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:42:26,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:42:26,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:42:26,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718994328] [2025-02-06 13:42:26,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:42:26,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:42:26,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:42:26,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:42:26,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:42:26,263 INFO L87 Difference]: Start difference. First operand has 112 states, 62 states have (on average 1.8225806451612903) internal successors, (113), 95 states have internal predecessors, (113), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:42:26,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:42:26,361 INFO L93 Difference]: Finished difference Result 202 states and 289 transitions. [2025-02-06 13:42:26,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:42:26,363 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-06 13:42:26,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:42:26,369 INFO L225 Difference]: With dead ends: 202 [2025-02-06 13:42:26,369 INFO L226 Difference]: Without dead ends: 100 [2025-02-06 13:42:26,374 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 13:42:26,377 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 78 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:42:26,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 144 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:42:26,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-06 13:42:26,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-02-06 13:42:26,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 83 states have internal predecessors, (86), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 13:42:26,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 122 transitions. [2025-02-06 13:42:26,419 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 122 transitions. Word has length 10 [2025-02-06 13:42:26,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:42:26,420 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 122 transitions. [2025-02-06 13:42:26,421 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:42:26,421 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions. [2025-02-06 13:42:26,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 13:42:26,422 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:42:26,422 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:42:26,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:42:26,423 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-02-06 13:42:26,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:42:26,423 INFO L85 PathProgramCache]: Analyzing trace with hash 2106167799, now seen corresponding path program 1 times [2025-02-06 13:42:26,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:42:26,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7037992] [2025-02-06 13:42:26,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:42:26,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:42:26,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 13:42:26,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 13:42:26,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:42:26,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:42:26,464 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 13:42:26,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:42:26,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7037992] [2025-02-06 13:42:26,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7037992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:42:26,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:42:26,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:42:26,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292300203] [2025-02-06 13:42:26,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:42:26,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:42:26,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:42:26,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:42:26,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:42:26,466 INFO L87 Difference]: Start difference. First operand 100 states and 122 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:42:26,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:42:26,489 INFO L93 Difference]: Finished difference Result 188 states and 231 transitions. [2025-02-06 13:42:26,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:42:26,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 13:42:26,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:42:26,493 INFO L225 Difference]: With dead ends: 188 [2025-02-06 13:42:26,495 INFO L226 Difference]: Without dead ends: 100 [2025-02-06 13:42:26,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:42:26,496 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:42:26,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 238 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:42:26,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-06 13:42:26,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-02-06 13:42:26,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 83 states have internal predecessors, (85), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 13:42:26,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 121 transitions. [2025-02-06 13:42:26,508 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 121 transitions. Word has length 11 [2025-02-06 13:42:26,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:42:26,508 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 121 transitions. [2025-02-06 13:42:26,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:42:26,508 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 121 transitions. [2025-02-06 13:42:26,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 13:42:26,509 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:42:26,509 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:42:26,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:42:26,509 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-02-06 13:42:26,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:42:26,510 INFO L85 PathProgramCache]: Analyzing trace with hash 2106168860, now seen corresponding path program 1 times [2025-02-06 13:42:26,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:42:26,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219075478] [2025-02-06 13:42:26,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:42:26,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:42:26,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 13:42:26,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 13:42:26,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:42:26,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:42:26,543 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 13:42:26,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:42:26,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219075478] [2025-02-06 13:42:26,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219075478] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:42:26,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:42:26,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:42:26,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940657837] [2025-02-06 13:42:26,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:42:26,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:42:26,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:42:26,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:42:26,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:42:26,545 INFO L87 Difference]: Start difference. First operand 100 states and 121 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:42:26,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:42:26,583 INFO L93 Difference]: Finished difference Result 100 states and 121 transitions. [2025-02-06 13:42:26,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:42:26,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 13:42:26,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:42:26,584 INFO L225 Difference]: With dead ends: 100 [2025-02-06 13:42:26,585 INFO L226 Difference]: Without dead ends: 95 [2025-02-06 13:42:26,585 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 13:42:26,585 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 67 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:42:26,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 122 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:42:26,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-06 13:42:26,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-02-06 13:42:26,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 78 states have internal predecessors, (80), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 13:42:26,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2025-02-06 13:42:26,600 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 11 [2025-02-06 13:42:26,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:42:26,600 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2025-02-06 13:42:26,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:42:26,600 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2025-02-06 13:42:26,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 13:42:26,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:42:26,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:42:26,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:42:26,600 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-02-06 13:42:26,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:42:26,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1098680598, now seen corresponding path program 1 times [2025-02-06 13:42:26,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:42:26,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947581586] [2025-02-06 13:42:26,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:42:26,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:42:26,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 13:42:26,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 13:42:26,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:42:26,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:42:26,658 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 13:42:26,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:42:26,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947581586] [2025-02-06 13:42:26,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947581586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:42:26,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:42:26,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:42:26,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966846426] [2025-02-06 13:42:26,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:42:26,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:42:26,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:42:26,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:42:26,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:42:26,660 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:42:26,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:42:26,732 INFO L93 Difference]: Finished difference Result 95 states and 116 transitions. [2025-02-06 13:42:26,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:42:26,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-02-06 13:42:26,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:42:26,734 INFO L225 Difference]: With dead ends: 95 [2025-02-06 13:42:26,734 INFO L226 Difference]: Without dead ends: 87 [2025-02-06 13:42:26,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:42:26,735 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 46 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:42:26,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 179 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:42:26,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-06 13:42:26,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-06 13:42:26,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 70 states have internal predecessors, (72), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 13:42:26,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions. [2025-02-06 13:42:26,751 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 13 [2025-02-06 13:42:26,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:42:26,751 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 108 transitions. [2025-02-06 13:42:26,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:42:26,751 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2025-02-06 13:42:26,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 13:42:26,754 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:42:26,754 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:42:26,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 13:42:26,754 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-02-06 13:42:26,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:42:26,754 INFO L85 PathProgramCache]: Analyzing trace with hash -300639758, now seen corresponding path program 1 times [2025-02-06 13:42:26,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:42:26,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084391141] [2025-02-06 13:42:26,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:42:26,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:42:26,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 13:42:26,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 13:42:26,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:42:26,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:42:26,819 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 13:42:26,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:42:26,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084391141] [2025-02-06 13:42:26,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084391141] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:42:26,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:42:26,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:42:26,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316951282] [2025-02-06 13:42:26,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:42:26,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:42:26,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:42:26,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:42:26,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:42:26,820 INFO L87 Difference]: Start difference. First operand 87 states and 108 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:42:26,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:42:26,938 INFO L93 Difference]: Finished difference Result 119 states and 148 transitions. [2025-02-06 13:42:26,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:42:26,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-06 13:42:26,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:42:26,941 INFO L225 Difference]: With dead ends: 119 [2025-02-06 13:42:26,941 INFO L226 Difference]: Without dead ends: 112 [2025-02-06 13:42:26,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:42:26,942 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 26 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:42:26,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 233 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:42:26,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-06 13:42:26,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-02-06 13:42:26,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 88 states have internal predecessors, (93), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 13:42:26,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 141 transitions. [2025-02-06 13:42:26,955 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 141 transitions. Word has length 14 [2025-02-06 13:42:26,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:42:26,955 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 141 transitions. [2025-02-06 13:42:26,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:42:26,955 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 141 transitions. [2025-02-06 13:42:26,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 13:42:26,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:42:26,958 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:42:26,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:42:26,958 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-02-06 13:42:26,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:42:26,958 INFO L85 PathProgramCache]: Analyzing trace with hash -2044329334, now seen corresponding path program 1 times [2025-02-06 13:42:26,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:42:26,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254121573] [2025-02-06 13:42:26,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:42:26,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:42:26,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 13:42:26,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 13:42:26,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:42:26,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:42:27,184 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 13:42:27,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:42:27,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254121573] [2025-02-06 13:42:27,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254121573] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:42:27,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677866642] [2025-02-06 13:42:27,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:42:27,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:42:27,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:42:27,187 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 13:42:27,189 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 13:42:27,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 13:42:27,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 13:42:27,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:42:27,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:42:27,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:42:27,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:42:27,364 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 13:42:27,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:42:27,503 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-06 13:42:27,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677866642] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:42:27,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:42:27,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2025-02-06 13:42:27,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649311944] [2025-02-06 13:42:27,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:42:27,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 13:42:27,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:42:27,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 13:42:27,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:42:27,505 INFO L87 Difference]: Start difference. First operand 112 states and 141 transitions. Second operand has 11 states, 10 states have (on average 8.7) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2025-02-06 13:42:27,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:42:27,965 INFO L93 Difference]: Finished difference Result 334 states and 459 transitions. [2025-02-06 13:42:27,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:42:27,965 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.7) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) Word has length 72 [2025-02-06 13:42:27,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:42:27,969 INFO L225 Difference]: With dead ends: 334 [2025-02-06 13:42:27,969 INFO L226 Difference]: Without dead ends: 328 [2025-02-06 13:42:27,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2025-02-06 13:42:27,972 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 403 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 13:42:27,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 440 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 13:42:27,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-02-06 13:42:27,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 294. [2025-02-06 13:42:27,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 208 states have (on average 1.2163461538461537) internal successors, (253), 223 states have internal predecessors, (253), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-06 13:42:28,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 409 transitions. [2025-02-06 13:42:28,001 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 409 transitions. Word has length 72 [2025-02-06 13:42:28,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:42:28,002 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 409 transitions. [2025-02-06 13:42:28,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.7) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2025-02-06 13:42:28,002 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 409 transitions. [2025-02-06 13:42:28,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-06 13:42:28,006 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:42:28,006 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:42:28,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 13:42:28,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:42:28,207 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-02-06 13:42:28,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:42:28,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1439485011, now seen corresponding path program 1 times [2025-02-06 13:42:28,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:42:28,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864200810] [2025-02-06 13:42:28,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:42:28,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:42:28,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 13:42:28,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 13:42:28,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:42:28,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:42:28,269 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-06 13:42:28,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:42:28,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864200810] [2025-02-06 13:42:28,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864200810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:42:28,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:42:28,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:42:28,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611299216] [2025-02-06 13:42:28,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:42:28,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:42:28,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:42:28,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:42:28,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:42:28,272 INFO L87 Difference]: Start difference. First operand 294 states and 409 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-06 13:42:28,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:42:28,322 INFO L93 Difference]: Finished difference Result 419 states and 595 transitions. [2025-02-06 13:42:28,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:42:28,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 92 [2025-02-06 13:42:28,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:42:28,324 INFO L225 Difference]: With dead ends: 419 [2025-02-06 13:42:28,324 INFO L226 Difference]: Without dead ends: 294 [2025-02-06 13:42:28,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:42:28,325 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:42:28,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:42:28,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-02-06 13:42:28,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2025-02-06 13:42:28,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 208 states have (on average 1.1875) internal successors, (247), 223 states have internal predecessors, (247), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-06 13:42:28,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 403 transitions. [2025-02-06 13:42:28,344 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 403 transitions. Word has length 92 [2025-02-06 13:42:28,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:42:28,344 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 403 transitions. [2025-02-06 13:42:28,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-06 13:42:28,345 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 403 transitions. [2025-02-06 13:42:28,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-06 13:42:28,347 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:42:28,347 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:42:28,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 13:42:28,347 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-02-06 13:42:28,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:42:28,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1300297231, now seen corresponding path program 1 times [2025-02-06 13:42:28,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:42:28,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636449810] [2025-02-06 13:42:28,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:42:28,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:42:28,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-06 13:42:28,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 13:42:28,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:42:28,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:42:28,407 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-06 13:42:28,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:42:28,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636449810] [2025-02-06 13:42:28,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636449810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:42:28,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:42:28,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:42:28,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283231238] [2025-02-06 13:42:28,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:42:28,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:42:28,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:42:28,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:42:28,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:42:28,409 INFO L87 Difference]: Start difference. First operand 294 states and 403 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-06 13:42:28,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:42:28,438 INFO L93 Difference]: Finished difference Result 294 states and 403 transitions. [2025-02-06 13:42:28,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:42:28,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 93 [2025-02-06 13:42:28,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:42:28,442 INFO L225 Difference]: With dead ends: 294 [2025-02-06 13:42:28,443 INFO L226 Difference]: Without dead ends: 293 [2025-02-06 13:42:28,443 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 13:42:28,443 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 19 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:42:28,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 120 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:42:28,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-02-06 13:42:28,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2025-02-06 13:42:28,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 208 states have (on average 1.1634615384615385) internal successors, (242), 222 states have internal predecessors, (242), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-06 13:42:28,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 398 transitions. [2025-02-06 13:42:28,477 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 398 transitions. Word has length 93 [2025-02-06 13:42:28,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:42:28,477 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 398 transitions. [2025-02-06 13:42:28,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-06 13:42:28,478 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 398 transitions. [2025-02-06 13:42:28,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 13:42:28,479 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:42:28,479 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:42:28,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 13:42:28,479 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-02-06 13:42:28,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:42:28,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1654508504, now seen corresponding path program 1 times [2025-02-06 13:42:28,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:42:28,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646211873] [2025-02-06 13:42:28,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:42:28,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:42:28,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 13:42:28,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 13:42:28,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:42:28,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:42:28,556 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-06 13:42:28,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:42:28,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646211873] [2025-02-06 13:42:28,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646211873] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:42:28,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:42:28,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:42:28,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511838178] [2025-02-06 13:42:28,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:42:28,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:42:28,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:42:28,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:42:28,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:42:28,558 INFO L87 Difference]: Start difference. First operand 293 states and 398 transitions. Second operand has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-06 13:42:28,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:42:28,577 INFO L93 Difference]: Finished difference Result 293 states and 398 transitions. [2025-02-06 13:42:28,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:42:28,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 94 [2025-02-06 13:42:28,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:42:28,579 INFO L225 Difference]: With dead ends: 293 [2025-02-06 13:42:28,579 INFO L226 Difference]: Without dead ends: 292 [2025-02-06 13:42:28,579 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 13:42:28,579 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 18 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:42:28,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 118 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:42:28,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-02-06 13:42:28,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2025-02-06 13:42:28,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 208 states have (on average 1.1394230769230769) internal successors, (237), 221 states have internal predecessors, (237), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-06 13:42:28,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 393 transitions. [2025-02-06 13:42:28,597 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 393 transitions. Word has length 94 [2025-02-06 13:42:28,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:42:28,598 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 393 transitions. [2025-02-06 13:42:28,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-06 13:42:28,598 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 393 transitions. [2025-02-06 13:42:28,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 13:42:28,599 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:42:28,599 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:42:28,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 13:42:28,599 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-02-06 13:42:28,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:42:28,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1258270390, now seen corresponding path program 1 times [2025-02-06 13:42:28,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:42:28,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802239762] [2025-02-06 13:42:28,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:42:28,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:42:28,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 13:42:28,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 13:42:28,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:42:28,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:42:28,652 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 13:42:28,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:42:28,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802239762] [2025-02-06 13:42:28,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802239762] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:42:28,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:42:28,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:42:28,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706876787] [2025-02-06 13:42:28,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:42:28,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:42:28,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:42:28,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:42:28,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:42:28,653 INFO L87 Difference]: Start difference. First operand 292 states and 393 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 13:42:28,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:42:28,677 INFO L93 Difference]: Finished difference Result 392 states and 539 transitions. [2025-02-06 13:42:28,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:42:28,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 106 [2025-02-06 13:42:28,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:42:28,679 INFO L225 Difference]: With dead ends: 392 [2025-02-06 13:42:28,679 INFO L226 Difference]: Without dead ends: 292 [2025-02-06 13:42:28,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:42:28,680 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:42:28,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 194 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:42:28,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-02-06 13:42:28,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2025-02-06 13:42:28,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 208 states have (on average 1.1153846153846154) internal successors, (232), 221 states have internal predecessors, (232), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-02-06 13:42:28,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 388 transitions. [2025-02-06 13:42:28,700 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 388 transitions. Word has length 106 [2025-02-06 13:42:28,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:42:28,700 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 388 transitions. [2025-02-06 13:42:28,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 13:42:28,700 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 388 transitions. [2025-02-06 13:42:28,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 13:42:28,702 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:42:28,702 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:42:28,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 13:42:28,703 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-02-06 13:42:28,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:42:28,703 INFO L85 PathProgramCache]: Analyzing trace with hash 365780839, now seen corresponding path program 1 times [2025-02-06 13:42:28,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:42:28,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325377871] [2025-02-06 13:42:28,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:42:28,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:42:28,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 13:42:28,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 13:42:28,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:42:28,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:42:28,754 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 13:42:28,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:42:28,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325377871] [2025-02-06 13:42:28,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325377871] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:42:28,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:42:28,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:42:28,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069653460] [2025-02-06 13:42:28,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:42:28,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:42:28,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:42:28,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:42:28,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:42:28,755 INFO L87 Difference]: Start difference. First operand 292 states and 388 transitions. Second operand has 3 states, 2 states have (on average 25.5) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 13:42:28,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:42:28,777 INFO L93 Difference]: Finished difference Result 357 states and 471 transitions. [2025-02-06 13:42:28,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:42:28,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 25.5) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2025-02-06 13:42:28,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:42:28,780 INFO L225 Difference]: With dead ends: 357 [2025-02-06 13:42:28,780 INFO L226 Difference]: Without dead ends: 355 [2025-02-06 13:42:28,780 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 13:42:28,780 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 5 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:42:28,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 186 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:42:28,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-02-06 13:42:28,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 354. [2025-02-06 13:42:28,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 262 states have (on average 1.1030534351145038) internal successors, (289), 274 states have internal predecessors, (289), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-02-06 13:42:28,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 461 transitions. [2025-02-06 13:42:28,806 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 461 transitions. Word has length 108 [2025-02-06 13:42:28,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:42:28,806 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 461 transitions. [2025-02-06 13:42:28,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 25.5) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 13:42:28,806 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 461 transitions. [2025-02-06 13:42:28,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 13:42:28,807 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:42:28,807 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:42:28,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 13:42:28,808 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-02-06 13:42:28,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:42:28,808 INFO L85 PathProgramCache]: Analyzing trace with hash 401663306, now seen corresponding path program 2 times [2025-02-06 13:42:28,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:42:28,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847686537] [2025-02-06 13:42:28,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:42:28,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:42:28,813 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 140 statements into 2 equivalence classes. [2025-02-06 13:42:28,821 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 13:42:28,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:42:28,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:42:28,996 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 13:42:28,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:42:28,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847686537] [2025-02-06 13:42:28,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847686537] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:42:28,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002430771] [2025-02-06 13:42:28,997 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:42:28,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:42:28,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:42:28,999 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 13:42:29,001 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 13:42:29,028 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 140 statements into 2 equivalence classes. [2025-02-06 13:42:29,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 13:42:29,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:42:29,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:42:29,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 13:42:29,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:42:29,177 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 13:42:29,178 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:42:29,400 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 13:42:29,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002430771] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:42:29,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:42:29,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2025-02-06 13:42:29,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202274279] [2025-02-06 13:42:29,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:42:29,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 13:42:29,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:42:29,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 13:42:29,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2025-02-06 13:42:29,402 INFO L87 Difference]: Start difference. First operand 354 states and 461 transitions. Second operand has 19 states, 18 states have (on average 7.944444444444445) internal successors, (143), 19 states have internal predecessors, (143), 13 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 13 states have call predecessors, (38), 13 states have call successors, (38) [2025-02-06 13:42:30,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:42:30,406 INFO L93 Difference]: Finished difference Result 891 states and 1173 transitions. [2025-02-06 13:42:30,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 13:42:30,407 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 7.944444444444445) internal successors, (143), 19 states have internal predecessors, (143), 13 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 13 states have call predecessors, (38), 13 states have call successors, (38) Word has length 140 [2025-02-06 13:42:30,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:42:30,413 INFO L225 Difference]: With dead ends: 891 [2025-02-06 13:42:30,413 INFO L226 Difference]: Without dead ends: 888 [2025-02-06 13:42:30,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=334, Invalid=788, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 13:42:30,414 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 1167 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 486 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1179 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 486 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 13:42:30,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1179 Valid, 632 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [486 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 13:42:30,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2025-02-06 13:42:30,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 866. [2025-02-06 13:42:30,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 646 states have (on average 1.1037151702786379) internal successors, (713), 674 states have internal predecessors, (713), 214 states have call successors, (214), 1 states have call predecessors, (214), 1 states have return successors, (214), 214 states have call predecessors, (214), 214 states have call successors, (214) [2025-02-06 13:42:30,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1141 transitions. [2025-02-06 13:42:30,466 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1141 transitions. Word has length 140 [2025-02-06 13:42:30,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:42:30,466 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1141 transitions. [2025-02-06 13:42:30,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 7.944444444444445) internal successors, (143), 19 states have internal predecessors, (143), 13 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 13 states have call predecessors, (38), 13 states have call successors, (38) [2025-02-06 13:42:30,467 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1141 transitions. [2025-02-06 13:42:30,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 13:42:30,469 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:42:30,469 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:42:30,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 13:42:30,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:42:30,674 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-02-06 13:42:30,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:42:30,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1226487606, now seen corresponding path program 1 times [2025-02-06 13:42:30,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:42:30,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531198589] [2025-02-06 13:42:30,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:42:30,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:42:30,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 13:42:30,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 13:42:30,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:42:30,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:42:30,760 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 13:42:30,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:42:30,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531198589] [2025-02-06 13:42:30,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531198589] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:42:30,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649719060] [2025-02-06 13:42:30,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:42:30,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:42:30,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:42:30,762 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 13:42:30,764 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 13:42:30,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 13:42:30,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 13:42:30,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:42:30,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:42:30,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 13:42:30,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:42:30,877 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 13:42:30,877 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:42:30,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649719060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:42:30,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:42:30,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-06 13:42:30,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154943725] [2025-02-06 13:42:30,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:42:30,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:42:30,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:42:30,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:42:30,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:42:30,878 INFO L87 Difference]: Start difference. First operand 866 states and 1141 transitions. Second operand has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 13:42:30,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:42:30,938 INFO L93 Difference]: Finished difference Result 867 states and 1141 transitions. [2025-02-06 13:42:30,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:42:30,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 151 [2025-02-06 13:42:30,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:42:30,943 INFO L225 Difference]: With dead ends: 867 [2025-02-06 13:42:30,943 INFO L226 Difference]: Without dead ends: 866 [2025-02-06 13:42:30,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 150 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 13:42:30,944 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 7 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:42:30,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 270 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:42:30,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2025-02-06 13:42:30,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 865. [2025-02-06 13:42:30,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 646 states have (on average 1.085139318885449) internal successors, (701), 673 states have internal predecessors, (701), 214 states have call successors, (214), 1 states have call predecessors, (214), 1 states have return successors, (214), 214 states have call predecessors, (214), 214 states have call successors, (214) [2025-02-06 13:42:30,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1129 transitions. [2025-02-06 13:42:30,986 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1129 transitions. Word has length 151 [2025-02-06 13:42:30,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:42:30,987 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1129 transitions. [2025-02-06 13:42:30,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-06 13:42:30,987 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1129 transitions. [2025-02-06 13:42:30,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-06 13:42:30,990 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:42:30,990 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:42:30,998 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 13:42:31,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:42:31,191 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-02-06 13:42:31,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:42:31,192 INFO L85 PathProgramCache]: Analyzing trace with hash -633589896, now seen corresponding path program 1 times [2025-02-06 13:42:31,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:42:31,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478884533] [2025-02-06 13:42:31,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:42:31,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:42:31,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 13:42:31,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 13:42:31,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:42:31,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:42:31,285 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 13:42:31,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:42:31,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478884533] [2025-02-06 13:42:31,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478884533] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:42:31,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676787964] [2025-02-06 13:42:31,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:42:31,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:42:31,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:42:31,290 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 13:42:31,292 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 13:42:31,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-06 13:42:31,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-06 13:42:31,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:42:31,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:42:31,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 13:42:31,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:42:31,399 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 13:42:31,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:42:31,523 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 13:42:31,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676787964] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:42:31,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:42:31,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 13:42:31,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625435933] [2025-02-06 13:42:31,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:42:31,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 13:42:31,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:42:31,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 13:42:31,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:42:31,526 INFO L87 Difference]: Start difference. First operand 865 states and 1129 transitions. Second operand has 7 states, 6 states have (on average 17.0) internal successors, (102), 7 states have internal predecessors, (102), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) [2025-02-06 13:42:31,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:42:31,653 INFO L93 Difference]: Finished difference Result 1458 states and 1972 transitions. [2025-02-06 13:42:31,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:42:31,653 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.0) internal successors, (102), 7 states have internal predecessors, (102), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) Word has length 152 [2025-02-06 13:42:31,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:42:31,662 INFO L225 Difference]: With dead ends: 1458 [2025-02-06 13:42:31,663 INFO L226 Difference]: Without dead ends: 1457 [2025-02-06 13:42:31,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:42:31,664 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 18 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:42:31,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 365 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:42:31,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2025-02-06 13:42:31,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1453. [2025-02-06 13:42:31,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1042 states have (on average 1.081573896353167) internal successors, (1127), 1099 states have internal predecessors, (1127), 406 states have call successors, (406), 1 states have call predecessors, (406), 1 states have return successors, (406), 406 states have call predecessors, (406), 406 states have call successors, (406) [2025-02-06 13:42:31,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 1939 transitions. [2025-02-06 13:42:31,775 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 1939 transitions. Word has length 152 [2025-02-06 13:42:31,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:42:31,776 INFO L471 AbstractCegarLoop]: Abstraction has 1453 states and 1939 transitions. [2025-02-06 13:42:31,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.0) internal successors, (102), 7 states have internal predecessors, (102), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) [2025-02-06 13:42:31,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 1939 transitions. [2025-02-06 13:42:31,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-02-06 13:42:31,782 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:42:31,782 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:42:31,791 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 13:42:31,986 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,SelfDestructingSolverStorable13 [2025-02-06 13:42:31,986 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-02-06 13:42:31,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:42:31,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1832482102, now seen corresponding path program 3 times [2025-02-06 13:42:31,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:42:31,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155337465] [2025-02-06 13:42:31,987 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:42:31,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:42:31,998 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 276 statements into 26 equivalence classes. [2025-02-06 13:42:32,004 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 38 of 276 statements. [2025-02-06 13:42:32,004 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 13:42:32,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:42:32,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2803 backedges. 90 proven. 42 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2025-02-06 13:42:32,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:42:32,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155337465] [2025-02-06 13:42:32,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155337465] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:42:32,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405016565] [2025-02-06 13:42:32,059 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:42:32,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:42:32,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:42:32,063 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 13:42:32,064 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 13:42:32,104 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 276 statements into 26 equivalence classes. [2025-02-06 13:42:32,116 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 38 of 276 statements. [2025-02-06 13:42:32,116 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 13:42:32,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:42:32,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 13:42:32,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:42:32,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2803 backedges. 116 proven. 42 refuted. 0 times theorem prover too weak. 2645 trivial. 0 not checked. [2025-02-06 13:42:32,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:42:32,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2803 backedges. 90 proven. 68 refuted. 0 times theorem prover too weak. 2645 trivial. 0 not checked. [2025-02-06 13:42:32,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405016565] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:42:32,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:42:32,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2025-02-06 13:42:32,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97275815] [2025-02-06 13:42:32,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:42:32,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 13:42:32,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:42:32,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 13:42:32,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-06 13:42:32,689 INFO L87 Difference]: Start difference. First operand 1453 states and 1939 transitions. Second operand has 12 states, 11 states have (on average 6.0) internal successors, (66), 12 states have internal predecessors, (66), 7 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18) [2025-02-06 13:42:32,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:42:32,927 INFO L93 Difference]: Finished difference Result 1549 states and 2047 transitions. [2025-02-06 13:42:32,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:42:32,927 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.0) internal successors, (66), 12 states have internal predecessors, (66), 7 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18) Word has length 276 [2025-02-06 13:42:32,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:42:32,936 INFO L225 Difference]: With dead ends: 1549 [2025-02-06 13:42:32,936 INFO L226 Difference]: Without dead ends: 1546 [2025-02-06 13:42:32,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 545 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-02-06 13:42:32,938 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 98 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:42:32,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 218 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:42:32,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2025-02-06 13:42:32,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 148. [2025-02-06 13:42:32,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 108 states have (on average 1.0648148148148149) internal successors, (115), 114 states have internal predecessors, (115), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-06 13:42:32,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 191 transitions. [2025-02-06 13:42:32,994 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 191 transitions. Word has length 276 [2025-02-06 13:42:32,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:42:32,995 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 191 transitions. [2025-02-06 13:42:32,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.0) internal successors, (66), 12 states have internal predecessors, (66), 7 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18) [2025-02-06 13:42:32,995 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 191 transitions. [2025-02-06 13:42:32,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-02-06 13:42:32,997 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:42:32,998 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:42:33,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 13:42:33,202 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,SelfDestructingSolverStorable14 [2025-02-06 13:42:33,202 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2025-02-06 13:42:33,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:42:33,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1713849383, now seen corresponding path program 2 times [2025-02-06 13:42:33,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:42:33,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975857408] [2025-02-06 13:42:33,203 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:42:33,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:42:33,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 281 statements into 2 equivalence classes. [2025-02-06 13:42:33,235 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 281 of 281 statements. [2025-02-06 13:42:33,235 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:42:33,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:42:33,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2686 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2616 trivial. 0 not checked. [2025-02-06 13:42:33,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:42:33,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975857408] [2025-02-06 13:42:33,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975857408] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:42:33,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423625779] [2025-02-06 13:42:33,411 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:42:33,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:42:33,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:42:33,413 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 13:42:33,415 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 13:42:33,453 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 281 statements into 2 equivalence classes. [2025-02-06 13:42:33,508 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 281 of 281 statements. [2025-02-06 13:42:33,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:42:33,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:42:33,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 13:42:33,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:42:33,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2686 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2025-02-06 13:42:33,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:42:33,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2686 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2025-02-06 13:42:33,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423625779] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:42:33,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:42:33,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2025-02-06 13:42:33,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402968415] [2025-02-06 13:42:33,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:42:33,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 13:42:33,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:42:33,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 13:42:33,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2025-02-06 13:42:33,915 INFO L87 Difference]: Start difference. First operand 148 states and 191 transitions. Second operand has 16 states, 15 states have (on average 15.333333333333334) internal successors, (230), 16 states have internal predecessors, (230), 14 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 14 states have call predecessors, (86), 14 states have call successors, (86) [2025-02-06 13:42:34,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:42:34,083 INFO L93 Difference]: Finished difference Result 180 states and 235 transitions. [2025-02-06 13:42:34,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 13:42:34,084 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 15.333333333333334) internal successors, (230), 16 states have internal predecessors, (230), 14 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 14 states have call predecessors, (86), 14 states have call successors, (86) Word has length 281 [2025-02-06 13:42:34,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:42:34,084 INFO L225 Difference]: With dead ends: 180 [2025-02-06 13:42:34,085 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 13:42:34,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 551 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=219, Invalid=333, Unknown=0, NotChecked=0, Total=552 [2025-02-06 13:42:34,086 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 61 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:42:34,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 373 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:42:34,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 13:42:34,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 13:42:34,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:42:34,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 13:42:34,087 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 281 [2025-02-06 13:42:34,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:42:34,088 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 13:42:34,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 15.333333333333334) internal successors, (230), 16 states have internal predecessors, (230), 14 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 14 states have call predecessors, (86), 14 states have call successors, (86) [2025-02-06 13:42:34,088 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 13:42:34,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 13:42:34,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 30 remaining) [2025-02-06 13:42:34,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 30 remaining) [2025-02-06 13:42:34,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 30 remaining) [2025-02-06 13:42:34,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 30 remaining) [2025-02-06 13:42:34,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 30 remaining) [2025-02-06 13:42:34,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 30 remaining) [2025-02-06 13:42:34,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 30 remaining) [2025-02-06 13:42:34,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 30 remaining) [2025-02-06 13:42:34,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 30 remaining) [2025-02-06 13:42:34,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 30 remaining) [2025-02-06 13:42:34,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 30 remaining) [2025-02-06 13:42:34,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 30 remaining) [2025-02-06 13:42:34,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 30 remaining) [2025-02-06 13:42:34,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 30 remaining) [2025-02-06 13:42:34,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 30 remaining) [2025-02-06 13:42:34,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 30 remaining) [2025-02-06 13:42:34,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 30 remaining) [2025-02-06 13:42:34,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 30 remaining) [2025-02-06 13:42:34,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 30 remaining) [2025-02-06 13:42:34,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 30 remaining) [2025-02-06 13:42:34,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 30 remaining) [2025-02-06 13:42:34,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 30 remaining) [2025-02-06 13:42:34,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 30 remaining) [2025-02-06 13:42:34,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 30 remaining) [2025-02-06 13:42:34,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 30 remaining) [2025-02-06 13:42:34,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 30 remaining) [2025-02-06 13:42:34,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 30 remaining) [2025-02-06 13:42:34,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 30 remaining) [2025-02-06 13:42:34,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 30 remaining) [2025-02-06 13:42:34,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 30 remaining) [2025-02-06 13:42:34,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 13:42:34,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 13:42:34,299 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:42:34,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 13:42:35,589 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 13:42:35,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:42:35 BoogieIcfgContainer [2025-02-06 13:42:35,608 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 13:42:35,609 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 13:42:35,609 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 13:42:35,609 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 13:42:35,609 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:42:25" (3/4) ... [2025-02-06 13:42:35,611 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 13:42:35,616 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-02-06 13:42:35,619 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-06 13:42:35,620 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 13:42:35,620 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 13:42:35,620 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 13:42:35,698 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 13:42:35,698 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 13:42:35,698 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 13:42:35,699 INFO L158 Benchmark]: Toolchain (without parser) took 10385.64ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 134.1MB in the beginning and 210.3MB in the end (delta: -76.2MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. [2025-02-06 13:42:35,699 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:42:35,700 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.96ms. Allocated memory is still 167.8MB. Free memory was 134.1MB in the beginning and 122.5MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:42:35,700 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.03ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 121.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:42:35,700 INFO L158 Benchmark]: Boogie Preprocessor took 38.42ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 119.7MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:42:35,700 INFO L158 Benchmark]: IcfgBuilder took 399.51ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 101.4MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 13:42:35,700 INFO L158 Benchmark]: TraceAbstraction took 9614.28ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 100.7MB in the beginning and 217.1MB in the end (delta: -116.4MB). Peak memory consumption was 140.3MB. Max. memory is 16.1GB. [2025-02-06 13:42:35,701 INFO L158 Benchmark]: Witness Printer took 89.92ms. Allocated memory is still 293.6MB. Free memory was 217.1MB in the beginning and 210.3MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:42:35,702 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.96ms. Allocated memory is still 167.8MB. Free memory was 134.1MB in the beginning and 122.5MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.03ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 121.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.42ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 119.7MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 399.51ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 101.4MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9614.28ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 100.7MB in the beginning and 217.1MB in the end (delta: -116.4MB). Peak memory consumption was 140.3MB. Max. memory is 16.1GB. * Witness Printer took 89.92ms. Allocated memory is still 293.6MB. Free memory was 217.1MB in the beginning and 210.3MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 76]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 76]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 16, TraceHistogramMax: 36, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2123 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2013 mSDsluCounter, 4005 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2530 mSDsCounter, 736 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1503 IncrementalHoareTripleChecker+Invalid, 2239 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 736 mSolverCounterUnsat, 1475 mSDtfsCounter, 1503 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2072 GetRequests, 1967 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1453occurred in iteration=14, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 1460 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2696 NumberOfCodeBlocks, 2220 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 3590 ConstructedInterpolants, 0 QuantifiedInterpolants, 6627 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1525 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 27 InterpolantComputations, 11 PerfectInterpolantSequences, 21829/22866 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold - InvariantResult [Line: 47]: Location Invariant Derived location invariant: ((((((urilen <= 1000000) && (0 <= ((long long) urilen + 1000000))) && (0 <= ((long long) 1000000 + tokenlen))) && (0 <= cp)) && (cp <= 999999)) && (tokenlen <= 1000000)) - InvariantResult [Line: 65]: Location Invariant Derived location invariant: ((((((((c == 0) && (urilen <= 1000000)) && (0 <= ((long long) urilen + 1000000))) && (0 <= ((long long) 1000000 + tokenlen))) && (0 <= cp)) && (cp <= 2147483646)) && (tokenlen <= 1000000)) || ((((((((urilen <= 1000000) && (0 <= ((long long) urilen + 1000000))) && (1 <= c)) && (0 <= ((long long) 1000000 + tokenlen))) && (0 <= cp)) && (cp <= 2147483646)) && (c <= 2147483642)) && (tokenlen <= 1000000))) RESULT: Ultimate proved your program to be correct! [2025-02-06 13:42:35,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE