./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/insertionsort-alloca-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash de7da20d4eaaa585438f85709f7fd309a77ec10ab7307dad72c7fb2392cc347c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:39:40,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:39:40,208 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-06 13:39:40,216 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:39:40,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:39:40,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:39:40,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:39:40,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:39:40,242 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:39:40,242 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:39:40,242 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:39:40,243 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:39:40,243 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:39:40,243 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:39:40,243 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:39:40,243 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:39:40,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 13:39:40,243 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:39:40,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:39:40,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 13:39:40,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:39:40,244 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 13:39:40,244 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 13:39:40,244 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:39:40,244 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 13:39:40,244 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:39:40,244 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:39:40,244 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:39:40,244 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:39:40,244 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:39:40,244 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:39:40,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:39:40,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:39:40,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:39:40,245 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 13:39:40,245 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 13:39:40,245 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:39:40,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:39:40,245 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:39:40,245 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:39:40,245 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:39:40,246 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:39:40,246 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de7da20d4eaaa585438f85709f7fd309a77ec10ab7307dad72c7fb2392cc347c [2025-02-06 13:39:40,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:39:40,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:39:40,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:39:40,477 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:39:40,478 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:39:40,478 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i [2025-02-06 13:39:41,675 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f75991a2a/1c6543b3d16f46b3bfeedd54d781a683/FLAG81936f970 [2025-02-06 13:39:42,053 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:39:42,054 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i [2025-02-06 13:39:42,066 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f75991a2a/1c6543b3d16f46b3bfeedd54d781a683/FLAG81936f970 [2025-02-06 13:39:42,298 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f75991a2a/1c6543b3d16f46b3bfeedd54d781a683 [2025-02-06 13:39:42,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:39:42,302 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:39:42,303 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:39:42,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:39:42,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:39:42,307 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:39:42" (1/1) ... [2025-02-06 13:39:42,307 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e571aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:39:42, skipping insertion in model container [2025-02-06 13:39:42,307 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:39:42" (1/1) ... [2025-02-06 13:39:42,324 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:39:42,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:39:42,474 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:39:42,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:39:42,515 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:39:42,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:39:42 WrapperNode [2025-02-06 13:39:42,516 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:39:42,516 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:39:42,517 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:39:42,517 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:39:42,521 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:39:42" (1/1) ... [2025-02-06 13:39:42,529 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:39:42" (1/1) ... [2025-02-06 13:39:42,540 INFO L138 Inliner]: procedures = 111, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2025-02-06 13:39:42,541 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:39:42,541 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:39:42,541 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:39:42,542 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:39:42,547 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:39:42" (1/1) ... [2025-02-06 13:39:42,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:39:42" (1/1) ... [2025-02-06 13:39:42,548 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:39:42" (1/1) ... [2025-02-06 13:39:42,560 INFO L175 MemorySlicer]: Split 5 memory accesses to 1 slices as follows [5]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2025-02-06 13:39:42,561 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:39:42" (1/1) ... [2025-02-06 13:39:42,561 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:39:42" (1/1) ... [2025-02-06 13:39:42,564 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:39:42" (1/1) ... [2025-02-06 13:39:42,567 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:39:42" (1/1) ... [2025-02-06 13:39:42,568 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:39:42" (1/1) ... [2025-02-06 13:39:42,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:39:42" (1/1) ... [2025-02-06 13:39:42,574 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:39:42,575 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:39:42,575 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:39:42,575 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:39:42,575 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:39:42" (1/1) ... [2025-02-06 13:39:42,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:39:42,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:39:42,613 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:39:42,619 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:39:42,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 13:39:42,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 13:39:42,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 13:39:42,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 13:39:42,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:39:42,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:39:42,703 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:39:42,705 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:39:42,801 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L563: call ULTIMATE.dealloc(main_#t~malloc9#1.base, main_#t~malloc9#1.offset);havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset; [2025-02-06 13:39:42,807 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-02-06 13:39:42,808 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:39:42,814 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:39:42,814 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:39:42,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:39:42 BoogieIcfgContainer [2025-02-06 13:39:42,815 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:39:42,817 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:39:42,817 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:39:42,820 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:39:42,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:39:42" (1/3) ... [2025-02-06 13:39:42,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436ed4f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:39:42, skipping insertion in model container [2025-02-06 13:39:42,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:39:42" (2/3) ... [2025-02-06 13:39:42,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436ed4f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:39:42, skipping insertion in model container [2025-02-06 13:39:42,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:39:42" (3/3) ... [2025-02-06 13:39:42,822 INFO L128 eAbstractionObserver]: Analyzing ICFG insertionsort-alloca-2.i [2025-02-06 13:39:42,833 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:39:42,834 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG insertionsort-alloca-2.i that has 1 procedures, 29 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-02-06 13:39:42,868 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:39:42,877 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;@62a99df9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:39:42,877 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 13:39:42,880 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.65) internal successors, (33), 28 states have internal predecessors, (33), 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:39:42,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 13:39:42,884 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:39:42,884 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:39:42,885 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:39:42,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:39:42,889 INFO L85 PathProgramCache]: Analyzing trace with hash -907455780, now seen corresponding path program 1 times [2025-02-06 13:39:42,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:39:42,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096909452] [2025-02-06 13:39:42,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:39:42,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:39:42,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 13:39:42,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 13:39:42,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:39:42,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:39:43,087 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:39:43,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:39:43,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096909452] [2025-02-06 13:39:43,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096909452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:39:43,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:39:43,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:39:43,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682281780] [2025-02-06 13:39:43,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:39:43,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:39:43,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:39:43,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:39:43,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:39:43,108 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.65) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:39:43,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:39:43,187 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2025-02-06 13:39:43,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:39:43,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 13:39:43,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:39:43,196 INFO L225 Difference]: With dead ends: 61 [2025-02-06 13:39:43,196 INFO L226 Difference]: Without dead ends: 32 [2025-02-06 13:39:43,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:39:43,200 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 38 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:39:43,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 37 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:39:43,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-06 13:39:43,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2025-02-06 13:39:43,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.565217391304348) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:39:43,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2025-02-06 13:39:43,227 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 8 [2025-02-06 13:39:43,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:39:43,228 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-02-06 13:39:43,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:39:43,228 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2025-02-06 13:39:43,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 13:39:43,229 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:39:43,229 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:39:43,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:39:43,230 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:39:43,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:39:43,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1933641881, now seen corresponding path program 1 times [2025-02-06 13:39:43,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:39:43,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14166512] [2025-02-06 13:39:43,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:39:43,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:39:43,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 13:39:43,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 13:39:43,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:39:43,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:39:43,307 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:39:43,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:39:43,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14166512] [2025-02-06 13:39:43,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14166512] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:39:43,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:39:43,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:39:43,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216227715] [2025-02-06 13:39:43,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:39:43,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:39:43,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:39:43,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:39:43,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:39:43,310 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:39:43,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:39:43,349 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2025-02-06 13:39:43,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:39:43,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2025-02-06 13:39:43,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:39:43,350 INFO L225 Difference]: With dead ends: 60 [2025-02-06 13:39:43,350 INFO L226 Difference]: Without dead ends: 57 [2025-02-06 13:39:43,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:39:43,351 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 35 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:39:43,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 52 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:39:43,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-06 13:39:43,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2025-02-06 13:39:43,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 49 states have internal predecessors, (66), 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:39:43,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2025-02-06 13:39:43,356 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 9 [2025-02-06 13:39:43,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:39:43,356 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2025-02-06 13:39:43,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:39:43,356 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2025-02-06 13:39:43,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 13:39:43,357 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:39:43,357 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:39:43,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:39:43,357 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:39:43,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:39:43,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1490191560, now seen corresponding path program 1 times [2025-02-06 13:39:43,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:39:43,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065160625] [2025-02-06 13:39:43,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:39:43,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:39:43,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 13:39:43,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 13:39:43,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:39:43,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:39:43,391 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:39:43,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:39:43,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065160625] [2025-02-06 13:39:43,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065160625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:39:43,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:39:43,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:39:43,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827269462] [2025-02-06 13:39:43,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:39:43,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:39:43,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:39:43,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:39:43,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:39:43,392 INFO L87 Difference]: Start difference. First operand 50 states and 66 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:39:43,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:39:43,404 INFO L93 Difference]: Finished difference Result 94 states and 127 transitions. [2025-02-06 13:39:43,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:39:43,405 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:39:43,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:39:43,406 INFO L225 Difference]: With dead ends: 94 [2025-02-06 13:39:43,406 INFO L226 Difference]: Without dead ends: 54 [2025-02-06 13:39:43,407 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:39:43,407 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:39:43,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:39:43,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-06 13:39:43,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2025-02-06 13:39:43,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 45 states have (on average 1.511111111111111) internal successors, (68), 51 states have internal predecessors, (68), 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:39:43,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 68 transitions. [2025-02-06 13:39:43,412 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 68 transitions. Word has length 11 [2025-02-06 13:39:43,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:39:43,412 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 68 transitions. [2025-02-06 13:39:43,413 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:39:43,413 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 68 transitions. [2025-02-06 13:39:43,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 13:39:43,413 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:39:43,413 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:39:43,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:39:43,413 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:39:43,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:39:43,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1675817173, now seen corresponding path program 1 times [2025-02-06 13:39:43,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:39:43,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112620845] [2025-02-06 13:39:43,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:39:43,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:39:43,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 13:39:43,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 13:39:43,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:39:43,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:39:43,551 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:39:43,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:39:43,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112620845] [2025-02-06 13:39:43,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112620845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:39:43,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:39:43,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:39:43,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574478359] [2025-02-06 13:39:43,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:39:43,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:39:43,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:39:43,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:39:43,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:39:43,553 INFO L87 Difference]: Start difference. First operand 52 states and 68 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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:39:43,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:39:43,649 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2025-02-06 13:39:43,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:39:43,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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:39:43,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:39:43,650 INFO L225 Difference]: With dead ends: 64 [2025-02-06 13:39:43,650 INFO L226 Difference]: Without dead ends: 62 [2025-02-06 13:39:43,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:39:43,651 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 35 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:39:43,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 74 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:39:43,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-06 13:39:43,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2025-02-06 13:39:43,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 53 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:39:43,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2025-02-06 13:39:43,657 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 13 [2025-02-06 13:39:43,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:39:43,657 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2025-02-06 13:39:43,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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:39:43,657 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2025-02-06 13:39:43,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 13:39:43,658 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:39:43,658 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:39:43,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 13:39:43,658 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:39:43,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:39:43,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1330170313, now seen corresponding path program 1 times [2025-02-06 13:39:43,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:39:43,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849548065] [2025-02-06 13:39:43,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:39:43,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:39:43,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 13:39:43,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 13:39:43,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:39:43,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:39:43,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:39:43,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:39:43,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849548065] [2025-02-06 13:39:43,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849548065] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:39:43,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:39:43,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:39:43,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176517944] [2025-02-06 13:39:43,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:39:43,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:39:43,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:39:43,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:39:43,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:39:43,754 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:39:43,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:39:43,811 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2025-02-06 13:39:43,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:39:43,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-06 13:39:43,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:39:43,812 INFO L225 Difference]: With dead ends: 88 [2025-02-06 13:39:43,812 INFO L226 Difference]: Without dead ends: 57 [2025-02-06 13:39:43,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:39:43,813 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 36 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:39:43,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 43 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:39:43,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-06 13:39:43,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2025-02-06 13:39:43,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.446808510638298) internal successors, (68), 53 states have internal predecessors, (68), 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:39:43,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2025-02-06 13:39:43,817 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 16 [2025-02-06 13:39:43,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:39:43,817 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2025-02-06 13:39:43,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:39:43,817 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2025-02-06 13:39:43,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 13:39:43,817 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:39:43,817 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:39:43,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:39:43,818 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:39:43,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:39:43,818 INFO L85 PathProgramCache]: Analyzing trace with hash -459612445, now seen corresponding path program 1 times [2025-02-06 13:39:43,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:39:43,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652921726] [2025-02-06 13:39:43,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:39:43,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:39:43,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 13:39:43,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 13:39:43,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:39:43,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:39:43,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:39:43,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:39:43,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652921726] [2025-02-06 13:39:43,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652921726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:39:43,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:39:43,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:39:43,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816171416] [2025-02-06 13:39:43,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:39:43,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:39:43,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:39:43,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:39:43,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:39:43,882 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:39:43,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:39:43,912 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2025-02-06 13:39:43,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:39:43,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-06 13:39:43,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:39:43,913 INFO L225 Difference]: With dead ends: 56 [2025-02-06 13:39:43,913 INFO L226 Difference]: Without dead ends: 54 [2025-02-06 13:39:43,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:39:43,914 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:39:43,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 26 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:39:43,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-06 13:39:43,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2025-02-06 13:39:43,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 47 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:39:43,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2025-02-06 13:39:43,922 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 17 [2025-02-06 13:39:43,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:39:43,922 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2025-02-06 13:39:43,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:39:43,922 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2025-02-06 13:39:43,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 13:39:43,922 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:39:43,923 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:39:43,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:39:43,923 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:39:43,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:39:43,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1363083918, now seen corresponding path program 1 times [2025-02-06 13:39:43,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:39:43,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676826196] [2025-02-06 13:39:43,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:39:43,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:39:43,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 13:39:43,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 13:39:43,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:39:43,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:39:43,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:39:43,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:39:43,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676826196] [2025-02-06 13:39:43,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676826196] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:39:43,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:39:43,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:39:43,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862351718] [2025-02-06 13:39:43,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:39:43,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:39:43,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:39:43,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:39:43,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:39:43,957 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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:39:43,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:39:43,977 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2025-02-06 13:39:43,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:39:43,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2025-02-06 13:39:43,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:39:43,978 INFO L225 Difference]: With dead ends: 57 [2025-02-06 13:39:43,978 INFO L226 Difference]: Without dead ends: 55 [2025-02-06 13:39:43,978 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:39:43,979 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 5 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:39:43,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 41 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:39:43,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-06 13:39:43,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2025-02-06 13:39:43,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 52 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:39:43,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2025-02-06 13:39:43,986 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 18 [2025-02-06 13:39:43,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:39:43,989 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2025-02-06 13:39:43,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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:39:43,990 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2025-02-06 13:39:43,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 13:39:43,990 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:39:43,990 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:39:43,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 13:39:43,990 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:39:43,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:39:43,991 INFO L85 PathProgramCache]: Analyzing trace with hash -291680692, now seen corresponding path program 1 times [2025-02-06 13:39:43,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:39:43,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476777393] [2025-02-06 13:39:43,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:39:43,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:39:44,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 13:39:44,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 13:39:44,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:39:44,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:39:44,054 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:39:44,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:39:44,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476777393] [2025-02-06 13:39:44,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476777393] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:39:44,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852873856] [2025-02-06 13:39:44,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:39:44,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:39:44,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:39:44,056 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:39:44,060 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:39:44,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 13:39:44,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 13:39:44,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:39:44,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:39:44,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:39:44,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:39:44,140 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 13:39:44,140 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:39:44,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852873856] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:39:44,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:39:44,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-02-06 13:39:44,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745246639] [2025-02-06 13:39:44,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:39:44,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:39:44,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:39:44,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:39:44,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:39:44,141 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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:39:44,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:39:44,153 INFO L93 Difference]: Finished difference Result 103 states and 120 transitions. [2025-02-06 13:39:44,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:39:44,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 18 [2025-02-06 13:39:44,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:39:44,154 INFO L225 Difference]: With dead ends: 103 [2025-02-06 13:39:44,154 INFO L226 Difference]: Without dead ends: 53 [2025-02-06 13:39:44,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:39:44,155 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:39:44,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:39:44,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-06 13:39:44,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-02-06 13:39:44,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 52 states have internal predecessors, (61), 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:39:44,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2025-02-06 13:39:44,159 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 18 [2025-02-06 13:39:44,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:39:44,159 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2025-02-06 13:39:44,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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:39:44,159 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2025-02-06 13:39:44,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 13:39:44,160 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:39:44,160 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:39:44,171 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:39:44,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:39:44,364 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:39:44,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:39:44,365 INFO L85 PathProgramCache]: Analyzing trace with hash -802214869, now seen corresponding path program 1 times [2025-02-06 13:39:44,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:39:44,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577689516] [2025-02-06 13:39:44,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:39:44,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:39:44,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 13:39:44,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 13:39:44,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:39:44,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:39:44,442 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:39:44,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:39:44,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577689516] [2025-02-06 13:39:44,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577689516] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:39:44,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343692524] [2025-02-06 13:39:44,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:39:44,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:39:44,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:39:44,448 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:39:44,449 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:39:44,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 13:39:44,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 13:39:44,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:39:44,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:39:44,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:39:44,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:39:44,609 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:39:44,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:39:44,677 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:39:44,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343692524] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:39:44,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:39:44,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-02-06 13:39:44,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518189998] [2025-02-06 13:39:44,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:39:44,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 13:39:44,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:39:44,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 13:39:44,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-06 13:39:44,679 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 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:39:44,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:39:44,782 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2025-02-06 13:39:44,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:39:44,782 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 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 18 [2025-02-06 13:39:44,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:39:44,783 INFO L225 Difference]: With dead ends: 81 [2025-02-06 13:39:44,783 INFO L226 Difference]: Without dead ends: 78 [2025-02-06 13:39:44,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-06 13:39:44,783 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 100 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:39:44,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 58 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:39:44,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-06 13:39:44,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 62. [2025-02-06 13:39:44,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 61 states have internal predecessors, (73), 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:39:44,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2025-02-06 13:39:44,788 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 18 [2025-02-06 13:39:44,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:39:44,788 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2025-02-06 13:39:44,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 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:39:44,788 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2025-02-06 13:39:44,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 13:39:44,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:39:44,789 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:39:44,795 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:39:44,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:39:44,993 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:39:44,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:39:44,993 INFO L85 PathProgramCache]: Analyzing trace with hash 702326669, now seen corresponding path program 1 times [2025-02-06 13:39:44,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:39:44,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382408022] [2025-02-06 13:39:44,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:39:44,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:39:45,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 13:39:45,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 13:39:45,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:39:45,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:39:45,055 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:39:45,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:39:45,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382408022] [2025-02-06 13:39:45,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382408022] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:39:45,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:39:45,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:39:45,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412066925] [2025-02-06 13:39:45,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:39:45,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:39:45,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:39:45,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:39:45,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:39:45,057 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:39:45,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:39:45,077 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2025-02-06 13:39:45,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:39:45,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-06 13:39:45,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:39:45,078 INFO L225 Difference]: With dead ends: 65 [2025-02-06 13:39:45,078 INFO L226 Difference]: Without dead ends: 64 [2025-02-06 13:39:45,079 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:39:45,079 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:39:45,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 36 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:39:45,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-06 13:39:45,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2025-02-06 13:39:45,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 60 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:39:45,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2025-02-06 13:39:45,085 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 22 [2025-02-06 13:39:45,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:39:45,085 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2025-02-06 13:39:45,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:39:45,085 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2025-02-06 13:39:45,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 13:39:45,085 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:39:45,085 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:39:45,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 13:39:45,085 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:39:45,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:39:45,086 INFO L85 PathProgramCache]: Analyzing trace with hash 297290238, now seen corresponding path program 1 times [2025-02-06 13:39:45,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:39:45,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605794909] [2025-02-06 13:39:45,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:39:45,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:39:45,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 13:39:45,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 13:39:45,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:39:45,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:39:45,122 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 13:39:45,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:39:45,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605794909] [2025-02-06 13:39:45,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605794909] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:39:45,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:39:45,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:39:45,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562483043] [2025-02-06 13:39:45,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:39:45,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:39:45,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:39:45,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:39:45,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:39:45,123 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:39:45,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:39:45,141 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2025-02-06 13:39:45,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:39:45,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-06 13:39:45,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:39:45,142 INFO L225 Difference]: With dead ends: 65 [2025-02-06 13:39:45,143 INFO L226 Difference]: Without dead ends: 64 [2025-02-06 13:39:45,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:39:45,143 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:39:45,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 38 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:39:45,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-06 13:39:45,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2025-02-06 13:39:45,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 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:39:45,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2025-02-06 13:39:45,147 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 23 [2025-02-06 13:39:45,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:39:45,147 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2025-02-06 13:39:45,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:39:45,148 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2025-02-06 13:39:45,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 13:39:45,148 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:39:45,148 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-02-06 13:39:45,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 13:39:45,148 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 13:39:45,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:39:45,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1615804398, now seen corresponding path program 1 times [2025-02-06 13:39:45,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:39:45,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78492540] [2025-02-06 13:39:45,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:39:45,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:39:45,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 13:39:45,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 13:39:45,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:39:45,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:39:45,230 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 13:39:45,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:39:45,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78492540] [2025-02-06 13:39:45,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78492540] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:39:45,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317944672] [2025-02-06 13:39:45,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:39:45,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:39:45,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:39:45,233 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:39:45,237 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:39:45,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 13:39:45,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 13:39:45,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:39:45,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:39:45,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 13:39:45,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:39:45,375 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:39:45,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:39:45,430 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:39:45,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317944672] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:39:45,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:39:45,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-06 13:39:45,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944810077] [2025-02-06 13:39:45,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:39:45,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 13:39:45,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:39:45,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 13:39:45,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-02-06 13:39:45,432 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 10 states, 9 states have (on average 8.0) internal successors, (72), 10 states have internal predecessors, (72), 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:39:45,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:39:45,516 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2025-02-06 13:39:45,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:39:45,520 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.0) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-02-06 13:39:45,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:39:45,521 INFO L225 Difference]: With dead ends: 102 [2025-02-06 13:39:45,521 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 13:39:45,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2025-02-06 13:39:45,521 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 78 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:39:45,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 99 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:39:45,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 13:39:45,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 13:39:45,522 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:39:45,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 13:39:45,522 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2025-02-06 13:39:45,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:39:45,523 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 13:39:45,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.0) internal successors, (72), 10 states have internal predecessors, (72), 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:39:45,523 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 13:39:45,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 13:39:45,525 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-02-06 13:39:45,526 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-02-06 13:39:45,526 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-02-06 13:39:45,526 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-02-06 13:39:45,526 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-02-06 13:39:45,526 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-02-06 13:39:45,526 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-02-06 13:39:45,526 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-02-06 13:39:45,535 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:39:45,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:39:45,730 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:39:45,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 13:39:45,859 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 13:39:45,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:39:45 BoogieIcfgContainer [2025-02-06 13:39:45,869 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 13:39:45,869 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 13:39:45,869 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 13:39:45,870 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 13:39:45,870 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:39:42" (3/4) ... [2025-02-06 13:39:45,872 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 13:39:45,879 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-02-06 13:39:45,879 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 13:39:45,879 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-06 13:39:45,879 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 13:39:45,935 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 13:39:45,936 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 13:39:45,936 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 13:39:45,936 INFO L158 Benchmark]: Toolchain (without parser) took 3634.98ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 105.8MB in the beginning and 264.2MB in the end (delta: -158.4MB). Peak memory consumption was 81.6MB. Max. memory is 16.1GB. [2025-02-06 13:39:45,937 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:39:45,937 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.31ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 89.5MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 13:39:45,937 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.53ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 88.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:39:45,937 INFO L158 Benchmark]: Boogie Preprocessor took 32.44ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 86.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:39:45,937 INFO L158 Benchmark]: IcfgBuilder took 240.44ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 74.5MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 13:39:45,938 INFO L158 Benchmark]: TraceAbstraction took 3052.20ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 74.1MB in the beginning and 269.8MB in the end (delta: -195.7MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. [2025-02-06 13:39:45,938 INFO L158 Benchmark]: Witness Printer took 66.61ms. Allocated memory is still 385.9MB. Free memory was 269.8MB in the beginning and 264.2MB in the end (delta: 5.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:39:45,939 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.22ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.31ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 89.5MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.53ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 88.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.44ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 86.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 240.44ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 74.5MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3052.20ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 74.1MB in the beginning and 269.8MB in the end (delta: -195.7MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. * Witness Printer took 66.61ms. Allocated memory is still 385.9MB. Free memory was 269.8MB in the beginning and 264.2MB in the end (delta: 5.6MB). There was no memory consumed. 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: 550]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 550]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 554]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 554]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 345 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 345 mSDsluCounter, 615 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 393 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 348 IncrementalHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 222 mSDtfsCounter, 348 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=9, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 60 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 271 NumberOfCodeBlocks, 271 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 303 ConstructedInterpolants, 0 QuantifiedInterpolants, 675 SizeOfPredicates, 3 NumberOfNonLiveVariables, 237 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 17 InterpolantComputations, 10 PerfectInterpolantSequences, 43/133 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 8 specifications checked. All of them hold - InvariantResult [Line: 553]: Location Invariant Derived location invariant: ((((1 <= i) && (i <= 2147483646)) && (array_size <= 2147483647)) && (j <= 2147483648)) - InvariantResult [Line: 550]: Location Invariant Derived location invariant: (((1 <= i) && (array_size <= 2147483647)) && (i <= 2147483647)) RESULT: Ultimate proved your program to be correct! [2025-02-06 13:39:45,951 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