./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 95f89ee6bcff8f17eb3e93b344abecdfb8ddea0894d1b25afafccf6235d7ced6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:23:32,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:23:32,816 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 01:23:32,822 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:23:32,825 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:23:32,860 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:23:32,861 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:23:32,861 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:23:32,861 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:23:32,861 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:23:32,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:23:32,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:23:32,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:23:32,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:23:32,862 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:23:32,862 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:23:32,862 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:23:32,862 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:23:32,862 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:23:32,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:23:32,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:23:32,862 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:23:32,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:23:32,862 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:23:32,862 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:23:32,868 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:23:32,868 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:23:32,868 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:23:32,868 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:23:32,868 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:23:32,868 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:23:32,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:23:32,868 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:23:32,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:23:32,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:23:32,868 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:23:32,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:23:32,868 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:23:32,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:23:32,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:23:32,868 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:23:32,868 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:23:32,868 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:23:32,868 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:23:32,869 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:23:32,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:23:32,869 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:23:32,869 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:23:32,869 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:23:32,869 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:23:32,869 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 95f89ee6bcff8f17eb3e93b344abecdfb8ddea0894d1b25afafccf6235d7ced6 [2025-01-10 01:23:33,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:23:33,145 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:23:33,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:23:33,149 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:23:33,149 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:23:33,151 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c [2025-01-10 01:23:34,634 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4eff4d3d1/b3525452bfa547a89e2e7bc86506e573/FLAG98c13ddc7 [2025-01-10 01:23:34,902 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:23:34,905 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c [2025-01-10 01:23:34,917 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4eff4d3d1/b3525452bfa547a89e2e7bc86506e573/FLAG98c13ddc7 [2025-01-10 01:23:35,227 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4eff4d3d1/b3525452bfa547a89e2e7bc86506e573 [2025-01-10 01:23:35,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:23:35,236 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:23:35,241 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:23:35,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:23:35,246 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:23:35,250 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:23:35" (1/1) ... [2025-01-10 01:23:35,251 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf0269b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:35, skipping insertion in model container [2025-01-10 01:23:35,251 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:23:35" (1/1) ... [2025-01-10 01:23:35,272 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:23:35,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:23:35,444 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:23:35,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:23:35,503 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:23:35,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:35 WrapperNode [2025-01-10 01:23:35,505 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:23:35,506 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:23:35,506 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:23:35,506 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:23:35,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:35" (1/1) ... [2025-01-10 01:23:35,519 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:35" (1/1) ... [2025-01-10 01:23:35,541 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 166 [2025-01-10 01:23:35,541 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:23:35,542 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:23:35,542 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:23:35,542 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:23:35,553 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:35" (1/1) ... [2025-01-10 01:23:35,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:35" (1/1) ... [2025-01-10 01:23:35,555 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:35" (1/1) ... [2025-01-10 01:23:35,570 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 01:23:35,570 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:35" (1/1) ... [2025-01-10 01:23:35,570 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:35" (1/1) ... [2025-01-10 01:23:35,574 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:35" (1/1) ... [2025-01-10 01:23:35,575 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:35" (1/1) ... [2025-01-10 01:23:35,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:35" (1/1) ... [2025-01-10 01:23:35,578 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:35" (1/1) ... [2025-01-10 01:23:35,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:35" (1/1) ... [2025-01-10 01:23:35,581 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:23:35,581 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:23:35,582 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:23:35,582 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:23:35,583 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:35" (1/1) ... [2025-01-10 01:23:35,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:23:35,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:35,621 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:23:35,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:23:35,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:23:35,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:23:35,644 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-01-10 01:23:35,644 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-01-10 01:23:35,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:23:35,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:23:35,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 01:23:35,644 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 01:23:35,687 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:23:35,689 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:23:35,958 INFO L? ?]: Removed 82 outVars from TransFormulas that were not future-live. [2025-01-10 01:23:35,958 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:23:35,966 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:23:35,966 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 01:23:35,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:23:35 BoogieIcfgContainer [2025-01-10 01:23:35,967 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:23:35,969 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:23:35,969 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:23:35,973 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:23:35,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:23:35" (1/3) ... [2025-01-10 01:23:35,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3797fb1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:23:35, skipping insertion in model container [2025-01-10 01:23:35,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:35" (2/3) ... [2025-01-10 01:23:35,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3797fb1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:23:35, skipping insertion in model container [2025-01-10 01:23:35,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:23:35" (3/3) ... [2025-01-10 01:23:35,975 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_3a.c.cil.c [2025-01-10 01:23:35,986 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:23:35,987 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_3a.c.cil.c that has 3 procedures, 108 locations, 1 initial locations, 2 loop locations, and 18 error locations. [2025-01-10 01:23:36,043 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:23:36,055 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;@71c70d60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:23:36,055 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-01-10 01:23:36,059 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 82 states have (on average 1.6219512195121952) internal successors, (133), 101 states have internal predecessors, (133), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 01:23:36,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:23:36,064 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:36,064 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:36,065 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:23:36,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:36,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1467470915, now seen corresponding path program 1 times [2025-01-10 01:23:36,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:36,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028421535] [2025-01-10 01:23:36,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:36,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:36,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:23:36,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:23:36,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:36,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:36,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:36,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:36,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028421535] [2025-01-10 01:23:36,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028421535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:36,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:36,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:23:36,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840619879] [2025-01-10 01:23:36,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:36,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:23:36,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:36,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:23:36,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:23:36,280 INFO L87 Difference]: Start difference. First operand has 108 states, 82 states have (on average 1.6219512195121952) internal successors, (133), 101 states have internal predecessors, (133), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:36,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:36,434 INFO L93 Difference]: Finished difference Result 257 states and 362 transitions. [2025-01-10 01:23:36,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:23:36,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 01:23:36,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:36,442 INFO L225 Difference]: With dead ends: 257 [2025-01-10 01:23:36,442 INFO L226 Difference]: Without dead ends: 129 [2025-01-10 01:23:36,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:23:36,448 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 80 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:36,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 353 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:36,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-01-10 01:23:36,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 119. [2025-01-10 01:23:36,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 99 states have (on average 1.494949494949495) internal successors, (148), 112 states have internal predecessors, (148), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:23:36,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 156 transitions. [2025-01-10 01:23:36,484 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 156 transitions. Word has length 8 [2025-01-10 01:23:36,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:36,484 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 156 transitions. [2025-01-10 01:23:36,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:36,485 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 156 transitions. [2025-01-10 01:23:36,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 01:23:36,485 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:36,486 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:36,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:23:36,486 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:23:36,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:36,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1929771838, now seen corresponding path program 1 times [2025-01-10 01:23:36,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:36,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390628368] [2025-01-10 01:23:36,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:36,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:36,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:23:36,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:23:36,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:36,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:36,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:23:36,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:36,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390628368] [2025-01-10 01:23:36,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390628368] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:36,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:36,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:23:36,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710235704] [2025-01-10 01:23:36,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:36,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:23:36,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:36,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:23:36,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:36,524 INFO L87 Difference]: Start difference. First operand 119 states and 156 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:36,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:36,553 INFO L93 Difference]: Finished difference Result 119 states and 156 transitions. [2025-01-10 01:23:36,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:23:36,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-10 01:23:36,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:36,555 INFO L225 Difference]: With dead ends: 119 [2025-01-10 01:23:36,555 INFO L226 Difference]: Without dead ends: 118 [2025-01-10 01:23:36,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:36,556 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 1 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:36,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 170 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:36,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-01-10 01:23:36,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-01-10 01:23:36,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.4747474747474747) internal successors, (146), 111 states have internal predecessors, (146), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:23:36,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 154 transitions. [2025-01-10 01:23:36,568 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 154 transitions. Word has length 12 [2025-01-10 01:23:36,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:36,568 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 154 transitions. [2025-01-10 01:23:36,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:36,569 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 154 transitions. [2025-01-10 01:23:36,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 01:23:36,569 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:36,569 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:36,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:23:36,569 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:23:36,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:36,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1937063990, now seen corresponding path program 1 times [2025-01-10 01:23:36,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:36,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091017070] [2025-01-10 01:23:36,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:36,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:36,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:23:36,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:23:36,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:36,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:36,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:36,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:36,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091017070] [2025-01-10 01:23:36,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091017070] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:36,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556513232] [2025-01-10 01:23:36,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:36,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:36,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:36,677 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:36,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:23:36,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:23:36,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:23:36,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:36,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:36,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:23:36,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:36,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:36,791 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:23:36,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556513232] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:36,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:23:36,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-10 01:23:36,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036604603] [2025-01-10 01:23:36,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:36,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:23:36,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:36,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:23:36,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:23:36,793 INFO L87 Difference]: Start difference. First operand 118 states and 154 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:36,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:36,868 INFO L93 Difference]: Finished difference Result 153 states and 210 transitions. [2025-01-10 01:23:36,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:23:36,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-10 01:23:36,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:36,869 INFO L225 Difference]: With dead ends: 153 [2025-01-10 01:23:36,869 INFO L226 Difference]: Without dead ends: 151 [2025-01-10 01:23:36,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:23:36,870 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 27 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:36,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 184 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:36,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-01-10 01:23:36,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 126. [2025-01-10 01:23:36,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 107 states have (on average 1.4579439252336448) internal successors, (156), 119 states have internal predecessors, (156), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:23:36,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 164 transitions. [2025-01-10 01:23:36,882 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 164 transitions. Word has length 13 [2025-01-10 01:23:36,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:36,882 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 164 transitions. [2025-01-10 01:23:36,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:36,882 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 164 transitions. [2025-01-10 01:23:36,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 01:23:36,883 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:36,883 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:36,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 01:23:37,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:37,084 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:23:37,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:37,085 INFO L85 PathProgramCache]: Analyzing trace with hash 306615217, now seen corresponding path program 1 times [2025-01-10 01:23:37,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:37,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071877655] [2025-01-10 01:23:37,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:37,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:37,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:23:37,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:23:37,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:37,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:37,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:37,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:37,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071877655] [2025-01-10 01:23:37,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071877655] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:37,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137240947] [2025-01-10 01:23:37,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:37,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:37,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:37,192 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:37,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:23:37,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:23:37,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:23:37,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:37,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:37,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:23:37,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:37,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:37,257 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:23:37,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137240947] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:37,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:23:37,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 01:23:37,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487449905] [2025-01-10 01:23:37,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:37,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:23:37,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:37,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:23:37,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:23:37,259 INFO L87 Difference]: Start difference. First operand 126 states and 164 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:37,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:37,303 INFO L93 Difference]: Finished difference Result 131 states and 171 transitions. [2025-01-10 01:23:37,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:23:37,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-10 01:23:37,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:37,305 INFO L225 Difference]: With dead ends: 131 [2025-01-10 01:23:37,305 INFO L226 Difference]: Without dead ends: 130 [2025-01-10 01:23:37,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:23:37,306 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 13 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:37,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 167 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:37,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-01-10 01:23:37,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2025-01-10 01:23:37,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 108 states have (on average 1.4537037037037037) internal successors, (157), 120 states have internal predecessors, (157), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:23:37,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 165 transitions. [2025-01-10 01:23:37,321 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 165 transitions. Word has length 13 [2025-01-10 01:23:37,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:37,323 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 165 transitions. [2025-01-10 01:23:37,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:37,323 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 165 transitions. [2025-01-10 01:23:37,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 01:23:37,324 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:37,324 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:37,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:23:37,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:37,525 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:23:37,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:37,526 INFO L85 PathProgramCache]: Analyzing trace with hash 80558535, now seen corresponding path program 1 times [2025-01-10 01:23:37,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:37,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946596198] [2025-01-10 01:23:37,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:37,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:37,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:23:37,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:23:37,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:37,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:37,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:23:37,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:37,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946596198] [2025-01-10 01:23:37,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946596198] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:37,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:37,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:23:37,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345550707] [2025-01-10 01:23:37,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:37,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:23:37,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:37,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:23:37,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:37,552 INFO L87 Difference]: Start difference. First operand 127 states and 165 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:37,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:37,576 INFO L93 Difference]: Finished difference Result 127 states and 165 transitions. [2025-01-10 01:23:37,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:23:37,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-10 01:23:37,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:37,577 INFO L225 Difference]: With dead ends: 127 [2025-01-10 01:23:37,577 INFO L226 Difference]: Without dead ends: 126 [2025-01-10 01:23:37,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:37,578 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 169 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-01-10 01:23:37,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:37,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-01-10 01:23:37,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2025-01-10 01:23:37,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 106 states have (on average 1.4433962264150944) internal successors, (153), 117 states have internal predecessors, (153), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:23:37,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 161 transitions. [2025-01-10 01:23:37,584 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 161 transitions. Word has length 14 [2025-01-10 01:23:37,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:37,584 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 161 transitions. [2025-01-10 01:23:37,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:37,584 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 161 transitions. [2025-01-10 01:23:37,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 01:23:37,585 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:37,585 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:37,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:23:37,585 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:23:37,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:37,585 INFO L85 PathProgramCache]: Analyzing trace with hash 918223534, now seen corresponding path program 1 times [2025-01-10 01:23:37,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:37,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114191206] [2025-01-10 01:23:37,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:37,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:37,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:23:37,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:23:37,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:37,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:37,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:37,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:37,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114191206] [2025-01-10 01:23:37,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114191206] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:37,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:37,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:23:37,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115913383] [2025-01-10 01:23:37,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:37,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:23:37,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:37,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:23:37,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:37,634 INFO L87 Difference]: Start difference. First operand 124 states and 161 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:37,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:37,664 INFO L93 Difference]: Finished difference Result 257 states and 340 transitions. [2025-01-10 01:23:37,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:23:37,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-10 01:23:37,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:37,667 INFO L225 Difference]: With dead ends: 257 [2025-01-10 01:23:37,667 INFO L226 Difference]: Without dead ends: 136 [2025-01-10 01:23:37,668 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-01-10 01:23:37,670 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 10 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:37,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 170 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:37,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-01-10 01:23:37,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 126. [2025-01-10 01:23:37,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 119 states have internal predecessors, (153), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:23:37,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 161 transitions. [2025-01-10 01:23:37,683 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 161 transitions. Word has length 14 [2025-01-10 01:23:37,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:37,683 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 161 transitions. [2025-01-10 01:23:37,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:37,684 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 161 transitions. [2025-01-10 01:23:37,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 01:23:37,684 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:37,684 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:37,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:23:37,684 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:23:37,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:37,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1795489802, now seen corresponding path program 1 times [2025-01-10 01:23:37,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:37,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890222906] [2025-01-10 01:23:37,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:37,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:37,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:23:37,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:23:37,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:37,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:37,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:37,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:37,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890222906] [2025-01-10 01:23:37,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890222906] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:37,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743042484] [2025-01-10 01:23:37,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:37,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:37,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:37,752 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:37,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:23:37,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:23:37,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:23:37,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:37,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:37,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:23:37,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:37,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:37,814 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:23:37,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743042484] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:37,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:23:37,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-10 01:23:37,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465637524] [2025-01-10 01:23:37,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:37,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:23:37,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:37,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:23:37,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:23:37,816 INFO L87 Difference]: Start difference. First operand 126 states and 161 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:37,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:37,850 INFO L93 Difference]: Finished difference Result 143 states and 185 transitions. [2025-01-10 01:23:37,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:23:37,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-10 01:23:37,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:37,852 INFO L225 Difference]: With dead ends: 143 [2025-01-10 01:23:37,852 INFO L226 Difference]: Without dead ends: 142 [2025-01-10 01:23:37,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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-01-10 01:23:37,853 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 8 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:37,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 181 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:37,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-01-10 01:23:37,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 136. [2025-01-10 01:23:37,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 118 states have (on average 1.3983050847457628) internal successors, (165), 129 states have internal predecessors, (165), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:23:37,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 173 transitions. [2025-01-10 01:23:37,864 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 173 transitions. Word has length 15 [2025-01-10 01:23:37,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:37,864 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 173 transitions. [2025-01-10 01:23:37,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:37,864 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 173 transitions. [2025-01-10 01:23:37,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 01:23:37,865 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:37,865 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:37,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:23:38,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:38,069 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:23:38,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:38,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1598145314, now seen corresponding path program 1 times [2025-01-10 01:23:38,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:38,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930161607] [2025-01-10 01:23:38,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:38,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:38,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:23:38,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:23:38,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:38,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:38,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:38,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:38,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930161607] [2025-01-10 01:23:38,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930161607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:38,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:38,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:23:38,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166557519] [2025-01-10 01:23:38,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:38,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:23:38,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:38,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:23:38,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:23:38,132 INFO L87 Difference]: Start difference. First operand 136 states and 173 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:38,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:38,207 INFO L93 Difference]: Finished difference Result 148 states and 187 transitions. [2025-01-10 01:23:38,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:23:38,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-10 01:23:38,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:38,208 INFO L225 Difference]: With dead ends: 148 [2025-01-10 01:23:38,209 INFO L226 Difference]: Without dead ends: 147 [2025-01-10 01:23:38,209 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-01-10 01:23:38,209 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 83 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:38,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 323 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:38,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-01-10 01:23:38,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 131. [2025-01-10 01:23:38,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 113 states have (on average 1.3982300884955752) internal successors, (158), 124 states have internal predecessors, (158), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:23:38,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 166 transitions. [2025-01-10 01:23:38,216 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 166 transitions. Word has length 15 [2025-01-10 01:23:38,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:38,216 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 166 transitions. [2025-01-10 01:23:38,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:38,217 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 166 transitions. [2025-01-10 01:23:38,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 01:23:38,217 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:38,217 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:38,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:23:38,218 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:23:38,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:38,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1719284426, now seen corresponding path program 1 times [2025-01-10 01:23:38,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:38,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769267719] [2025-01-10 01:23:38,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:38,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:38,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:23:38,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:23:38,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:38,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:38,285 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:23:38,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:38,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769267719] [2025-01-10 01:23:38,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769267719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:38,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:38,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:23:38,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154873271] [2025-01-10 01:23:38,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:38,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:23:38,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:38,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:23:38,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:23:38,291 INFO L87 Difference]: Start difference. First operand 131 states and 166 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:23:38,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:38,402 INFO L93 Difference]: Finished difference Result 194 states and 250 transitions. [2025-01-10 01:23:38,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:23:38,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-01-10 01:23:38,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:38,404 INFO L225 Difference]: With dead ends: 194 [2025-01-10 01:23:38,407 INFO L226 Difference]: Without dead ends: 192 [2025-01-10 01:23:38,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:23:38,408 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 117 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:38,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 259 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:38,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-01-10 01:23:38,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 165. [2025-01-10 01:23:38,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 146 states have (on average 1.4109589041095891) internal successors, (206), 157 states have internal predecessors, (206), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:23:38,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 214 transitions. [2025-01-10 01:23:38,423 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 214 transitions. Word has length 23 [2025-01-10 01:23:38,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:38,423 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 214 transitions. [2025-01-10 01:23:38,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:23:38,423 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 214 transitions. [2025-01-10 01:23:38,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 01:23:38,424 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:38,424 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:38,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:23:38,424 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:23:38,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:38,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1720021448, now seen corresponding path program 1 times [2025-01-10 01:23:38,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:38,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971289999] [2025-01-10 01:23:38,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:38,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:38,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:23:38,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:23:38,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:38,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:38,478 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:23:38,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:38,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971289999] [2025-01-10 01:23:38,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971289999] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:38,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:38,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:23:38,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501465398] [2025-01-10 01:23:38,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:38,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:23:38,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:38,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:23:38,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:23:38,480 INFO L87 Difference]: Start difference. First operand 165 states and 214 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:23:38,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:38,580 INFO L93 Difference]: Finished difference Result 185 states and 239 transitions. [2025-01-10 01:23:38,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:23:38,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-01-10 01:23:38,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:38,582 INFO L225 Difference]: With dead ends: 185 [2025-01-10 01:23:38,582 INFO L226 Difference]: Without dead ends: 183 [2025-01-10 01:23:38,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:23:38,583 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 116 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:38,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 263 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:38,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-01-10 01:23:38,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 157. [2025-01-10 01:23:38,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 138 states have (on average 1.4057971014492754) internal successors, (194), 149 states have internal predecessors, (194), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:23:38,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 202 transitions. [2025-01-10 01:23:38,589 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 202 transitions. Word has length 23 [2025-01-10 01:23:38,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:38,590 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 202 transitions. [2025-01-10 01:23:38,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:23:38,590 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 202 transitions. [2025-01-10 01:23:38,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 01:23:38,591 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:38,591 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:38,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:23:38,591 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:23:38,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:38,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1660339007, now seen corresponding path program 1 times [2025-01-10 01:23:38,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:38,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446180846] [2025-01-10 01:23:38,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:38,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:38,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 01:23:38,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 01:23:38,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:38,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:38,625 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:23:38,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:38,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446180846] [2025-01-10 01:23:38,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446180846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:38,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:38,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:23:38,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611404620] [2025-01-10 01:23:38,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:38,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:23:38,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:38,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:23:38,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:23:38,626 INFO L87 Difference]: Start difference. First operand 157 states and 202 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:23:38,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:38,684 INFO L93 Difference]: Finished difference Result 175 states and 227 transitions. [2025-01-10 01:23:38,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:23:38,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2025-01-10 01:23:38,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:38,686 INFO L225 Difference]: With dead ends: 175 [2025-01-10 01:23:38,686 INFO L226 Difference]: Without dead ends: 173 [2025-01-10 01:23:38,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:23:38,686 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 116 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:38,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 252 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:38,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-01-10 01:23:38,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 148. [2025-01-10 01:23:38,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 131 states have (on average 1.3969465648854962) internal successors, (183), 140 states have internal predecessors, (183), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:23:38,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 191 transitions. [2025-01-10 01:23:38,692 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 191 transitions. Word has length 30 [2025-01-10 01:23:38,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:38,693 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 191 transitions. [2025-01-10 01:23:38,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:23:38,693 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 191 transitions. [2025-01-10 01:23:38,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 01:23:38,693 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:38,693 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:38,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:23:38,694 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:23:38,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:38,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1659601985, now seen corresponding path program 1 times [2025-01-10 01:23:38,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:38,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752709449] [2025-01-10 01:23:38,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:38,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:38,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 01:23:38,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 01:23:38,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:38,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:38,730 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:23:38,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:38,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752709449] [2025-01-10 01:23:38,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752709449] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:38,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:38,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:23:38,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92549259] [2025-01-10 01:23:38,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:38,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:23:38,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:38,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:23:38,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:23:38,731 INFO L87 Difference]: Start difference. First operand 148 states and 191 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:23:38,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:38,793 INFO L93 Difference]: Finished difference Result 166 states and 216 transitions. [2025-01-10 01:23:38,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:23:38,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2025-01-10 01:23:38,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:38,794 INFO L225 Difference]: With dead ends: 166 [2025-01-10 01:23:38,795 INFO L226 Difference]: Without dead ends: 164 [2025-01-10 01:23:38,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:23:38,795 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 115 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:38,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 254 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:38,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-01-10 01:23:38,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 138. [2025-01-10 01:23:38,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 123 states have (on average 1.3902439024390243) internal successors, (171), 130 states have internal predecessors, (171), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:23:38,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 179 transitions. [2025-01-10 01:23:38,802 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 179 transitions. Word has length 30 [2025-01-10 01:23:38,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:38,803 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 179 transitions. [2025-01-10 01:23:38,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:23:38,803 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 179 transitions. [2025-01-10 01:23:38,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-10 01:23:38,804 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:38,804 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:38,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:23:38,805 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:23:38,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:38,805 INFO L85 PathProgramCache]: Analyzing trace with hash -733967511, now seen corresponding path program 1 times [2025-01-10 01:23:38,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:38,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312676280] [2025-01-10 01:23:38,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:38,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:38,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 01:23:38,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 01:23:38,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:38,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:38,895 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 01:23:38,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:38,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312676280] [2025-01-10 01:23:38,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312676280] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:38,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341333885] [2025-01-10 01:23:38,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:38,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:38,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:38,898 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:38,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:23:38,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 01:23:38,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 01:23:38,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:38,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:38,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:23:38,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:38,978 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:23:38,979 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:23:38,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341333885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:38,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:23:38,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 01:23:38,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712258551] [2025-01-10 01:23:38,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:38,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:23:38,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:38,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:23:38,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:23:38,981 INFO L87 Difference]: Start difference. First operand 138 states and 179 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:23:39,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:39,046 INFO L93 Difference]: Finished difference Result 312 states and 401 transitions. [2025-01-10 01:23:39,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:23:39,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2025-01-10 01:23:39,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:39,048 INFO L225 Difference]: With dead ends: 312 [2025-01-10 01:23:39,048 INFO L226 Difference]: Without dead ends: 177 [2025-01-10 01:23:39,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:23:39,049 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 16 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:39,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 220 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:39,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-01-10 01:23:39,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 143. [2025-01-10 01:23:39,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 127 states have (on average 1.3779527559055118) internal successors, (175), 134 states have internal predecessors, (175), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:23:39,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 183 transitions. [2025-01-10 01:23:39,058 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 183 transitions. Word has length 41 [2025-01-10 01:23:39,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:39,059 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 183 transitions. [2025-01-10 01:23:39,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:23:39,059 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 183 transitions. [2025-01-10 01:23:39,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 01:23:39,059 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:39,059 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:39,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 01:23:39,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-10 01:23:39,261 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:23:39,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:39,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1437073339, now seen corresponding path program 1 times [2025-01-10 01:23:39,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:39,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761418105] [2025-01-10 01:23:39,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:39,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:39,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 01:23:39,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 01:23:39,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:39,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:39,356 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 01:23:39,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:39,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761418105] [2025-01-10 01:23:39,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761418105] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:39,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520148155] [2025-01-10 01:23:39,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:39,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:39,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:39,360 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:39,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:23:39,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 01:23:39,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 01:23:39,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:39,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:39,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:23:39,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:39,439 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:23:39,442 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:23:39,542 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 01:23:39,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520148155] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:23:39,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:23:39,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 01:23:39,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313014169] [2025-01-10 01:23:39,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:23:39,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:23:39,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:39,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:23:39,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:23:39,545 INFO L87 Difference]: Start difference. First operand 143 states and 183 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-10 01:23:39,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:39,694 INFO L93 Difference]: Finished difference Result 442 states and 573 transitions. [2025-01-10 01:23:39,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:23:39,695 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 47 [2025-01-10 01:23:39,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:39,696 INFO L225 Difference]: With dead ends: 442 [2025-01-10 01:23:39,696 INFO L226 Difference]: Without dead ends: 339 [2025-01-10 01:23:39,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:23:39,696 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 121 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:39,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 442 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:39,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-01-10 01:23:39,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 155. [2025-01-10 01:23:39,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 139 states have (on average 1.3669064748201438) internal successors, (190), 146 states have internal predecessors, (190), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:23:39,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 198 transitions. [2025-01-10 01:23:39,706 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 198 transitions. Word has length 47 [2025-01-10 01:23:39,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:39,707 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 198 transitions. [2025-01-10 01:23:39,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-10 01:23:39,707 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 198 transitions. [2025-01-10 01:23:39,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 01:23:39,708 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:39,708 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:39,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 01:23:39,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-10 01:23:39,909 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:23:39,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:39,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1689664159, now seen corresponding path program 1 times [2025-01-10 01:23:39,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:39,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813965551] [2025-01-10 01:23:39,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:39,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:39,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 01:23:39,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 01:23:39,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:39,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:40,010 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 01:23:40,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:40,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813965551] [2025-01-10 01:23:40,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813965551] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:40,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155636600] [2025-01-10 01:23:40,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:40,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:40,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:40,013 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:40,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:23:40,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 01:23:40,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 01:23:40,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:40,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:40,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:23:40,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:40,118 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:23:40,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:23:40,197 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 01:23:40,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155636600] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:23:40,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:23:40,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 01:23:40,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446833232] [2025-01-10 01:23:40,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:23:40,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:23:40,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:40,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:23:40,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:23:40,199 INFO L87 Difference]: Start difference. First operand 155 states and 198 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-10 01:23:40,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:40,345 INFO L93 Difference]: Finished difference Result 452 states and 595 transitions. [2025-01-10 01:23:40,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:23:40,346 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 48 [2025-01-10 01:23:40,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:40,347 INFO L225 Difference]: With dead ends: 452 [2025-01-10 01:23:40,348 INFO L226 Difference]: Without dead ends: 349 [2025-01-10 01:23:40,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:23:40,348 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 146 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:40,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 327 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:40,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-01-10 01:23:40,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 167. [2025-01-10 01:23:40,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 151 states have (on average 1.3576158940397351) internal successors, (205), 158 states have internal predecessors, (205), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:23:40,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 213 transitions. [2025-01-10 01:23:40,361 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 213 transitions. Word has length 48 [2025-01-10 01:23:40,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:40,361 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 213 transitions. [2025-01-10 01:23:40,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-10 01:23:40,361 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 213 transitions. [2025-01-10 01:23:40,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 01:23:40,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:40,362 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:40,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 01:23:40,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 01:23:40,563 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:23:40,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:40,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1524891122, now seen corresponding path program 1 times [2025-01-10 01:23:40,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:40,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777499349] [2025-01-10 01:23:40,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:40,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:40,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 01:23:40,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 01:23:40,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:40,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:40,599 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:23:40,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:40,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777499349] [2025-01-10 01:23:40,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777499349] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:40,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236565390] [2025-01-10 01:23:40,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:40,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:40,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:40,606 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:40,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 01:23:40,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 01:23:40,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 01:23:40,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:40,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:40,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 01:23:40,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:40,682 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 01:23:40,682 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:23:40,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236565390] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:40,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:23:40,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2025-01-10 01:23:40,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888075454] [2025-01-10 01:23:40,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:40,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:23:40,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:40,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:23:40,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:40,683 INFO L87 Difference]: Start difference. First operand 167 states and 213 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:23:40,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:40,752 INFO L93 Difference]: Finished difference Result 296 states and 377 transitions. [2025-01-10 01:23:40,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:23:40,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2025-01-10 01:23:40,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:40,754 INFO L225 Difference]: With dead ends: 296 [2025-01-10 01:23:40,757 INFO L226 Difference]: Without dead ends: 184 [2025-01-10 01:23:40,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:40,758 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 6 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:40,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 163 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:40,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-01-10 01:23:40,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 172. [2025-01-10 01:23:40,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 156 states have (on average 1.3397435897435896) internal successors, (209), 163 states have internal predecessors, (209), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:23:40,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 217 transitions. [2025-01-10 01:23:40,779 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 217 transitions. Word has length 50 [2025-01-10 01:23:40,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:40,782 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 217 transitions. [2025-01-10 01:23:40,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:23:40,783 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 217 transitions. [2025-01-10 01:23:40,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-10 01:23:40,783 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:40,783 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:40,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 01:23:40,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:40,984 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:23:40,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:40,985 INFO L85 PathProgramCache]: Analyzing trace with hash -872401109, now seen corresponding path program 1 times [2025-01-10 01:23:40,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:40,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372130691] [2025-01-10 01:23:40,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:40,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:40,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 01:23:41,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 01:23:41,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:41,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:41,147 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 01:23:41,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:41,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372130691] [2025-01-10 01:23:41,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372130691] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:41,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148033459] [2025-01-10 01:23:41,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:41,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:41,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:41,153 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:41,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 01:23:41,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 01:23:41,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 01:23:41,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:41,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:41,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 01:23:41,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:41,299 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:23:41,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:23:41,447 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:23:41,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148033459] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:23:41,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:23:41,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 17 [2025-01-10 01:23:41,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214559587] [2025-01-10 01:23:41,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:23:41,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:23:41,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:41,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:23:41,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:23:41,448 INFO L87 Difference]: Start difference. First operand 172 states and 217 transitions. Second operand has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 15 states have internal predecessors, (61), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-10 01:23:41,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:41,801 INFO L93 Difference]: Finished difference Result 355 states and 444 transitions. [2025-01-10 01:23:41,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 01:23:41,801 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 15 states have internal predecessors, (61), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 51 [2025-01-10 01:23:41,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:41,802 INFO L225 Difference]: With dead ends: 355 [2025-01-10 01:23:41,802 INFO L226 Difference]: Without dead ends: 200 [2025-01-10 01:23:41,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2025-01-10 01:23:41,803 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 33 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:41,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 881 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:23:41,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-01-10 01:23:41,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 144. [2025-01-10 01:23:41,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 128 states have (on average 1.328125) internal successors, (170), 135 states have internal predecessors, (170), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:23:41,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 178 transitions. [2025-01-10 01:23:41,811 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 178 transitions. Word has length 51 [2025-01-10 01:23:41,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:41,811 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 178 transitions. [2025-01-10 01:23:41,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 15 states have internal predecessors, (61), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-10 01:23:41,812 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 178 transitions. [2025-01-10 01:23:41,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-10 01:23:41,812 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:41,812 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:41,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 01:23:42,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 01:23:42,017 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:23:42,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:42,018 INFO L85 PathProgramCache]: Analyzing trace with hash -166655852, now seen corresponding path program 1 times [2025-01-10 01:23:42,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:42,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443174104] [2025-01-10 01:23:42,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:42,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:42,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-10 01:23:42,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 01:23:42,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:42,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:42,104 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:23:42,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:42,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443174104] [2025-01-10 01:23:42,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443174104] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:42,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277671531] [2025-01-10 01:23:42,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:42,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:42,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:42,106 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:42,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 01:23:42,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-10 01:23:42,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 01:23:42,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:42,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:42,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:23:42,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 01:23:42,232 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:23:42,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277671531] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:42,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:23:42,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-10 01:23:42,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929551314] [2025-01-10 01:23:42,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:42,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:23:42,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:42,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:23:42,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:23:42,233 INFO L87 Difference]: Start difference. First operand 144 states and 178 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:23:42,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:42,289 INFO L93 Difference]: Finished difference Result 269 states and 333 transitions. [2025-01-10 01:23:42,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:23:42,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2025-01-10 01:23:42,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:42,290 INFO L225 Difference]: With dead ends: 269 [2025-01-10 01:23:42,290 INFO L226 Difference]: Without dead ends: 158 [2025-01-10 01:23:42,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:23:42,291 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 7 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:42,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 165 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:42,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-01-10 01:23:42,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 140. [2025-01-10 01:23:42,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 124 states have (on average 1.314516129032258) internal successors, (163), 131 states have internal predecessors, (163), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:23:42,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 171 transitions. [2025-01-10 01:23:42,299 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 171 transitions. Word has length 56 [2025-01-10 01:23:42,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:42,299 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 171 transitions. [2025-01-10 01:23:42,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:23:42,299 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 171 transitions. [2025-01-10 01:23:42,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-10 01:23:42,300 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:42,300 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:42,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 01:23:42,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 01:23:42,501 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:23:42,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:42,501 INFO L85 PathProgramCache]: Analyzing trace with hash -2045871793, now seen corresponding path program 1 times [2025-01-10 01:23:42,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:42,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896161333] [2025-01-10 01:23:42,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:42,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:42,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-10 01:23:42,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-10 01:23:42,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:42,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:42,701 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:23:42,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:42,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896161333] [2025-01-10 01:23:42,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896161333] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:42,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:42,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:23:42,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268270914] [2025-01-10 01:23:42,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:42,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:23:42,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:42,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:23:42,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:23:42,706 INFO L87 Difference]: Start difference. First operand 140 states and 171 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 01:23:42,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:42,750 INFO L93 Difference]: Finished difference Result 188 states and 224 transitions. [2025-01-10 01:23:42,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:23:42,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2025-01-10 01:23:42,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:42,755 INFO L225 Difference]: With dead ends: 188 [2025-01-10 01:23:42,755 INFO L226 Difference]: Without dead ends: 143 [2025-01-10 01:23:42,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:23:42,756 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:42,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 434 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:42,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-01-10 01:23:42,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2025-01-10 01:23:42,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 124 states have (on average 1.2983870967741935) internal successors, (161), 131 states have internal predecessors, (161), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:23:42,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 169 transitions. [2025-01-10 01:23:42,771 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 169 transitions. Word has length 57 [2025-01-10 01:23:42,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:42,772 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 169 transitions. [2025-01-10 01:23:42,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 01:23:42,775 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 169 transitions. [2025-01-10 01:23:42,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-10 01:23:42,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:42,776 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:42,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:23:42,776 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:23:42,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:42,776 INFO L85 PathProgramCache]: Analyzing trace with hash -464262135, now seen corresponding path program 2 times [2025-01-10 01:23:42,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:42,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395525240] [2025-01-10 01:23:42,776 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:23:42,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:42,782 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 60 statements into 2 equivalence classes. [2025-01-10 01:23:42,797 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 60 statements. [2025-01-10 01:23:42,798 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:23:42,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:42,963 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-10 01:23:42,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:42,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395525240] [2025-01-10 01:23:42,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395525240] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:42,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:42,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:23:42,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532969045] [2025-01-10 01:23:42,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:42,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:23:42,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:42,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:23:42,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:23:42,965 INFO L87 Difference]: Start difference. First operand 140 states and 169 transitions. Second operand has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 01:23:43,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:43,004 INFO L93 Difference]: Finished difference Result 140 states and 169 transitions. [2025-01-10 01:23:43,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:23:43,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 60 [2025-01-10 01:23:43,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:43,005 INFO L225 Difference]: With dead ends: 140 [2025-01-10 01:23:43,005 INFO L226 Difference]: Without dead ends: 137 [2025-01-10 01:23:43,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:23:43,006 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 51 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:43,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 190 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:43,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-01-10 01:23:43,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-01-10 01:23:43,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 124 states have (on average 1.2741935483870968) internal successors, (158), 128 states have internal predecessors, (158), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 01:23:43,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 166 transitions. [2025-01-10 01:23:43,014 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 166 transitions. Word has length 60 [2025-01-10 01:23:43,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:43,014 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 166 transitions. [2025-01-10 01:23:43,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 01:23:43,015 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 166 transitions. [2025-01-10 01:23:43,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-10 01:23:43,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:43,015 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:43,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 01:23:43,015 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:23:43,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:43,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1507224120, now seen corresponding path program 1 times [2025-01-10 01:23:43,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:43,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039062390] [2025-01-10 01:23:43,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:43,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:43,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-10 01:23:43,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-10 01:23:43,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:43,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:43,171 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-10 01:23:43,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:43,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039062390] [2025-01-10 01:23:43,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039062390] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:43,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207176536] [2025-01-10 01:23:43,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:43,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:43,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:43,173 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:43,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 01:23:43,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-10 01:23:43,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-10 01:23:43,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:43,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:43,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-10 01:23:43,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:43,291 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 01:23:43,291 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:23:43,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207176536] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:43,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:23:43,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 9 [2025-01-10 01:23:43,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931406440] [2025-01-10 01:23:43,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:43,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:23:43,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:43,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:23:43,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:23:43,292 INFO L87 Difference]: Start difference. First operand 137 states and 166 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:23:43,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:43,392 INFO L93 Difference]: Finished difference Result 224 states and 265 transitions. [2025-01-10 01:23:43,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:23:43,393 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 61 [2025-01-10 01:23:43,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:43,394 INFO L225 Difference]: With dead ends: 224 [2025-01-10 01:23:43,394 INFO L226 Difference]: Without dead ends: 188 [2025-01-10 01:23:43,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:23:43,395 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 51 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:43,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 569 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:43,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-01-10 01:23:43,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 147. [2025-01-10 01:23:43,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 131 states have (on average 1.2595419847328244) internal successors, (165), 136 states have internal predecessors, (165), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2025-01-10 01:23:43,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 178 transitions. [2025-01-10 01:23:43,411 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 178 transitions. Word has length 61 [2025-01-10 01:23:43,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:43,411 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 178 transitions. [2025-01-10 01:23:43,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:23:43,411 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 178 transitions. [2025-01-10 01:23:43,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-10 01:23:43,412 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:43,412 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:43,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 01:23:43,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:43,616 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:23:43,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:43,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1249058682, now seen corresponding path program 1 times [2025-01-10 01:23:43,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:43,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081204727] [2025-01-10 01:23:43,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:43,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:43,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-10 01:23:43,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-10 01:23:43,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:43,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:43,749 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:23:43,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:43,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081204727] [2025-01-10 01:23:43,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081204727] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:43,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769904843] [2025-01-10 01:23:43,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:43,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:43,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:43,752 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:43,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 01:23:43,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-10 01:23:43,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-10 01:23:43,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:43,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:43,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-10 01:23:43,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:43,963 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 01:23:43,963 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:23:43,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769904843] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:43,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:23:43,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2025-01-10 01:23:43,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028781802] [2025-01-10 01:23:43,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:43,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:23:43,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:43,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:23:43,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:23:43,965 INFO L87 Difference]: Start difference. First operand 147 states and 178 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:23:44,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:44,090 INFO L93 Difference]: Finished difference Result 221 states and 261 transitions. [2025-01-10 01:23:44,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:23:44,092 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 61 [2025-01-10 01:23:44,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:44,093 INFO L225 Difference]: With dead ends: 221 [2025-01-10 01:23:44,093 INFO L226 Difference]: Without dead ends: 197 [2025-01-10 01:23:44,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:23:44,095 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 67 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:44,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 625 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:44,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-01-10 01:23:44,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 157. [2025-01-10 01:23:44,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 141 states have (on average 1.24822695035461) internal successors, (176), 146 states have internal predecessors, (176), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2025-01-10 01:23:44,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 189 transitions. [2025-01-10 01:23:44,110 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 189 transitions. Word has length 61 [2025-01-10 01:23:44,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:44,110 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 189 transitions. [2025-01-10 01:23:44,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:23:44,110 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 189 transitions. [2025-01-10 01:23:44,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-10 01:23:44,113 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:44,113 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:44,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 01:23:44,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-01-10 01:23:44,318 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:23:44,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:44,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1995147485, now seen corresponding path program 1 times [2025-01-10 01:23:44,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:44,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170087145] [2025-01-10 01:23:44,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:44,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:44,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 01:23:44,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 01:23:44,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:44,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:44,456 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:23:44,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:44,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170087145] [2025-01-10 01:23:44,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170087145] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:44,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249872760] [2025-01-10 01:23:44,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:44,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:44,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:44,464 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:44,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 01:23:44,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 01:23:44,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 01:23:44,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:44,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:44,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-10 01:23:44,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:44,688 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 01:23:44,688 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:23:44,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249872760] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:44,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:23:44,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2025-01-10 01:23:44,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896149968] [2025-01-10 01:23:44,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:44,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:23:44,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:44,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:23:44,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:23:44,690 INFO L87 Difference]: Start difference. First operand 157 states and 189 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:23:44,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:44,847 INFO L93 Difference]: Finished difference Result 225 states and 264 transitions. [2025-01-10 01:23:44,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:23:44,847 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 63 [2025-01-10 01:23:44,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:44,848 INFO L225 Difference]: With dead ends: 225 [2025-01-10 01:23:44,848 INFO L226 Difference]: Without dead ends: 195 [2025-01-10 01:23:44,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-01-10 01:23:44,849 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 55 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:44,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 627 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:44,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-01-10 01:23:44,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 157. [2025-01-10 01:23:44,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 141 states have (on average 1.2411347517730495) internal successors, (175), 146 states have internal predecessors, (175), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2025-01-10 01:23:44,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 188 transitions. [2025-01-10 01:23:44,860 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 188 transitions. Word has length 63 [2025-01-10 01:23:44,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:44,860 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 188 transitions. [2025-01-10 01:23:44,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:23:44,861 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 188 transitions. [2025-01-10 01:23:44,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-10 01:23:44,861 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:44,861 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:44,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-10 01:23:45,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:45,062 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:23:45,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:45,063 INFO L85 PathProgramCache]: Analyzing trace with hash -775865120, now seen corresponding path program 1 times [2025-01-10 01:23:45,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:45,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782354745] [2025-01-10 01:23:45,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:45,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:45,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-10 01:23:45,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-10 01:23:45,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:45,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-10 01:23:45,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:45,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782354745] [2025-01-10 01:23:45,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782354745] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:45,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:45,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 01:23:45,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897809969] [2025-01-10 01:23:45,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:45,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:23:45,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:45,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:23:45,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:23:45,426 INFO L87 Difference]: Start difference. First operand 157 states and 188 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 01:23:45,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:45,518 INFO L93 Difference]: Finished difference Result 176 states and 210 transitions. [2025-01-10 01:23:45,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:23:45,518 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 65 [2025-01-10 01:23:45,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:45,519 INFO L225 Difference]: With dead ends: 176 [2025-01-10 01:23:45,519 INFO L226 Difference]: Without dead ends: 175 [2025-01-10 01:23:45,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:23:45,520 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 24 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:45,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 484 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:45,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-01-10 01:23:45,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 156. [2025-01-10 01:23:45,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 141 states have (on average 1.2340425531914894) internal successors, (174), 145 states have internal predecessors, (174), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2025-01-10 01:23:45,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 187 transitions. [2025-01-10 01:23:45,529 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 187 transitions. Word has length 65 [2025-01-10 01:23:45,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:45,529 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 187 transitions. [2025-01-10 01:23:45,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 01:23:45,529 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 187 transitions. [2025-01-10 01:23:45,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-10 01:23:45,530 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:45,530 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:45,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 01:23:45,530 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:23:45,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:45,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1717985235, now seen corresponding path program 1 times [2025-01-10 01:23:45,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:45,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115672307] [2025-01-10 01:23:45,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:45,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:45,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-10 01:23:45,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-10 01:23:45,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:45,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:45,572 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-10 01:23:45,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:45,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115672307] [2025-01-10 01:23:45,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115672307] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:45,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:45,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:23:45,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855868564] [2025-01-10 01:23:45,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:45,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:23:45,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:45,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:23:45,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:23:45,573 INFO L87 Difference]: Start difference. First operand 156 states and 187 transitions. Second operand has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 01:23:45,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:45,622 INFO L93 Difference]: Finished difference Result 156 states and 187 transitions. [2025-01-10 01:23:45,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:23:45,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 66 [2025-01-10 01:23:45,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:45,623 INFO L225 Difference]: With dead ends: 156 [2025-01-10 01:23:45,623 INFO L226 Difference]: Without dead ends: 155 [2025-01-10 01:23:45,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:23:45,624 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 29 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:45,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 192 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:45,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-01-10 01:23:45,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2025-01-10 01:23:45,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 141 states have (on average 1.2269503546099292) internal successors, (173), 144 states have internal predecessors, (173), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2025-01-10 01:23:45,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 186 transitions. [2025-01-10 01:23:45,637 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 186 transitions. Word has length 66 [2025-01-10 01:23:45,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:45,637 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 186 transitions. [2025-01-10 01:23:45,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 01:23:45,637 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 186 transitions. [2025-01-10 01:23:45,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-10 01:23:45,638 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:45,638 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:45,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 01:23:45,638 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:23:45,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:45,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1717934914, now seen corresponding path program 1 times [2025-01-10 01:23:45,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:45,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275082785] [2025-01-10 01:23:45,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:45,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:45,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-10 01:23:45,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-10 01:23:45,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:45,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:23:45,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:45,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275082785] [2025-01-10 01:23:45,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275082785] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:45,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730270852] [2025-01-10 01:23:45,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:45,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:45,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:45,729 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:45,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 01:23:45,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-10 01:23:45,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-10 01:23:45,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:45,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:45,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-10 01:23:45,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:45,922 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 01:23:45,922 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:23:45,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730270852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:45,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:23:45,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 14 [2025-01-10 01:23:45,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171715896] [2025-01-10 01:23:45,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:45,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:23:45,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:45,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:23:45,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:23:45,923 INFO L87 Difference]: Start difference. First operand 155 states and 186 transitions. Second operand has 11 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:23:46,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:46,049 INFO L93 Difference]: Finished difference Result 199 states and 235 transitions. [2025-01-10 01:23:46,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:23:46,050 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 67 [2025-01-10 01:23:46,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:46,050 INFO L225 Difference]: With dead ends: 199 [2025-01-10 01:23:46,051 INFO L226 Difference]: Without dead ends: 198 [2025-01-10 01:23:46,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:23:46,051 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 60 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:46,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 667 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:46,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-01-10 01:23:46,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 162. [2025-01-10 01:23:46,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 148 states have (on average 1.2162162162162162) internal successors, (180), 151 states have internal predecessors, (180), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2025-01-10 01:23:46,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 193 transitions. [2025-01-10 01:23:46,061 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 193 transitions. Word has length 67 [2025-01-10 01:23:46,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:46,062 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 193 transitions. [2025-01-10 01:23:46,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:23:46,062 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 193 transitions. [2025-01-10 01:23:46,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-10 01:23:46,062 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:46,062 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:46,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-10 01:23:46,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:46,267 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:23:46,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:46,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1043893666, now seen corresponding path program 1 times [2025-01-10 01:23:46,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:46,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070875603] [2025-01-10 01:23:46,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:46,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:46,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-10 01:23:46,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-10 01:23:46,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:46,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:46,374 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-10 01:23:46,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:46,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070875603] [2025-01-10 01:23:46,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070875603] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:46,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164402180] [2025-01-10 01:23:46,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:46,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:46,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:46,378 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:46,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-10 01:23:46,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-10 01:23:46,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-10 01:23:46,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:46,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:46,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:23:46,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:46,493 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-10 01:23:46,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:23:46,657 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-10 01:23:46,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164402180] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:23:46,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:23:46,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 8] total 16 [2025-01-10 01:23:46,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376844462] [2025-01-10 01:23:46,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:23:46,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:23:46,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:46,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:23:46,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:23:46,658 INFO L87 Difference]: Start difference. First operand 162 states and 193 transitions. Second operand has 16 states, 16 states have (on average 4.5625) internal successors, (73), 14 states have internal predecessors, (73), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-10 01:23:46,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:46,986 INFO L93 Difference]: Finished difference Result 391 states and 462 transitions. [2025-01-10 01:23:46,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 01:23:46,987 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.5625) internal successors, (73), 14 states have internal predecessors, (73), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 70 [2025-01-10 01:23:46,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:46,988 INFO L225 Difference]: With dead ends: 391 [2025-01-10 01:23:46,988 INFO L226 Difference]: Without dead ends: 259 [2025-01-10 01:23:46,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2025-01-10 01:23:46,989 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 75 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:46,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 723 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 01:23:46,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-01-10 01:23:47,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 164. [2025-01-10 01:23:47,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 150 states have (on average 1.2066666666666668) internal successors, (181), 152 states have internal predecessors, (181), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2025-01-10 01:23:47,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 194 transitions. [2025-01-10 01:23:47,028 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 194 transitions. Word has length 70 [2025-01-10 01:23:47,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:47,028 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 194 transitions. [2025-01-10 01:23:47,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.5625) internal successors, (73), 14 states have internal predecessors, (73), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-10 01:23:47,028 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 194 transitions. [2025-01-10 01:23:47,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-10 01:23:47,029 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:47,029 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:47,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-10 01:23:47,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-01-10 01:23:47,233 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-01-10 01:23:47,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:47,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1096091205, now seen corresponding path program 1 times [2025-01-10 01:23:47,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:47,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447620612] [2025-01-10 01:23:47,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:47,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:47,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-10 01:23:47,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-10 01:23:47,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:47,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:47,593 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-10 01:23:47,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:47,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447620612] [2025-01-10 01:23:47,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447620612] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:47,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:47,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:23:47,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142232689] [2025-01-10 01:23:47,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:47,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:23:47,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:47,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:23:47,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:23:47,596 INFO L87 Difference]: Start difference. First operand 164 states and 194 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 01:23:47,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:47,654 INFO L93 Difference]: Finished difference Result 171 states and 203 transitions. [2025-01-10 01:23:47,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:23:47,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 74 [2025-01-10 01:23:47,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:47,655 INFO L225 Difference]: With dead ends: 171 [2025-01-10 01:23:47,655 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:23:47,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:23:47,656 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 51 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:47,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 242 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:47,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:23:47,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:23:47,656 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-01-10 01:23:47,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:23:47,657 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2025-01-10 01:23:47,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:47,657 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:23:47,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 01:23:47,657 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:23:47,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:23:47,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2025-01-10 01:23:47,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2025-01-10 01:23:47,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2025-01-10 01:23:47,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-01-10 01:23:47,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-01-10 01:23:47,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-01-10 01:23:47,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-01-10 01:23:47,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-01-10 01:23:47,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2025-01-10 01:23:47,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2025-01-10 01:23:47,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-01-10 01:23:47,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-01-10 01:23:47,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-01-10 01:23:47,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-01-10 01:23:47,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-01-10 01:23:47,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-01-10 01:23:47,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-01-10 01:23:47,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-01-10 01:23:47,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-10 01:23:47,665 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:47,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:23:59,934 WARN L286 SmtUtils]: Spent 9.48s on a formula simplification. DAG size of input: 82 DAG size of output: 101 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-01-10 01:24:14,371 WARN L286 SmtUtils]: Spent 8.96s on a formula simplification. DAG size of input: 82 DAG size of output: 101 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-01-10 01:24:17,401 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:24:17,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:24:17 BoogieIcfgContainer [2025-01-10 01:24:17,416 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:24:17,417 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:24:17,417 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:24:17,417 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:24:17,421 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:23:35" (3/4) ... [2025-01-10 01:24:17,422 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:24:17,431 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2025-01-10 01:24:17,431 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-01-10 01:24:17,436 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-01-10 01:24:17,437 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-01-10 01:24:17,437 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 01:24:17,437 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 01:24:17,456 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\old(e) <= 127) && ((0 < \old(m)) || (\old(e) != 0))) && (0 <= ((long long) 128 + \old(e)))) && (e <= \old(e))) && ((((m == \old(m)) && (e == 0)) || (\old(e) != 0)) || ((((((m % 2) == 0) && (((long long) e + 1) <= 0)) && ((m / 2) <= 4294967295)) && (0 <= (m / 2))) && (0 <= (2147483649 + e))))) && (m <= 33554431)) [2025-01-10 01:24:17,456 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 < \old(m)) || (\old(e) != 0)) && (0 <= ((long long) 128 + \old(e)))) && (\old(e) <= e)) && (e <= 127)) && (\old(m) != 1)) [2025-01-10 01:24:17,478 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 < \old(m)) || (\old(e) != 0)) && (0 <= ((long long) 128 + \old(e)))) && (\old(e) <= e)) && (e <= 127)) && (\old(m) != 1)) [2025-01-10 01:24:17,480 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\old(e) <= 127) && ((0 < \old(m)) || (\old(e) != 0))) && (0 <= ((long long) 128 + \old(e)))) && (e <= \old(e))) && ((((m == \old(m)) && (e == 0)) || (\old(e) != 0)) || ((((((m % 2) == 0) && (((long long) e + 1) <= 0)) && ((m / 2) <= 4294967295)) && (0 <= (m / 2))) && (0 <= (2147483649 + e))))) && (m <= 33554431)) [2025-01-10 01:24:17,511 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:24:17,511 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:24:17,511 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:24:17,512 INFO L158 Benchmark]: Toolchain (without parser) took 42276.66ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 131.8MB in the beginning and 699.6MB in the end (delta: -567.8MB). Peak memory consumption was 494.0MB. Max. memory is 16.1GB. [2025-01-10 01:24:17,513 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 226.5MB. Free memory is still 150.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:24:17,513 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.34ms. Allocated memory is still 167.8MB. Free memory was 131.8MB in the beginning and 118.5MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:24:17,513 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.39ms. Allocated memory is still 167.8MB. Free memory was 118.5MB in the beginning and 116.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:24:17,513 INFO L158 Benchmark]: Boogie Preprocessor took 38.96ms. Allocated memory is still 167.8MB. Free memory was 116.6MB in the beginning and 114.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:24:17,514 INFO L158 Benchmark]: RCFGBuilder took 385.54ms. Allocated memory is still 167.8MB. Free memory was 114.6MB in the beginning and 92.2MB in the end (delta: 22.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 01:24:17,514 INFO L158 Benchmark]: TraceAbstraction took 41447.21ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 91.5MB in the beginning and 707.9MB in the end (delta: -616.4MB). Peak memory consumption was 693.9MB. Max. memory is 16.1GB. [2025-01-10 01:24:17,514 INFO L158 Benchmark]: Witness Printer took 94.61ms. Allocated memory is still 1.2GB. Free memory was 707.9MB in the beginning and 699.6MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:24:17,515 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.27ms. Allocated memory is still 226.5MB. Free memory is still 150.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.34ms. Allocated memory is still 167.8MB. Free memory was 131.8MB in the beginning and 118.5MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.39ms. Allocated memory is still 167.8MB. Free memory was 118.5MB in the beginning and 116.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.96ms. Allocated memory is still 167.8MB. Free memory was 116.6MB in the beginning and 114.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 385.54ms. Allocated memory is still 167.8MB. Free memory was 114.6MB in the beginning and 92.2MB in the end (delta: 22.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 41447.21ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 91.5MB in the beginning and 707.9MB in the end (delta: -616.4MB). Peak memory consumption was 693.9MB. Max. memory is 16.1GB. * Witness Printer took 94.61ms. Allocated memory is still 1.2GB. Free memory was 707.9MB in the beginning and 699.6MB in the end (delta: 8.3MB). 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: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 172]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 172]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 175]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 175]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 177]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 177]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 178]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 178]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 201]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 201]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 214]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 214]: 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 3 procedures, 108 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 28, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1493 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1479 mSDsluCounter, 9696 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7350 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2307 IncrementalHoareTripleChecker+Invalid, 2409 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 2346 mSDtfsCounter, 2307 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1030 GetRequests, 838 SyntacticMatches, 3 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred in iteration=16, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 934 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1803 NumberOfCodeBlocks, 1766 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1973 ConstructedInterpolants, 0 QuantifiedInterpolants, 3716 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1991 ConjunctsInSsa, 182 ConjunctsInUnsatCore, 46 InterpolantComputations, 24 PerfectInterpolantSequences, 990/1129 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 18 specifications checked. All of them hold - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((0 < \old(m)) || (\old(e) != 0)) && (0 <= ((long long) 128 + \old(e)))) && (\old(e) <= e)) && (e <= 127)) && (\old(m) != 1)) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((((((\old(e) <= 127) && ((0 < \old(m)) || (\old(e) != 0))) && (0 <= ((long long) 128 + \old(e)))) && (e <= \old(e))) && ((((m == \old(m)) && (e == 0)) || (\old(e) != 0)) || ((((((m % 2) == 0) && (((long long) e + 1) <= 0)) && ((m / 2) <= 4294967295)) && (0 <= (m / 2))) && (0 <= (2147483649 + e))))) && (m <= 33554431)) RESULT: Ultimate proved your program to be correct! [2025-01-10 01:24:17,536 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