./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-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_4-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 c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:23:44,179 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:23:44,226 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:44,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:23:44,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:23:44,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:23:44,248 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:23:44,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:23:44,248 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:23:44,249 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:23:44,249 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:23:44,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:23:44,250 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:23:44,250 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:23:44,250 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:23:44,250 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:23:44,250 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:23:44,250 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:23:44,250 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:23:44,250 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:23:44,250 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:23:44,251 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:23:44,251 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:23:44,251 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:23:44,251 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:23:44,251 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:23:44,251 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:23:44,251 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:23:44,251 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:23:44,252 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:23:44,252 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:23:44,252 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:23:44,252 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:23:44,252 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:23:44,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:23:44,252 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:23:44,253 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:23:44,253 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:23:44,253 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:23:44,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:23:44,253 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:23:44,253 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:23:44,253 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:23:44,253 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:23:44,253 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:23:44,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:23:44,253 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:23:44,253 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:23:44,253 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:23:44,253 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:23:44,253 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 -> c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a [2025-01-10 01:23:44,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:23:44,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:23:44,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:23:44,508 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:23:44,508 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:23:44,509 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2025-01-10 01:23:45,646 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df2086ee6/bd5b826442bc43e6b28eb064d52da66c/FLAG00cc2555e [2025-01-10 01:23:45,894 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:23:45,895 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2025-01-10 01:23:45,921 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df2086ee6/bd5b826442bc43e6b28eb064d52da66c/FLAG00cc2555e [2025-01-10 01:23:46,229 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df2086ee6/bd5b826442bc43e6b28eb064d52da66c [2025-01-10 01:23:46,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:23:46,232 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:23:46,233 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:23:46,233 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:23:46,237 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:23:46,238 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:23:46" (1/1) ... [2025-01-10 01:23:46,239 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20a9a994 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:46, skipping insertion in model container [2025-01-10 01:23:46,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:23:46" (1/1) ... [2025-01-10 01:23:46,272 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:23:46,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:23:46,429 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:23:46,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:23:46,483 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:23:46,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:46 WrapperNode [2025-01-10 01:23:46,485 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:23:46,485 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:23:46,486 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:23:46,486 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:23:46,489 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:46" (1/1) ... [2025-01-10 01:23:46,495 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:46" (1/1) ... [2025-01-10 01:23:46,511 INFO L138 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2025-01-10 01:23:46,512 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:23:46,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:23:46,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:23:46,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:23:46,520 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:46" (1/1) ... [2025-01-10 01:23:46,520 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:46" (1/1) ... [2025-01-10 01:23:46,521 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:46" (1/1) ... [2025-01-10 01:23:46,540 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:46,540 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:46" (1/1) ... [2025-01-10 01:23:46,540 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:46" (1/1) ... [2025-01-10 01:23:46,543 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:46" (1/1) ... [2025-01-10 01:23:46,547 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:46" (1/1) ... [2025-01-10 01:23:46,549 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:46" (1/1) ... [2025-01-10 01:23:46,554 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:46" (1/1) ... [2025-01-10 01:23:46,555 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:46" (1/1) ... [2025-01-10 01:23:46,556 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:23:46,560 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:23:46,560 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:23:46,560 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:23:46,561 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:46" (1/1) ... [2025-01-10 01:23:46,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:23:46,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:46,587 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:46,589 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:46,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:23:46,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:23:46,606 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-01-10 01:23:46,606 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-01-10 01:23:46,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:23:46,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:23:46,607 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2025-01-10 01:23:46,607 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2025-01-10 01:23:46,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 01:23:46,607 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 01:23:46,661 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:23:46,662 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:23:47,060 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2025-01-10 01:23:47,060 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:23:47,075 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:23:47,075 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 01:23:47,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:23:47 BoogieIcfgContainer [2025-01-10 01:23:47,075 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:23:47,077 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:23:47,077 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:23:47,080 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:23:47,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:23:46" (1/3) ... [2025-01-10 01:23:47,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8a0d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:23:47, skipping insertion in model container [2025-01-10 01:23:47,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:46" (2/3) ... [2025-01-10 01:23:47,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8a0d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:23:47, skipping insertion in model container [2025-01-10 01:23:47,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:23:47" (3/3) ... [2025-01-10 01:23:47,082 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2025-01-10 01:23:47,092 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:23:47,093 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_4-3a.c.cil.c that has 4 procedures, 107 locations, 1 initial locations, 2 loop locations, and 16 error locations. [2025-01-10 01:23:47,128 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:23:47,136 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;@29bca4e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:23:47,136 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-01-10 01:23:47,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 78 states have (on average 1.5769230769230769) internal successors, (123), 94 states have internal predecessors, (123), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 01:23:47,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:23:47,143 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:47,144 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:47,144 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:47,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:47,148 INFO L85 PathProgramCache]: Analyzing trace with hash -2068683086, now seen corresponding path program 1 times [2025-01-10 01:23:47,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:47,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197450467] [2025-01-10 01:23:47,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:47,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:47,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:23:47,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:23:47,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:47,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:47,309 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:47,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:47,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197450467] [2025-01-10 01:23:47,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197450467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:47,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:47,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:23:47,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449483272] [2025-01-10 01:23:47,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:47,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:23:47,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:47,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:23:47,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:23:47,330 INFO L87 Difference]: Start difference. First operand has 107 states, 78 states have (on average 1.5769230769230769) internal successors, (123), 94 states have internal predecessors, (123), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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:47,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:47,445 INFO L93 Difference]: Finished difference Result 255 states and 361 transitions. [2025-01-10 01:23:47,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:23:47,446 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:47,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:47,452 INFO L225 Difference]: With dead ends: 255 [2025-01-10 01:23:47,453 INFO L226 Difference]: Without dead ends: 141 [2025-01-10 01:23:47,462 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:47,464 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 80 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:47,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 351 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:47,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-01-10 01:23:47,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 131. [2025-01-10 01:23:47,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 107 states have (on average 1.5046728971962617) internal successors, (161), 119 states have internal predecessors, (161), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 01:23:47,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 176 transitions. [2025-01-10 01:23:47,501 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 176 transitions. Word has length 8 [2025-01-10 01:23:47,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:47,502 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 176 transitions. [2025-01-10 01:23:47,502 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:47,502 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 176 transitions. [2025-01-10 01:23:47,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 01:23:47,503 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:47,503 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:47,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:23:47,503 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:47,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:47,506 INFO L85 PathProgramCache]: Analyzing trace with hash -2097955529, now seen corresponding path program 1 times [2025-01-10 01:23:47,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:47,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617074902] [2025-01-10 01:23:47,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:47,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:47,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:23:47,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:23:47,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:47,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:47,563 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:47,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:47,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617074902] [2025-01-10 01:23:47,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617074902] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:47,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:47,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:23:47,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253883482] [2025-01-10 01:23:47,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:47,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:23:47,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:47,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:23:47,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:47,566 INFO L87 Difference]: Start difference. First operand 131 states and 176 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:47,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:47,597 INFO L93 Difference]: Finished difference Result 131 states and 176 transitions. [2025-01-10 01:23:47,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:23:47,598 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:47,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:47,599 INFO L225 Difference]: With dead ends: 131 [2025-01-10 01:23:47,599 INFO L226 Difference]: Without dead ends: 130 [2025-01-10 01:23:47,599 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:47,600 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 210 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:47,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 210 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:47,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-01-10 01:23:47,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-01-10 01:23:47,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 107 states have (on average 1.485981308411215) internal successors, (159), 118 states have internal predecessors, (159), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 01:23:47,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 174 transitions. [2025-01-10 01:23:47,608 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 174 transitions. Word has length 12 [2025-01-10 01:23:47,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:47,608 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 174 transitions. [2025-01-10 01:23:47,608 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:47,608 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 174 transitions. [2025-01-10 01:23:47,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 01:23:47,609 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:47,609 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:47,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:23:47,609 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:47,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:47,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1439176181, now seen corresponding path program 1 times [2025-01-10 01:23:47,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:47,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885812223] [2025-01-10 01:23:47,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:47,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:47,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:23:47,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:23:47,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:47,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:47,682 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:47,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:47,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885812223] [2025-01-10 01:23:47,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885812223] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:47,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182802523] [2025-01-10 01:23:47,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:47,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:47,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:47,696 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:47,698 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:47,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:23:47,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:23:47,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:47,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:47,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:23:47,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:47,794 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:47,795 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:23:47,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182802523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:47,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:23:47,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-10 01:23:47,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991990180] [2025-01-10 01:23:47,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:47,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:23:47,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:47,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:23:47,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:23:47,799 INFO L87 Difference]: Start difference. First operand 130 states and 174 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:47,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:47,913 INFO L93 Difference]: Finished difference Result 165 states and 230 transitions. [2025-01-10 01:23:47,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:23:47,913 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:47,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:47,914 INFO L225 Difference]: With dead ends: 165 [2025-01-10 01:23:47,914 INFO L226 Difference]: Without dead ends: 163 [2025-01-10 01:23:47,915 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:47,915 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 25 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:47,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 318 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:47,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-01-10 01:23:47,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 138. [2025-01-10 01:23:47,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 115 states have (on average 1.4695652173913043) internal successors, (169), 126 states have internal predecessors, (169), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 01:23:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 184 transitions. [2025-01-10 01:23:47,923 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 184 transitions. Word has length 13 [2025-01-10 01:23:47,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:47,923 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 184 transitions. [2025-01-10 01:23:47,923 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:47,923 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 184 transitions. [2025-01-10 01:23:47,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 01:23:47,924 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:47,924 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:47,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:23:48,128 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:48,128 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:48,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:48,129 INFO L85 PathProgramCache]: Analyzing trace with hash -612111908, now seen corresponding path program 1 times [2025-01-10 01:23:48,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:48,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437413286] [2025-01-10 01:23:48,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:48,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:48,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:23:48,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:23:48,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:48,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:48,199 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:48,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:48,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437413286] [2025-01-10 01:23:48,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437413286] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:48,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315225948] [2025-01-10 01:23:48,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:48,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:48,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:48,202 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:48,203 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:48,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:23:48,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:23:48,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:48,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:48,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:23:48,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:48,247 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:48,248 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:23:48,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315225948] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:48,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:23:48,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 01:23:48,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081335324] [2025-01-10 01:23:48,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:48,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:23:48,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:48,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:23:48,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:23:48,249 INFO L87 Difference]: Start difference. First operand 138 states and 184 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:48,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:48,291 INFO L93 Difference]: Finished difference Result 143 states and 191 transitions. [2025-01-10 01:23:48,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:23:48,291 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:48,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:48,292 INFO L225 Difference]: With dead ends: 143 [2025-01-10 01:23:48,292 INFO L226 Difference]: Without dead ends: 142 [2025-01-10 01:23:48,292 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:48,292 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 13 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 207 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:48,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 207 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:48,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-01-10 01:23:48,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2025-01-10 01:23:48,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 116 states have (on average 1.4655172413793103) internal successors, (170), 127 states have internal predecessors, (170), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 01:23:48,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 185 transitions. [2025-01-10 01:23:48,299 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 185 transitions. Word has length 13 [2025-01-10 01:23:48,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:48,299 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 185 transitions. [2025-01-10 01:23:48,300 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:48,300 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 185 transitions. [2025-01-10 01:23:48,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 01:23:48,300 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:48,300 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:48,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:23:48,504 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:48,505 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:48,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:48,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1664788732, now seen corresponding path program 1 times [2025-01-10 01:23:48,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:48,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026313986] [2025-01-10 01:23:48,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:48,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:48,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:23:48,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:23:48,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:48,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:48,533 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:48,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:48,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026313986] [2025-01-10 01:23:48,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026313986] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:48,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:48,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:23:48,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377086725] [2025-01-10 01:23:48,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:48,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:23:48,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:48,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:23:48,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:48,538 INFO L87 Difference]: Start difference. First operand 139 states and 185 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:48,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:48,566 INFO L93 Difference]: Finished difference Result 139 states and 185 transitions. [2025-01-10 01:23:48,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:23:48,566 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:48,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:48,567 INFO L225 Difference]: With dead ends: 139 [2025-01-10 01:23:48,567 INFO L226 Difference]: Without dead ends: 138 [2025-01-10 01:23:48,568 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:48,568 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 209 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:48,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 209 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:48,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-01-10 01:23:48,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2025-01-10 01:23:48,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 114 states have (on average 1.456140350877193) internal successors, (166), 124 states have internal predecessors, (166), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 01:23:48,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 181 transitions. [2025-01-10 01:23:48,580 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 181 transitions. Word has length 14 [2025-01-10 01:23:48,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:48,580 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 181 transitions. [2025-01-10 01:23:48,580 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:48,580 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 181 transitions. [2025-01-10 01:23:48,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 01:23:48,581 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:48,581 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:48,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:23:48,581 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:48,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:48,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1792513565, now seen corresponding path program 1 times [2025-01-10 01:23:48,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:48,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907635277] [2025-01-10 01:23:48,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:48,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:48,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:23:48,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:23:48,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:48,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:48,622 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:48,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:48,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907635277] [2025-01-10 01:23:48,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907635277] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:48,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:48,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:23:48,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024446339] [2025-01-10 01:23:48,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:48,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:23:48,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:48,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:23:48,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:48,624 INFO L87 Difference]: Start difference. First operand 136 states and 181 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:48,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:48,655 INFO L93 Difference]: Finished difference Result 261 states and 347 transitions. [2025-01-10 01:23:48,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:23:48,656 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:48,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:48,657 INFO L225 Difference]: With dead ends: 261 [2025-01-10 01:23:48,659 INFO L226 Difference]: Without dead ends: 148 [2025-01-10 01:23:48,659 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:48,660 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 10 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 208 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:48,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 208 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:48,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-01-10 01:23:48,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 138. [2025-01-10 01:23:48,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 116 states have (on average 1.4310344827586208) internal successors, (166), 126 states have internal predecessors, (166), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 01:23:48,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 181 transitions. [2025-01-10 01:23:48,671 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 181 transitions. Word has length 14 [2025-01-10 01:23:48,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:48,672 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 181 transitions. [2025-01-10 01:23:48,672 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:48,672 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 181 transitions. [2025-01-10 01:23:48,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 01:23:48,673 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:48,673 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:48,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:23:48,673 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:48,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:48,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1791397464, now seen corresponding path program 1 times [2025-01-10 01:23:48,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:48,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084326853] [2025-01-10 01:23:48,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:48,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:48,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:23:48,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:23:48,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:48,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:48,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:48,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:48,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084326853] [2025-01-10 01:23:48,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084326853] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:48,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:48,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:23:48,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770576202] [2025-01-10 01:23:48,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:48,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:23:48,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:48,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:23:48,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:23:48,737 INFO L87 Difference]: Start difference. First operand 138 states and 181 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:23:48,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:48,802 INFO L93 Difference]: Finished difference Result 200 states and 264 transitions. [2025-01-10 01:23:48,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:23:48,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-01-10 01:23:48,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:48,804 INFO L225 Difference]: With dead ends: 200 [2025-01-10 01:23:48,804 INFO L226 Difference]: Without dead ends: 198 [2025-01-10 01:23:48,804 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:48,805 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 73 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:48,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 388 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:48,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-01-10 01:23:48,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 167. [2025-01-10 01:23:48,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 144 states have (on average 1.4444444444444444) internal successors, (208), 154 states have internal predecessors, (208), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 01:23:48,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 223 transitions. [2025-01-10 01:23:48,822 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 223 transitions. Word has length 16 [2025-01-10 01:23:48,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:48,822 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 223 transitions. [2025-01-10 01:23:48,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:23:48,822 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 223 transitions. [2025-01-10 01:23:48,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 01:23:48,823 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:48,823 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:48,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:23:48,823 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:48,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:48,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1792134486, now seen corresponding path program 1 times [2025-01-10 01:23:48,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:48,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956637823] [2025-01-10 01:23:48,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:48,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:48,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:23:48,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:23:48,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:48,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:48,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:48,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:48,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956637823] [2025-01-10 01:23:48,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956637823] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:48,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:48,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:23:48,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515052652] [2025-01-10 01:23:48,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:48,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:23:48,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:48,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:23:48,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:23:48,873 INFO L87 Difference]: Start difference. First operand 167 states and 223 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:23:48,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:48,933 INFO L93 Difference]: Finished difference Result 193 states and 255 transitions. [2025-01-10 01:23:48,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:23:48,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-01-10 01:23:48,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:48,934 INFO L225 Difference]: With dead ends: 193 [2025-01-10 01:23:48,935 INFO L226 Difference]: Without dead ends: 191 [2025-01-10 01:23:48,935 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:48,935 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 73 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:48,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 392 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:48,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-01-10 01:23:48,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 174. [2025-01-10 01:23:48,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 151 states have (on average 1.423841059602649) internal successors, (215), 161 states have internal predecessors, (215), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 01:23:48,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 230 transitions. [2025-01-10 01:23:48,948 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 230 transitions. Word has length 16 [2025-01-10 01:23:48,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:48,948 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 230 transitions. [2025-01-10 01:23:48,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:23:48,948 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 230 transitions. [2025-01-10 01:23:48,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 01:23:48,949 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:48,949 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:48,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:23:48,949 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:48,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:48,949 INFO L85 PathProgramCache]: Analyzing trace with hash 71006049, now seen corresponding path program 1 times [2025-01-10 01:23:48,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:48,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820216437] [2025-01-10 01:23:48,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:48,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:48,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:23:48,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:23:48,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:48,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:48,990 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:48,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:48,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820216437] [2025-01-10 01:23:48,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820216437] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:48,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540820523] [2025-01-10 01:23:48,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:48,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:48,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:48,994 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:48,995 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:49,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:23:49,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:23:49,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:49,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:49,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:23:49,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:49,041 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:49,041 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:23:49,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540820523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:49,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:23:49,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-10 01:23:49,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661378621] [2025-01-10 01:23:49,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:49,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:23:49,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:49,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:23:49,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:23:49,043 INFO L87 Difference]: Start difference. First operand 174 states and 230 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:49,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:49,079 INFO L93 Difference]: Finished difference Result 190 states and 254 transitions. [2025-01-10 01:23:49,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:23:49,079 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:49,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:49,080 INFO L225 Difference]: With dead ends: 190 [2025-01-10 01:23:49,080 INFO L226 Difference]: Without dead ends: 189 [2025-01-10 01:23:49,080 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:49,080 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 8 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:49,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 316 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:49,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-01-10 01:23:49,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 169. [2025-01-10 01:23:49,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 146 states have (on average 1.417808219178082) internal successors, (207), 156 states have internal predecessors, (207), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 01:23:49,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 222 transitions. [2025-01-10 01:23:49,106 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 222 transitions. Word has length 15 [2025-01-10 01:23:49,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:49,106 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 222 transitions. [2025-01-10 01:23:49,106 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:49,106 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 222 transitions. [2025-01-10 01:23:49,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 01:23:49,108 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:49,108 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:49,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:23:49,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:49,309 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:49,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:49,309 INFO L85 PathProgramCache]: Analyzing trace with hash 139523297, now seen corresponding path program 1 times [2025-01-10 01:23:49,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:49,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930242519] [2025-01-10 01:23:49,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:49,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:49,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:23:49,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:23:49,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:49,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:49,348 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:49,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:49,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930242519] [2025-01-10 01:23:49,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930242519] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:49,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:49,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:23:49,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790878409] [2025-01-10 01:23:49,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:49,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:23:49,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:49,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:23:49,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:23:49,351 INFO L87 Difference]: Start difference. First operand 169 states and 222 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:49,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:49,419 INFO L93 Difference]: Finished difference Result 187 states and 246 transitions. [2025-01-10 01:23:49,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:23:49,420 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:49,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:49,421 INFO L225 Difference]: With dead ends: 187 [2025-01-10 01:23:49,421 INFO L226 Difference]: Without dead ends: 185 [2025-01-10 01:23:49,421 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:49,421 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 72 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:49,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 381 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:49,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-01-10 01:23:49,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 160. [2025-01-10 01:23:49,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 139 states have (on average 1.410071942446043) internal successors, (196), 147 states have internal predecessors, (196), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 01:23:49,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 211 transitions. [2025-01-10 01:23:49,431 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 211 transitions. Word has length 23 [2025-01-10 01:23:49,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:49,431 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 211 transitions. [2025-01-10 01:23:49,431 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:49,431 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 211 transitions. [2025-01-10 01:23:49,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 01:23:49,432 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:49,432 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:49,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:23:49,432 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:49,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:49,434 INFO L85 PathProgramCache]: Analyzing trace with hash 138786275, now seen corresponding path program 1 times [2025-01-10 01:23:49,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:49,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825404674] [2025-01-10 01:23:49,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:49,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:49,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:23:49,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:23:49,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:49,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:49,463 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:49,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:49,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825404674] [2025-01-10 01:23:49,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825404674] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:49,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:49,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:23:49,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390399964] [2025-01-10 01:23:49,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:49,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:23:49,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:49,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:23:49,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:23:49,465 INFO L87 Difference]: Start difference. First operand 160 states and 211 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:49,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:49,524 INFO L93 Difference]: Finished difference Result 178 states and 235 transitions. [2025-01-10 01:23:49,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:23:49,525 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:49,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:49,526 INFO L225 Difference]: With dead ends: 178 [2025-01-10 01:23:49,526 INFO L226 Difference]: Without dead ends: 176 [2025-01-10 01:23:49,527 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:49,527 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 71 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:49,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 383 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:49,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-01-10 01:23:49,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 150. [2025-01-10 01:23:49,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 131 states have (on average 1.4045801526717556) internal successors, (184), 137 states have internal predecessors, (184), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 01:23:49,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 199 transitions. [2025-01-10 01:23:49,534 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 199 transitions. Word has length 23 [2025-01-10 01:23:49,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:49,534 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 199 transitions. [2025-01-10 01:23:49,534 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:49,534 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 199 transitions. [2025-01-10 01:23:49,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-10 01:23:49,535 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:49,535 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-01-10 01:23:49,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:23:49,535 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:49,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:49,535 INFO L85 PathProgramCache]: Analyzing trace with hash 824792008, now seen corresponding path program 1 times [2025-01-10 01:23:49,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:49,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130846928] [2025-01-10 01:23:49,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:49,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:49,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 01:23:49,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 01:23:49,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:49,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:49,666 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:23:49,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:49,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130846928] [2025-01-10 01:23:49,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130846928] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:49,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799802104] [2025-01-10 01:23:49,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:49,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:49,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:49,668 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:49,669 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:49,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 01:23:49,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 01:23:49,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:49,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:49,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:23:49,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:49,752 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:23:49,752 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:23:49,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799802104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:49,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:23:49,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2025-01-10 01:23:49,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177693636] [2025-01-10 01:23:49,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:49,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:23:49,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:49,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:23:49,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:23:49,754 INFO L87 Difference]: Start difference. First operand 150 states and 199 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 01:23:49,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:49,805 INFO L93 Difference]: Finished difference Result 150 states and 199 transitions. [2025-01-10 01:23:49,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:23:49,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2025-01-10 01:23:49,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:49,807 INFO L225 Difference]: With dead ends: 150 [2025-01-10 01:23:49,807 INFO L226 Difference]: Without dead ends: 149 [2025-01-10 01:23:49,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:23:49,808 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 1 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:49,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 389 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:49,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-01-10 01:23:49,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2025-01-10 01:23:49,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 131 states have (on average 1.3969465648854962) internal successors, (183), 136 states have internal predecessors, (183), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-10 01:23:49,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 198 transitions. [2025-01-10 01:23:49,817 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 198 transitions. Word has length 41 [2025-01-10 01:23:49,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:49,819 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 198 transitions. [2025-01-10 01:23:49,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 01:23:49,819 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 198 transitions. [2025-01-10 01:23:49,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-10 01:23:49,819 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:49,820 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-01-10 01:23:49,828 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:50,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-10 01:23:50,020 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:50,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:50,021 INFO L85 PathProgramCache]: Analyzing trace with hash -201251329, now seen corresponding path program 1 times [2025-01-10 01:23:50,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:50,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45027581] [2025-01-10 01:23:50,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:50,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:50,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 01:23:50,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 01:23:50,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:50,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:50,198 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:23:50,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:50,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45027581] [2025-01-10 01:23:50,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45027581] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:50,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917274461] [2025-01-10 01:23:50,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:50,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:50,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:50,204 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:50,205 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:50,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 01:23:50,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 01:23:50,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:50,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:50,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 01:23:50,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:50,272 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:23:50,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:23:50,392 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:23:50,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917274461] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:23:50,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:23:50,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-01-10 01:23:50,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275888177] [2025-01-10 01:23:50,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:23:50,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:23:50,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:50,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:23:50,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:23:50,394 INFO L87 Difference]: Start difference. First operand 149 states and 198 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-10 01:23:50,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:50,492 INFO L93 Difference]: Finished difference Result 223 states and 291 transitions. [2025-01-10 01:23:50,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:23:50,493 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 42 [2025-01-10 01:23:50,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:50,493 INFO L225 Difference]: With dead ends: 223 [2025-01-10 01:23:50,494 INFO L226 Difference]: Without dead ends: 171 [2025-01-10 01:23:50,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:23:50,494 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 10 mSDsluCounter, 1227 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:50,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1331 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:50,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-01-10 01:23:50,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 162. [2025-01-10 01:23:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 140 states have (on average 1.3785714285714286) internal successors, (193), 146 states have internal predecessors, (193), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-01-10 01:23:50,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 213 transitions. [2025-01-10 01:23:50,502 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 213 transitions. Word has length 42 [2025-01-10 01:23:50,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:50,502 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 213 transitions. [2025-01-10 01:23:50,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-10 01:23:50,502 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 213 transitions. [2025-01-10 01:23:50,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 01:23:50,503 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:50,503 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-01-10 01:23:50,514 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:50,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-10 01:23:50,709 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:50,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:50,710 INFO L85 PathProgramCache]: Analyzing trace with hash -121258184, now seen corresponding path program 1 times [2025-01-10 01:23:50,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:50,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840895823] [2025-01-10 01:23:50,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:50,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:50,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 01:23:50,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 01:23:50,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:50,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:50,860 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:23:50,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:50,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840895823] [2025-01-10 01:23:50,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840895823] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:50,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:50,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 01:23:50,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322419047] [2025-01-10 01:23:50,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:50,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:23:50,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:50,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:23:50,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:23:50,863 INFO L87 Difference]: Start difference. First operand 162 states and 213 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-10 01:23:50,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:50,943 INFO L93 Difference]: Finished difference Result 271 states and 350 transitions. [2025-01-10 01:23:50,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:23:50,943 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2025-01-10 01:23:50,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:50,944 INFO L225 Difference]: With dead ends: 271 [2025-01-10 01:23:50,945 INFO L226 Difference]: Without dead ends: 213 [2025-01-10 01:23:50,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:23:50,946 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 105 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:50,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 849 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:50,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-01-10 01:23:50,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 205. [2025-01-10 01:23:50,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 176 states have (on average 1.3579545454545454) internal successors, (239), 182 states have internal predecessors, (239), 16 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (17), 15 states have call predecessors, (17), 14 states have call successors, (17) [2025-01-10 01:23:50,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 272 transitions. [2025-01-10 01:23:50,961 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 272 transitions. Word has length 50 [2025-01-10 01:23:50,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:50,961 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 272 transitions. [2025-01-10 01:23:50,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-10 01:23:50,961 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 272 transitions. [2025-01-10 01:23:50,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 01:23:50,962 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:50,962 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-01-10 01:23:50,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 01:23:50,962 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:50,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:50,963 INFO L85 PathProgramCache]: Analyzing trace with hash -642194367, now seen corresponding path program 1 times [2025-01-10 01:23:50,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:50,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101537137] [2025-01-10 01:23:50,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:50,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:50,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 01:23:50,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 01:23:50,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:50,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:51,086 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:23:51,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:51,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101537137] [2025-01-10 01:23:51,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101537137] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:51,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214953884] [2025-01-10 01:23:51,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:51,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:51,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:51,091 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:51,093 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:51,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 01:23:51,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 01:23:51,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:51,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:51,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-10 01:23:51,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:51,194 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:23:51,194 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:23:51,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214953884] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:51,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:23:51,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 12 [2025-01-10 01:23:51,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275114558] [2025-01-10 01:23:51,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:51,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:23:51,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:51,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:23:51,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:23:51,195 INFO L87 Difference]: Start difference. First operand 205 states and 272 transitions. Second operand has 10 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 01:23:51,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:51,293 INFO L93 Difference]: Finished difference Result 326 states and 428 transitions. [2025-01-10 01:23:51,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:23:51,293 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 48 [2025-01-10 01:23:51,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:51,294 INFO L225 Difference]: With dead ends: 326 [2025-01-10 01:23:51,294 INFO L226 Difference]: Without dead ends: 274 [2025-01-10 01:23:51,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:23:51,295 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 65 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:51,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1146 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:51,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-01-10 01:23:51,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 258. [2025-01-10 01:23:51,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 220 states have (on average 1.3545454545454545) internal successors, (298), 228 states have internal predecessors, (298), 22 states have call successors, (22), 8 states have call predecessors, (22), 11 states have return successors, (27), 21 states have call predecessors, (27), 19 states have call successors, (27) [2025-01-10 01:23:51,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 347 transitions. [2025-01-10 01:23:51,306 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 347 transitions. Word has length 48 [2025-01-10 01:23:51,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:51,306 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 347 transitions. [2025-01-10 01:23:51,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-10 01:23:51,307 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 347 transitions. [2025-01-10 01:23:51,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-10 01:23:51,307 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:51,307 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1] [2025-01-10 01:23:51,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 01:23:51,512 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:51,512 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:51,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:51,513 INFO L85 PathProgramCache]: Analyzing trace with hash 517822983, now seen corresponding path program 2 times [2025-01-10 01:23:51,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:51,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014270031] [2025-01-10 01:23:51,513 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:23:51,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:51,518 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-01-10 01:23:51,524 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 45 statements. [2025-01-10 01:23:51,524 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:23:51,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:51,731 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:23:51,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:51,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014270031] [2025-01-10 01:23:51,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014270031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:51,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:51,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:23:51,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504640559] [2025-01-10 01:23:51,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:51,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:23:51,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:51,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:23:51,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:23:51,732 INFO L87 Difference]: Start difference. First operand 258 states and 347 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:23:51,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:51,789 INFO L93 Difference]: Finished difference Result 277 states and 374 transitions. [2025-01-10 01:23:51,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:23:51,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2025-01-10 01:23:51,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:51,790 INFO L225 Difference]: With dead ends: 277 [2025-01-10 01:23:51,790 INFO L226 Difference]: Without dead ends: 273 [2025-01-10 01:23:51,791 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:51,791 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 70 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:51,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 243 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:51,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-01-10 01:23:51,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 267. [2025-01-10 01:23:51,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 228 states have (on average 1.3245614035087718) internal successors, (302), 234 states have internal predecessors, (302), 25 states have call successors, (25), 8 states have call predecessors, (25), 11 states have return successors, (30), 24 states have call predecessors, (30), 22 states have call successors, (30) [2025-01-10 01:23:51,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 357 transitions. [2025-01-10 01:23:51,806 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 357 transitions. Word has length 45 [2025-01-10 01:23:51,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:51,806 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 357 transitions. [2025-01-10 01:23:51,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:23:51,807 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 357 transitions. [2025-01-10 01:23:51,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-10 01:23:51,808 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:51,808 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:51,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:23:51,808 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:51,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:51,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1169613291, now seen corresponding path program 1 times [2025-01-10 01:23:51,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:51,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925771110] [2025-01-10 01:23:51,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:51,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:51,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-10 01:23:51,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-10 01:23:51,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:51,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:51,869 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-10 01:23:51,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:51,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925771110] [2025-01-10 01:23:51,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925771110] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:51,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:51,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:23:51,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363174908] [2025-01-10 01:23:51,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:51,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:23:51,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:51,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:23:51,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:51,870 INFO L87 Difference]: Start difference. First operand 267 states and 357 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 01:23:51,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:51,897 INFO L93 Difference]: Finished difference Result 273 states and 364 transitions. [2025-01-10 01:23:51,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:23:51,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2025-01-10 01:23:51,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:51,899 INFO L225 Difference]: With dead ends: 273 [2025-01-10 01:23:51,899 INFO L226 Difference]: Without dead ends: 268 [2025-01-10 01:23:51,899 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:51,900 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 22 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:51,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 159 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:51,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-01-10 01:23:51,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 262. [2025-01-10 01:23:51,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 226 states have (on average 1.2876106194690264) internal successors, (291), 230 states have internal predecessors, (291), 24 states have call successors, (24), 8 states have call predecessors, (24), 11 states have return successors, (29), 23 states have call predecessors, (29), 21 states have call successors, (29) [2025-01-10 01:23:51,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 344 transitions. [2025-01-10 01:23:51,916 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 344 transitions. Word has length 57 [2025-01-10 01:23:51,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:51,916 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 344 transitions. [2025-01-10 01:23:51,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 01:23:51,916 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 344 transitions. [2025-01-10 01:23:51,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-10 01:23:51,917 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:51,918 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:51,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 01:23:51,918 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:51,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:51,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1705970501, now seen corresponding path program 1 times [2025-01-10 01:23:51,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:51,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429391114] [2025-01-10 01:23:51,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:51,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:51,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-10 01:23:51,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-10 01:23:51,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:51,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:51,960 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 01:23:51,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:51,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429391114] [2025-01-10 01:23:51,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429391114] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:51,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:51,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:23:51,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663555237] [2025-01-10 01:23:51,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:51,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:23:51,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:51,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:23:51,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:51,961 INFO L87 Difference]: Start difference. First operand 262 states and 344 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 01:23:51,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:51,998 INFO L93 Difference]: Finished difference Result 517 states and 680 transitions. [2025-01-10 01:23:51,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:23:51,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 75 [2025-01-10 01:23:51,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:52,000 INFO L225 Difference]: With dead ends: 517 [2025-01-10 01:23:52,000 INFO L226 Difference]: Without dead ends: 279 [2025-01-10 01:23:52,001 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:52,001 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 6 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 193 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:52,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 193 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:52,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-01-10 01:23:52,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 267. [2025-01-10 01:23:52,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 231 states have (on average 1.277056277056277) internal successors, (295), 235 states have internal predecessors, (295), 24 states have call successors, (24), 8 states have call predecessors, (24), 11 states have return successors, (29), 23 states have call predecessors, (29), 21 states have call successors, (29) [2025-01-10 01:23:52,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 348 transitions. [2025-01-10 01:23:52,017 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 348 transitions. Word has length 75 [2025-01-10 01:23:52,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:52,018 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 348 transitions. [2025-01-10 01:23:52,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 01:23:52,018 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 348 transitions. [2025-01-10 01:23:52,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-10 01:23:52,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:52,019 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2025-01-10 01:23:52,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 01:23:52,019 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:52,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:52,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1318130781, now seen corresponding path program 1 times [2025-01-10 01:23:52,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:52,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177543498] [2025-01-10 01:23:52,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:52,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:52,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-10 01:23:52,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-10 01:23:52,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:52,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:52,178 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-10 01:23:52,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:52,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177543498] [2025-01-10 01:23:52,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177543498] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:52,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:52,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 01:23:52,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718202495] [2025-01-10 01:23:52,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:52,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:23:52,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:52,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:23:52,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:23:52,180 INFO L87 Difference]: Start difference. First operand 267 states and 348 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-10 01:23:52,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:52,299 INFO L93 Difference]: Finished difference Result 508 states and 667 transitions. [2025-01-10 01:23:52,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:23:52,300 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 74 [2025-01-10 01:23:52,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:52,301 INFO L225 Difference]: With dead ends: 508 [2025-01-10 01:23:52,301 INFO L226 Difference]: Without dead ends: 373 [2025-01-10 01:23:52,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:23:52,302 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 31 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:52,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 667 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:52,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-01-10 01:23:52,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 306. [2025-01-10 01:23:52,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 264 states have (on average 1.2651515151515151) internal successors, (334), 268 states have internal predecessors, (334), 30 states have call successors, (30), 8 states have call predecessors, (30), 11 states have return successors, (35), 29 states have call predecessors, (35), 27 states have call successors, (35) [2025-01-10 01:23:52,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 399 transitions. [2025-01-10 01:23:52,319 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 399 transitions. Word has length 74 [2025-01-10 01:23:52,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:52,320 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 399 transitions. [2025-01-10 01:23:52,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-10 01:23:52,320 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 399 transitions. [2025-01-10 01:23:52,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-10 01:23:52,321 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:52,321 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2025-01-10 01:23:52,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:23:52,322 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:52,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:52,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1096016200, now seen corresponding path program 1 times [2025-01-10 01:23:52,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:52,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330311636] [2025-01-10 01:23:52,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:52,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:52,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-10 01:23:52,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-10 01:23:52,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:52,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:52,445 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:52,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:52,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330311636] [2025-01-10 01:23:52,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330311636] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:52,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779391922] [2025-01-10 01:23:52,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:52,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:52,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:52,449 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:52,453 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:52,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-10 01:23:52,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-10 01:23:52,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:52,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:52,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:23:52,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:52,684 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:23:52,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:23:52,994 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:23:52,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779391922] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:23:52,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:23:52,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 24 [2025-01-10 01:23:52,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855928205] [2025-01-10 01:23:52,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:23:52,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 01:23:52,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:52,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 01:23:52,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2025-01-10 01:23:52,997 INFO L87 Difference]: Start difference. First operand 306 states and 399 transitions. Second operand has 24 states, 23 states have (on average 3.260869565217391) internal successors, (75), 18 states have internal predecessors, (75), 6 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (15), 8 states have call predecessors, (15), 5 states have call successors, (15) [2025-01-10 01:23:53,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:53,641 INFO L93 Difference]: Finished difference Result 657 states and 837 transitions. [2025-01-10 01:23:53,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-01-10 01:23:53,642 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.260869565217391) internal successors, (75), 18 states have internal predecessors, (75), 6 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (15), 8 states have call predecessors, (15), 5 states have call successors, (15) Word has length 75 [2025-01-10 01:23:53,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:53,644 INFO L225 Difference]: With dead ends: 657 [2025-01-10 01:23:53,644 INFO L226 Difference]: Without dead ends: 464 [2025-01-10 01:23:53,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=1525, Unknown=0, NotChecked=0, Total=1722 [2025-01-10 01:23:53,646 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 291 mSDsluCounter, 2946 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 3143 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:53,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 3143 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 01:23:53,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-01-10 01:23:53,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 298. [2025-01-10 01:23:53,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 260 states have (on average 1.2653846153846153) internal successors, (329), 263 states have internal predecessors, (329), 27 states have call successors, (27), 8 states have call predecessors, (27), 10 states have return successors, (32), 26 states have call predecessors, (32), 25 states have call successors, (32) [2025-01-10 01:23:53,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 388 transitions. [2025-01-10 01:23:53,665 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 388 transitions. Word has length 75 [2025-01-10 01:23:53,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:53,666 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 388 transitions. [2025-01-10 01:23:53,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.260869565217391) internal successors, (75), 18 states have internal predecessors, (75), 6 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (15), 8 states have call predecessors, (15), 5 states have call successors, (15) [2025-01-10 01:23:53,666 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 388 transitions. [2025-01-10 01:23:53,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-10 01:23:53,669 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:53,669 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:53,677 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:53,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:53,873 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:53,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:53,874 INFO L85 PathProgramCache]: Analyzing trace with hash -2027113859, now seen corresponding path program 1 times [2025-01-10 01:23:53,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:53,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110528972] [2025-01-10 01:23:53,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:53,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:53,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-10 01:23:53,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-10 01:23:53,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:53,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:54,041 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:23:54,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:54,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110528972] [2025-01-10 01:23:54,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110528972] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:54,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:54,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 01:23:54,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050691325] [2025-01-10 01:23:54,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:54,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:23:54,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:54,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:23:54,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:23:54,043 INFO L87 Difference]: Start difference. First operand 298 states and 388 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 01:23:54,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:54,085 INFO L93 Difference]: Finished difference Result 419 states and 539 transitions. [2025-01-10 01:23:54,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:23:54,085 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 67 [2025-01-10 01:23:54,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:54,086 INFO L225 Difference]: With dead ends: 419 [2025-01-10 01:23:54,086 INFO L226 Difference]: Without dead ends: 309 [2025-01-10 01:23:54,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:23:54,087 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 7 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:54,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 696 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:54,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-01-10 01:23:54,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 304. [2025-01-10 01:23:54,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 265 states have (on average 1.260377358490566) internal successors, (334), 268 states have internal predecessors, (334), 27 states have call successors, (27), 9 states have call predecessors, (27), 11 states have return successors, (31), 26 states have call predecessors, (31), 25 states have call successors, (31) [2025-01-10 01:23:54,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 392 transitions. [2025-01-10 01:23:54,100 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 392 transitions. Word has length 67 [2025-01-10 01:23:54,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:54,100 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 392 transitions. [2025-01-10 01:23:54,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 01:23:54,101 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 392 transitions. [2025-01-10 01:23:54,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-10 01:23:54,102 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:54,102 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:54,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 01:23:54,102 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:54,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:54,102 INFO L85 PathProgramCache]: Analyzing trace with hash -106732615, now seen corresponding path program 1 times [2025-01-10 01:23:54,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:54,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275688945] [2025-01-10 01:23:54,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:54,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:54,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-10 01:23:54,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-10 01:23:54,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:54,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:54,187 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-10 01:23:54,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:54,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275688945] [2025-01-10 01:23:54,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275688945] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:54,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:54,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:23:54,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366629125] [2025-01-10 01:23:54,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:54,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:23:54,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:54,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:23:54,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:23:54,188 INFO L87 Difference]: Start difference. First operand 304 states and 392 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 01:23:54,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:54,214 INFO L93 Difference]: Finished difference Result 314 states and 407 transitions. [2025-01-10 01:23:54,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:23:54,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 70 [2025-01-10 01:23:54,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:54,217 INFO L225 Difference]: With dead ends: 314 [2025-01-10 01:23:54,217 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:23:54,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:23:54,218 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 22 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:54,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 223 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:54,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:23:54,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:23:54,219 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:54,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:23:54,219 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2025-01-10 01:23:54,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:54,219 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:23:54,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 01:23:54,219 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:23:54,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:23:54,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2025-01-10 01:23:54,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-01-10 01:23:54,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-01-10 01:23:54,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2025-01-10 01:23:54,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-01-10 01:23:54,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-01-10 01:23:54,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-01-10 01:23:54,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-01-10 01:23:54,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-01-10 01:23:54,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-01-10 01:23:54,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-01-10 01:23:54,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-01-10 01:23:54,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-01-10 01:23:54,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-01-10 01:23:54,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-01-10 01:23:54,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-01-10 01:23:54,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 01:23:54,226 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] [2025-01-10 01:23:54,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:23:55,378 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:23:55,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:23:55 BoogieIcfgContainer [2025-01-10 01:23:55,391 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:23:55,391 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:23:55,392 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:23:55,392 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:23:55,393 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:47" (3/4) ... [2025-01-10 01:23:55,394 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:23:55,399 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2025-01-10 01:23:55,399 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure addflt [2025-01-10 01:23:55,399 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-01-10 01:23:55,404 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2025-01-10 01:23:55,405 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-01-10 01:23:55,405 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 01:23:55,405 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 01:23:55,423 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= (2147483649 + e)) || (\old(e) != 0))) && (e <= 127)) && (m <= 33554431)) [2025-01-10 01:23:55,424 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) && (e <= 127)) [2025-01-10 01:23:55,446 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) && (e <= 127)) [2025-01-10 01:23:55,446 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= (2147483649 + e)) || (\old(e) != 0))) && (e <= 127)) && (m <= 33554431)) [2025-01-10 01:23:55,476 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:23:55,476 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:23:55,476 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:23:55,478 INFO L158 Benchmark]: Toolchain (without parser) took 9245.23ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 123.2MB in the beginning and 202.9MB in the end (delta: -79.7MB). Peak memory consumption was 151.2MB. Max. memory is 16.1GB. [2025-01-10 01:23:55,478 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:23:55,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.21ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 110.1MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:23:55,480 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.78ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 109.0MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:23:55,481 INFO L158 Benchmark]: Boogie Preprocessor took 43.41ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 107.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:23:55,481 INFO L158 Benchmark]: RCFGBuilder took 515.84ms. Allocated memory is still 167.8MB. Free memory was 107.2MB in the beginning and 84.9MB in the end (delta: 22.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:23:55,481 INFO L158 Benchmark]: TraceAbstraction took 8314.12ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 84.8MB in the beginning and 211.1MB in the end (delta: -126.3MB). Peak memory consumption was 153.9MB. Max. memory is 16.1GB. [2025-01-10 01:23:55,482 INFO L158 Benchmark]: Witness Printer took 85.03ms. Allocated memory is still 402.7MB. Free memory was 211.1MB in the beginning and 202.9MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:23:55,483 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.20ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.21ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 110.1MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.78ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 109.0MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.41ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 107.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 515.84ms. Allocated memory is still 167.8MB. Free memory was 107.2MB in the beginning and 84.9MB in the end (delta: 22.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8314.12ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 84.8MB in the beginning and 211.1MB in the end (delta: -126.3MB). Peak memory consumption was 153.9MB. Max. memory is 16.1GB. * Witness Printer took 85.03ms. Allocated memory is still 402.7MB. Free memory was 211.1MB in the beginning and 202.9MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 112]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 112]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: 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 4 procedures, 107 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 22, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1089 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1056 mSDsluCounter, 12402 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9911 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1876 IncrementalHoareTripleChecker+Invalid, 1966 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 2491 mSDtfsCounter, 1876 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 522 GetRequests, 374 SyntacticMatches, 1 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=306occurred in iteration=19, InterpolantAutomatonStates: 148, 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, 22 MinimizatonAttempts, 464 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1058 NumberOfCodeBlocks, 1041 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1144 ConstructedInterpolants, 0 QuantifiedInterpolants, 1964 SizeOfPredicates, 6 NumberOfNonLiveVariables, 784 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 31 InterpolantComputations, 20 PerfectInterpolantSequences, 384/411 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 16 specifications checked. All of them hold - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) && (e <= 127)) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: (((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= (2147483649 + e)) || (\old(e) != 0))) && (e <= 127)) && (m <= 33554431)) RESULT: Ultimate proved your program to be correct! [2025-01-10 01:23:55,501 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