./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_5.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_5.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 dd739e073fd22ceb2879e867de327b334b7eea402e53d4a8f9e32eed7e4110d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 13:22:48,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:22:48,272 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 13:22:48,278 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:22:48,278 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:22:48,309 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:22:48,310 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:22:48,310 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:22:48,310 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:22:48,311 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:22:48,311 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:22:48,311 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:22:48,311 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:22:48,311 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:22:48,311 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:22:48,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:22:48,311 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 13:22:48,313 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:22:48,314 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:22:48,314 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:22:48,314 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:22:48,314 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 13:22:48,314 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:22:48,315 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 13:22:48,315 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 13:22:48,315 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:22:48,315 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:22:48,315 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 13:22:48,315 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:22:48,315 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:22:48,316 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:22:48,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:22:48,316 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:22:48,316 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:22:48,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:22:48,316 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:22:48,316 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:22:48,317 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 13:22:48,317 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 13:22:48,317 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:22:48,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:22:48,317 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:22:48,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:22:48,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:22:48,318 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:22:48,318 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 -> dd739e073fd22ceb2879e867de327b334b7eea402e53d4a8f9e32eed7e4110d8 [2025-02-06 13:22:48,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:22:48,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:22:48,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:22:48,626 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:22:48,626 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:22:48,628 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_5.c.cil.c [2025-02-06 13:22:49,859 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e5603292/a0726f57c73347ba94b74b12cf053e56/FLAG6fe92bcb1 [2025-02-06 13:22:50,093 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:22:50,097 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5.c.cil.c [2025-02-06 13:22:50,105 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e5603292/a0726f57c73347ba94b74b12cf053e56/FLAG6fe92bcb1 [2025-02-06 13:22:50,117 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e5603292/a0726f57c73347ba94b74b12cf053e56 [2025-02-06 13:22:50,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:22:50,121 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:22:50,122 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:22:50,122 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:22:50,126 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:22:50,126 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:22:50" (1/1) ... [2025-02-06 13:22:50,127 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41d319fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:50, skipping insertion in model container [2025-02-06 13:22:50,127 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:22:50" (1/1) ... [2025-02-06 13:22:50,147 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:22:50,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:22:50,355 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:22:50,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:22:50,414 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:22:50,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:50 WrapperNode [2025-02-06 13:22:50,415 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:22:50,416 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:22:50,416 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:22:50,416 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:22:50,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:50" (1/1) ... [2025-02-06 13:22:50,428 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:50" (1/1) ... [2025-02-06 13:22:50,447 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 169 [2025-02-06 13:22:50,448 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:22:50,448 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:22:50,448 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:22:50,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:22:50,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:50" (1/1) ... [2025-02-06 13:22:50,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:50" (1/1) ... [2025-02-06 13:22:50,457 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:50" (1/1) ... [2025-02-06 13:22:50,472 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 13:22:50,472 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:50" (1/1) ... [2025-02-06 13:22:50,473 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:50" (1/1) ... [2025-02-06 13:22:50,479 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:50" (1/1) ... [2025-02-06 13:22:50,480 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:50" (1/1) ... [2025-02-06 13:22:50,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:50" (1/1) ... [2025-02-06 13:22:50,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:50" (1/1) ... [2025-02-06 13:22:50,486 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:22:50,487 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:22:50,487 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:22:50,487 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:22:50,488 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:50" (1/1) ... [2025-02-06 13:22:50,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:22:50,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:50,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 13:22:50,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 13:22:50,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:22:50,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:22:50,542 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-02-06 13:22:50,542 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-02-06 13:22:50,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:22:50,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:22:50,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 13:22:50,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 13:22:50,603 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:22:50,605 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:22:51,091 INFO L? ?]: Removed 85 outVars from TransFormulas that were not future-live. [2025-02-06 13:22:51,092 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:22:51,124 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:22:51,125 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:22:51,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:22:51 BoogieIcfgContainer [2025-02-06 13:22:51,125 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:22:51,127 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:22:51,127 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:22:51,132 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:22:51,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:22:50" (1/3) ... [2025-02-06 13:22:51,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31415d8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:22:51, skipping insertion in model container [2025-02-06 13:22:51,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:22:50" (2/3) ... [2025-02-06 13:22:51,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31415d8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:22:51, skipping insertion in model container [2025-02-06 13:22:51,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:22:51" (3/3) ... [2025-02-06 13:22:51,137 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_5.c.cil.c [2025-02-06 13:22:51,150 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:22:51,151 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_5.c.cil.c that has 3 procedures, 124 locations, 1 initial locations, 2 loop locations, and 24 error locations. [2025-02-06 13:22:51,195 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:22:51,210 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;@7fa2b30d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:22:51,211 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-02-06 13:22:51,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 91 states have (on average 1.6263736263736264) internal successors, (148), 117 states have internal predecessors, (148), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 13:22:51,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 13:22:51,222 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:51,222 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:51,223 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:51,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:51,229 INFO L85 PathProgramCache]: Analyzing trace with hash 950840293, now seen corresponding path program 1 times [2025-02-06 13:22:51,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:51,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676815165] [2025-02-06 13:22:51,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:51,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:51,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 13:22:51,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 13:22:51,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:51,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:51,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:22:51,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:51,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676815165] [2025-02-06 13:22:51,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676815165] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:51,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:51,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:51,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450878671] [2025-02-06 13:22:51,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:51,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:22:51,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:51,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:22:51,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:22:51,481 INFO L87 Difference]: Start difference. First operand has 124 states, 91 states have (on average 1.6263736263736264) internal successors, (148), 117 states have internal predecessors, (148), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:51,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:51,629 INFO L93 Difference]: Finished difference Result 292 states and 387 transitions. [2025-02-06 13:22:51,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:22:51,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 13:22:51,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:51,642 INFO L225 Difference]: With dead ends: 292 [2025-02-06 13:22:51,642 INFO L226 Difference]: Without dead ends: 148 [2025-02-06 13:22:51,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:22:51,651 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 69 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:51,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 381 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:51,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-02-06 13:22:51,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 136. [2025-02-06 13:22:51,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 110 states have (on average 1.490909090909091) internal successors, (164), 129 states have internal predecessors, (164), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:51,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 172 transitions. [2025-02-06 13:22:51,694 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 172 transitions. Word has length 9 [2025-02-06 13:22:51,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:51,694 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 172 transitions. [2025-02-06 13:22:51,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:51,695 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 172 transitions. [2025-02-06 13:22:51,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 13:22:51,696 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:51,696 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:51,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:22:51,697 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:51,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:51,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1506931202, now seen corresponding path program 1 times [2025-02-06 13:22:51,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:51,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807288057] [2025-02-06 13:22:51,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:51,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:51,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 13:22:51,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 13:22:51,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:51,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:51,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:22:51,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:51,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807288057] [2025-02-06 13:22:51,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807288057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:51,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:51,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:22:51,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766133963] [2025-02-06 13:22:51,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:51,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:51,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:51,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:51,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:51,777 INFO L87 Difference]: Start difference. First operand 136 states and 172 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-02-06 13:22:51,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:51,838 INFO L93 Difference]: Finished difference Result 136 states and 172 transitions. [2025-02-06 13:22:51,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:51,839 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-02-06 13:22:51,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:51,840 INFO L225 Difference]: With dead ends: 136 [2025-02-06 13:22:51,840 INFO L226 Difference]: Without dead ends: 135 [2025-02-06 13:22:51,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:51,845 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:51,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 193 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:51,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-06 13:22:51,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-02-06 13:22:51,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 110 states have (on average 1.4727272727272727) internal successors, (162), 128 states have internal predecessors, (162), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:51,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 170 transitions. [2025-02-06 13:22:51,855 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 170 transitions. Word has length 14 [2025-02-06 13:22:51,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:51,856 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 170 transitions. [2025-02-06 13:22:51,856 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-02-06 13:22:51,856 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 170 transitions. [2025-02-06 13:22:51,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 13:22:51,857 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:51,857 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:51,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:22:51,857 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:51,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:51,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1506917297, now seen corresponding path program 1 times [2025-02-06 13:22:51,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:51,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672050447] [2025-02-06 13:22:51,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:51,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:51,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 13:22:51,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 13:22:51,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:51,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:51,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:22:51,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:51,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672050447] [2025-02-06 13:22:51,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672050447] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:51,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:51,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:51,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755536713] [2025-02-06 13:22:51,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:51,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:51,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:51,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:51,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:51,915 INFO L87 Difference]: Start difference. First operand 135 states and 170 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-02-06 13:22:51,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:51,961 INFO L93 Difference]: Finished difference Result 275 states and 350 transitions. [2025-02-06 13:22:51,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:51,961 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-02-06 13:22:51,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:51,963 INFO L225 Difference]: With dead ends: 275 [2025-02-06 13:22:51,963 INFO L226 Difference]: Without dead ends: 143 [2025-02-06 13:22:51,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:51,965 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 11 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:51,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 203 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:22:51,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-02-06 13:22:51,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2025-02-06 13:22:51,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 110 states have (on average 1.4545454545454546) internal successors, (160), 128 states have internal predecessors, (160), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:51,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 168 transitions. [2025-02-06 13:22:51,985 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 168 transitions. Word has length 14 [2025-02-06 13:22:51,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:51,985 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 168 transitions. [2025-02-06 13:22:51,986 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-02-06 13:22:51,989 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 168 transitions. [2025-02-06 13:22:51,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 13:22:51,990 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:51,990 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:51,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:22:51,991 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:51,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:51,991 INFO L85 PathProgramCache]: Analyzing trace with hash 529772992, now seen corresponding path program 1 times [2025-02-06 13:22:51,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:51,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129342813] [2025-02-06 13:22:51,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:51,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:51,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:22:52,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:22:52,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:52,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:52,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:22:52,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:52,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129342813] [2025-02-06 13:22:52,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129342813] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:22:52,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645114975] [2025-02-06 13:22:52,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:52,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:52,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:52,077 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:22:52,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 13:22:52,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:22:52,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:22:52,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:52,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:52,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 13:22:52,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:22:52,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:22:52,171 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:22:52,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645114975] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:52,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:22:52,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-06 13:22:52,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740023880] [2025-02-06 13:22:52,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:52,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:52,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:52,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:52,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:22:52,173 INFO L87 Difference]: Start difference. First operand 135 states and 168 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-02-06 13:22:52,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:52,230 INFO L93 Difference]: Finished difference Result 143 states and 178 transitions. [2025-02-06 13:22:52,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:52,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-02-06 13:22:52,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:52,232 INFO L225 Difference]: With dead ends: 143 [2025-02-06 13:22:52,232 INFO L226 Difference]: Without dead ends: 142 [2025-02-06 13:22:52,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:22:52,233 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 16 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:52,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 171 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:22:52,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-06 13:22:52,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 137. [2025-02-06 13:22:52,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 112 states have (on average 1.4464285714285714) internal successors, (162), 130 states have internal predecessors, (162), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:52,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 170 transitions. [2025-02-06 13:22:52,242 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 170 transitions. Word has length 15 [2025-02-06 13:22:52,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:52,242 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 170 transitions. [2025-02-06 13:22:52,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-02-06 13:22:52,242 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 170 transitions. [2025-02-06 13:22:52,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 13:22:52,243 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:52,243 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:52,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 13:22:52,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:52,444 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:52,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:52,444 INFO L85 PathProgramCache]: Analyzing trace with hash 530354974, now seen corresponding path program 1 times [2025-02-06 13:22:52,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:52,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212595881] [2025-02-06 13:22:52,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:52,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:52,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:22:52,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:22:52,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:52,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:52,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:22:52,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:52,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212595881] [2025-02-06 13:22:52,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212595881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:52,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:52,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:22:52,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894331538] [2025-02-06 13:22:52,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:52,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:22:52,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:52,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:22:52,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:22:52,530 INFO L87 Difference]: Start difference. First operand 137 states and 170 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:52,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:52,656 INFO L93 Difference]: Finished difference Result 299 states and 371 transitions. [2025-02-06 13:22:52,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:22:52,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-06 13:22:52,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:52,659 INFO L225 Difference]: With dead ends: 299 [2025-02-06 13:22:52,659 INFO L226 Difference]: Without dead ends: 165 [2025-02-06 13:22:52,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:22:52,660 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 109 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:52,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 282 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:52,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-06 13:22:52,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 150. [2025-02-06 13:22:52,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 125 states have (on average 1.416) internal successors, (177), 143 states have internal predecessors, (177), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:52,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 185 transitions. [2025-02-06 13:22:52,675 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 185 transitions. Word has length 15 [2025-02-06 13:22:52,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:52,675 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 185 transitions. [2025-02-06 13:22:52,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:52,675 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 185 transitions. [2025-02-06 13:22:52,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 13:22:52,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:52,676 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:52,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 13:22:52,676 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:52,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:52,677 INFO L85 PathProgramCache]: Analyzing trace with hash -738865006, now seen corresponding path program 1 times [2025-02-06 13:22:52,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:52,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962198504] [2025-02-06 13:22:52,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:52,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:52,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 13:22:52,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 13:22:52,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:52,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:52,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:22:52,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:52,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962198504] [2025-02-06 13:22:52,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962198504] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:52,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:52,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:22:52,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341383858] [2025-02-06 13:22:52,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:52,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:22:52,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:52,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:22:52,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:22:52,750 INFO L87 Difference]: Start difference. First operand 150 states and 185 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:52,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:52,862 INFO L93 Difference]: Finished difference Result 159 states and 189 transitions. [2025-02-06 13:22:52,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:22:52,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (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 16 [2025-02-06 13:22:52,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:52,865 INFO L225 Difference]: With dead ends: 159 [2025-02-06 13:22:52,865 INFO L226 Difference]: Without dead ends: 157 [2025-02-06 13:22:52,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 13:22:52,866 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 73 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:52,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 352 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:52,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-06 13:22:52,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 150. [2025-02-06 13:22:52,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 125 states have (on average 1.392) internal successors, (174), 143 states have internal predecessors, (174), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:52,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 182 transitions. [2025-02-06 13:22:52,879 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 182 transitions. Word has length 16 [2025-02-06 13:22:52,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:52,880 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 182 transitions. [2025-02-06 13:22:52,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:52,880 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 182 transitions. [2025-02-06 13:22:52,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 13:22:52,880 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:52,881 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:52,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 13:22:52,881 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:52,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:52,882 INFO L85 PathProgramCache]: Analyzing trace with hash -638535235, now seen corresponding path program 1 times [2025-02-06 13:22:52,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:52,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594488899] [2025-02-06 13:22:52,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:52,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:52,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 13:22:52,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 13:22:52,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:52,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:52,925 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 13:22:52,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:52,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594488899] [2025-02-06 13:22:52,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594488899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:52,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:52,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:22:52,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996190755] [2025-02-06 13:22:52,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:52,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:22:52,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:52,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:22:52,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:52,926 INFO L87 Difference]: Start difference. First operand 150 states and 182 transitions. Second operand has 3 states, 2 states have (on average 6.5) 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-02-06 13:22:52,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:52,971 INFO L93 Difference]: Finished difference Result 150 states and 182 transitions. [2025-02-06 13:22:52,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:22:52,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) 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 16 [2025-02-06 13:22:52,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:52,973 INFO L225 Difference]: With dead ends: 150 [2025-02-06 13:22:52,973 INFO L226 Difference]: Without dead ends: 149 [2025-02-06 13:22:52,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:22:52,974 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 2 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:52,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 186 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:22:52,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-02-06 13:22:52,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2025-02-06 13:22:52,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 140 states have internal predecessors, (170), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:52,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 178 transitions. [2025-02-06 13:22:52,986 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 178 transitions. Word has length 16 [2025-02-06 13:22:52,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:52,987 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 178 transitions. [2025-02-06 13:22:52,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) 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-02-06 13:22:52,987 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 178 transitions. [2025-02-06 13:22:52,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 13:22:52,988 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:52,988 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:52,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 13:22:52,988 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:52,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:52,989 INFO L85 PathProgramCache]: Analyzing trace with hash -175620489, now seen corresponding path program 1 times [2025-02-06 13:22:52,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:52,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208115177] [2025-02-06 13:22:52,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:52,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:52,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 13:22:53,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 13:22:53,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:53,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:53,039 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:22:53,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:53,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208115177] [2025-02-06 13:22:53,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208115177] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:53,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:53,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 13:22:53,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044294347] [2025-02-06 13:22:53,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:53,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:22:53,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:53,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:22:53,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:22:53,042 INFO L87 Difference]: Start difference. First operand 147 states and 178 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:53,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:53,096 INFO L93 Difference]: Finished difference Result 147 states and 178 transitions. [2025-02-06 13:22:53,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:22:53,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 20 [2025-02-06 13:22:53,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:53,097 INFO L225 Difference]: With dead ends: 147 [2025-02-06 13:22:53,097 INFO L226 Difference]: Without dead ends: 144 [2025-02-06 13:22:53,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:22:53,098 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 11 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:53,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 177 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:22:53,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-02-06 13:22:53,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 136. [2025-02-06 13:22:53,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 115 states have (on average 1.3478260869565217) internal successors, (155), 129 states have internal predecessors, (155), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:53,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 163 transitions. [2025-02-06 13:22:53,112 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 163 transitions. Word has length 20 [2025-02-06 13:22:53,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:53,112 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 163 transitions. [2025-02-06 13:22:53,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:22:53,112 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 163 transitions. [2025-02-06 13:22:53,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 13:22:53,113 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:53,113 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:53,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 13:22:53,113 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:53,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:53,117 INFO L85 PathProgramCache]: Analyzing trace with hash -547318405, now seen corresponding path program 1 times [2025-02-06 13:22:53,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:53,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551563904] [2025-02-06 13:22:53,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:53,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:53,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 13:22:53,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 13:22:53,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:53,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:53,175 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 13:22:53,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:53,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551563904] [2025-02-06 13:22:53,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551563904] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:53,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:53,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:22:53,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863996777] [2025-02-06 13:22:53,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:53,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:22:53,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:53,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:22:53,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:22:53,177 INFO L87 Difference]: Start difference. First operand 136 states and 163 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (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-02-06 13:22:53,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:53,283 INFO L93 Difference]: Finished difference Result 182 states and 219 transitions. [2025-02-06 13:22:53,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:22:53,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (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 24 [2025-02-06 13:22:53,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:53,286 INFO L225 Difference]: With dead ends: 182 [2025-02-06 13:22:53,286 INFO L226 Difference]: Without dead ends: 180 [2025-02-06 13:22:53,287 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-02-06 13:22:53,287 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 127 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:53,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 280 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:53,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-02-06 13:22:53,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 165. [2025-02-06 13:22:53,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 143 states have (on average 1.3496503496503496) internal successors, (193), 157 states have internal predecessors, (193), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 201 transitions. [2025-02-06 13:22:53,300 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 201 transitions. Word has length 24 [2025-02-06 13:22:53,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:53,301 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 201 transitions. [2025-02-06 13:22:53,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (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-02-06 13:22:53,301 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 201 transitions. [2025-02-06 13:22:53,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 13:22:53,303 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:53,303 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:53,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 13:22:53,304 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:53,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:53,305 INFO L85 PathProgramCache]: Analyzing trace with hash -546026407, now seen corresponding path program 1 times [2025-02-06 13:22:53,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:53,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620564866] [2025-02-06 13:22:53,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:53,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:53,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 13:22:53,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 13:22:53,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:53,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:53,359 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 13:22:53,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:53,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620564866] [2025-02-06 13:22:53,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620564866] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:53,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:53,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:22:53,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498286723] [2025-02-06 13:22:53,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:53,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:22:53,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:53,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:22:53,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:22:53,361 INFO L87 Difference]: Start difference. First operand 165 states and 201 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (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-02-06 13:22:53,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:53,461 INFO L93 Difference]: Finished difference Result 175 states and 211 transitions. [2025-02-06 13:22:53,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:22:53,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (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 24 [2025-02-06 13:22:53,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:53,463 INFO L225 Difference]: With dead ends: 175 [2025-02-06 13:22:53,463 INFO L226 Difference]: Without dead ends: 174 [2025-02-06 13:22:53,463 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-02-06 13:22:53,464 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 117 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:53,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 283 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:53,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-02-06 13:22:53,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 165. [2025-02-06 13:22:53,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 143 states have (on average 1.3426573426573427) internal successors, (192), 157 states have internal predecessors, (192), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:53,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 200 transitions. [2025-02-06 13:22:53,473 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 200 transitions. Word has length 24 [2025-02-06 13:22:53,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:53,474 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 200 transitions. [2025-02-06 13:22:53,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (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-02-06 13:22:53,474 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 200 transitions. [2025-02-06 13:22:53,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 13:22:53,475 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:53,475 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:53,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 13:22:53,475 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:53,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:53,476 INFO L85 PathProgramCache]: Analyzing trace with hash 2011020117, now seen corresponding path program 1 times [2025-02-06 13:22:53,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:53,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331989553] [2025-02-06 13:22:53,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:53,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:53,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 13:22:53,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 13:22:53,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:53,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:53,521 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 13:22:53,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:53,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331989553] [2025-02-06 13:22:53,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331989553] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:53,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:53,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:22:53,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31820747] [2025-02-06 13:22:53,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:53,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:22:53,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:53,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:22:53,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:22:53,523 INFO L87 Difference]: Start difference. First operand 165 states and 200 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 13:22:53,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:53,638 INFO L93 Difference]: Finished difference Result 175 states and 211 transitions. [2025-02-06 13:22:53,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:22:53,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2025-02-06 13:22:53,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:53,640 INFO L225 Difference]: With dead ends: 175 [2025-02-06 13:22:53,640 INFO L226 Difference]: Without dead ends: 173 [2025-02-06 13:22:53,640 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-02-06 13:22:53,640 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 126 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:53,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 276 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:53,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-02-06 13:22:53,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 159. [2025-02-06 13:22:53,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 139 states have (on average 1.330935251798561) internal successors, (185), 151 states have internal predecessors, (185), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:53,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 193 transitions. [2025-02-06 13:22:53,659 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 193 transitions. Word has length 31 [2025-02-06 13:22:53,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:53,659 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 193 transitions. [2025-02-06 13:22:53,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 13:22:53,660 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 193 transitions. [2025-02-06 13:22:53,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 13:22:53,662 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:53,662 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:53,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 13:22:53,662 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:53,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:53,662 INFO L85 PathProgramCache]: Analyzing trace with hash 2012312115, now seen corresponding path program 1 times [2025-02-06 13:22:53,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:53,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686752832] [2025-02-06 13:22:53,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:53,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:53,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 13:22:53,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 13:22:53,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:53,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:53,720 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 13:22:53,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:53,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686752832] [2025-02-06 13:22:53,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686752832] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:53,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:53,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:22:53,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565197473] [2025-02-06 13:22:53,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:53,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:22:53,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:53,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:22:53,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:22:53,723 INFO L87 Difference]: Start difference. First operand 159 states and 193 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 13:22:53,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:53,822 INFO L93 Difference]: Finished difference Result 168 states and 203 transitions. [2025-02-06 13:22:53,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:22:53,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2025-02-06 13:22:53,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:53,825 INFO L225 Difference]: With dead ends: 168 [2025-02-06 13:22:53,825 INFO L226 Difference]: Without dead ends: 167 [2025-02-06 13:22:53,825 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-02-06 13:22:53,825 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 116 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:53,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 277 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:53,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-02-06 13:22:53,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 158. [2025-02-06 13:22:53,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 139 states have (on average 1.3237410071942446) internal successors, (184), 150 states have internal predecessors, (184), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:53,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 192 transitions. [2025-02-06 13:22:53,837 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 192 transitions. Word has length 31 [2025-02-06 13:22:53,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:53,837 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 192 transitions. [2025-02-06 13:22:53,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 13:22:53,837 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 192 transitions. [2025-02-06 13:22:53,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-06 13:22:53,838 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:53,838 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-06 13:22:53,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 13:22:53,838 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:53,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:53,839 INFO L85 PathProgramCache]: Analyzing trace with hash 946257304, now seen corresponding path program 1 times [2025-02-06 13:22:53,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:53,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311975654] [2025-02-06 13:22:53,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:53,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:53,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 13:22:53,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 13:22:53,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:53,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:53,910 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:22:53,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:53,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311975654] [2025-02-06 13:22:53,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311975654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:53,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:53,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:22:53,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586561612] [2025-02-06 13:22:53,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:53,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:22:53,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:53,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:22:53,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:22:53,913 INFO L87 Difference]: Start difference. First operand 158 states and 192 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:22:53,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:53,999 INFO L93 Difference]: Finished difference Result 341 states and 411 transitions. [2025-02-06 13:22:53,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:22:53,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2025-02-06 13:22:54,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:54,001 INFO L225 Difference]: With dead ends: 341 [2025-02-06 13:22:54,001 INFO L226 Difference]: Without dead ends: 227 [2025-02-06 13:22:54,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:22:54,002 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 62 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:54,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 264 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:54,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-02-06 13:22:54,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 189. [2025-02-06 13:22:54,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 169 states have (on average 1.3136094674556213) internal successors, (222), 180 states have internal predecessors, (222), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:54,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 230 transitions. [2025-02-06 13:22:54,014 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 230 transitions. Word has length 33 [2025-02-06 13:22:54,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:54,014 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 230 transitions. [2025-02-06 13:22:54,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:22:54,015 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 230 transitions. [2025-02-06 13:22:54,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 13:22:54,015 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:54,015 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:54,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 13:22:54,016 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:54,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:54,016 INFO L85 PathProgramCache]: Analyzing trace with hash -932224928, now seen corresponding path program 1 times [2025-02-06 13:22:54,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:54,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474007598] [2025-02-06 13:22:54,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:54,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:54,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 13:22:54,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 13:22:54,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:54,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:54,153 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:22:54,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:54,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474007598] [2025-02-06 13:22:54,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474007598] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:22:54,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104428914] [2025-02-06 13:22:54,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:54,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:54,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:54,156 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:22:54,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 13:22:54,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 13:22:54,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 13:22:54,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:54,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:54,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:22:54,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:22:54,269 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:22:54,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:22:54,438 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:22:54,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104428914] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:22:54,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:22:54,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-02-06 13:22:54,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482736402] [2025-02-06 13:22:54,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:22:54,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 13:22:54,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:54,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 13:22:54,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-02-06 13:22:54,440 INFO L87 Difference]: Start difference. First operand 189 states and 230 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 13:22:54,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:54,687 INFO L93 Difference]: Finished difference Result 732 states and 915 transitions. [2025-02-06 13:22:54,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 13:22:54,688 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2025-02-06 13:22:54,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:54,690 INFO L225 Difference]: With dead ends: 732 [2025-02-06 13:22:54,691 INFO L226 Difference]: Without dead ends: 562 [2025-02-06 13:22:54,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-02-06 13:22:54,693 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 177 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:54,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 497 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 13:22:54,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-02-06 13:22:54,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 229. [2025-02-06 13:22:54,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 209 states have (on average 1.291866028708134) internal successors, (270), 220 states have internal predecessors, (270), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:54,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 278 transitions. [2025-02-06 13:22:54,713 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 278 transitions. Word has length 46 [2025-02-06 13:22:54,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:54,713 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 278 transitions. [2025-02-06 13:22:54,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 13:22:54,714 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 278 transitions. [2025-02-06 13:22:54,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 13:22:54,715 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:54,715 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:54,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 13:22:54,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:54,917 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:54,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:54,918 INFO L85 PathProgramCache]: Analyzing trace with hash -63222667, now seen corresponding path program 1 times [2025-02-06 13:22:54,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:54,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390150781] [2025-02-06 13:22:54,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:54,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:54,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 13:22:54,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 13:22:54,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:54,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:54,998 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 13:22:54,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:54,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390150781] [2025-02-06 13:22:54,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390150781] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:54,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:54,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:22:54,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982806686] [2025-02-06 13:22:54,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:54,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:22:55,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:55,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:22:55,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:22:55,001 INFO L87 Difference]: Start difference. First operand 229 states and 278 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:22:55,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:55,068 INFO L93 Difference]: Finished difference Result 443 states and 536 transitions. [2025-02-06 13:22:55,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:22:55,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2025-02-06 13:22:55,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:55,070 INFO L225 Difference]: With dead ends: 443 [2025-02-06 13:22:55,070 INFO L226 Difference]: Without dead ends: 255 [2025-02-06 13:22:55,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:22:55,071 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 14 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:55,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 290 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 13:22:55,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-02-06 13:22:55,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 229. [2025-02-06 13:22:55,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 209 states have (on average 1.2727272727272727) internal successors, (266), 220 states have internal predecessors, (266), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:55,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 274 transitions. [2025-02-06 13:22:55,103 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 274 transitions. Word has length 49 [2025-02-06 13:22:55,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:55,104 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 274 transitions. [2025-02-06 13:22:55,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:22:55,105 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 274 transitions. [2025-02-06 13:22:55,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-06 13:22:55,105 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:55,105 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:55,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 13:22:55,106 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:55,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:55,106 INFO L85 PathProgramCache]: Analyzing trace with hash -628240507, now seen corresponding path program 1 times [2025-02-06 13:22:55,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:55,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088200416] [2025-02-06 13:22:55,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:55,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:55,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 13:22:55,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 13:22:55,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:55,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:55,224 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:22:55,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:55,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088200416] [2025-02-06 13:22:55,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088200416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:22:55,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:22:55,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 13:22:55,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53170435] [2025-02-06 13:22:55,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:22:55,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 13:22:55,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:55,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 13:22:55,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 13:22:55,227 INFO L87 Difference]: Start difference. First operand 229 states and 274 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:22:55,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:55,360 INFO L93 Difference]: Finished difference Result 440 states and 522 transitions. [2025-02-06 13:22:55,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:22:55,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2025-02-06 13:22:55,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:55,362 INFO L225 Difference]: With dead ends: 440 [2025-02-06 13:22:55,363 INFO L226 Difference]: Without dead ends: 310 [2025-02-06 13:22:55,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:22:55,364 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 48 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:55,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 335 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 13:22:55,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-02-06 13:22:55,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 229. [2025-02-06 13:22:55,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 209 states have (on average 1.2679425837320575) internal successors, (265), 220 states have internal predecessors, (265), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:55,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 273 transitions. [2025-02-06 13:22:55,382 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 273 transitions. Word has length 51 [2025-02-06 13:22:55,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:55,383 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 273 transitions. [2025-02-06 13:22:55,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 13:22:55,384 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 273 transitions. [2025-02-06 13:22:55,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-06 13:22:55,384 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:55,384 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:55,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 13:22:55,385 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:55,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:55,385 INFO L85 PathProgramCache]: Analyzing trace with hash -159934248, now seen corresponding path program 1 times [2025-02-06 13:22:55,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:55,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292377665] [2025-02-06 13:22:55,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:55,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:55,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 13:22:55,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 13:22:55,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:55,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:22:55,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:55,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292377665] [2025-02-06 13:22:55,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292377665] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:22:55,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136873959] [2025-02-06 13:22:55,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:55,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:55,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:55,608 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:22:55,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 13:22:55,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 13:22:55,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 13:22:55,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:55,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:55,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 13:22:55,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:22:56,051 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:22:56,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:22:56,387 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:22:56,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136873959] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:22:56,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:22:56,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9] total 21 [2025-02-06 13:22:56,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321825321] [2025-02-06 13:22:56,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:22:56,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 13:22:56,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:56,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 13:22:56,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2025-02-06 13:22:56,390 INFO L87 Difference]: Start difference. First operand 229 states and 273 transitions. Second operand has 21 states, 21 states have (on average 4.428571428571429) internal successors, (93), 21 states have internal predecessors, (93), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 13:22:57,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:57,308 INFO L93 Difference]: Finished difference Result 652 states and 766 transitions. [2025-02-06 13:22:57,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 13:22:57,309 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.428571428571429) internal successors, (93), 21 states have internal predecessors, (93), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 56 [2025-02-06 13:22:57,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:57,311 INFO L225 Difference]: With dead ends: 652 [2025-02-06 13:22:57,311 INFO L226 Difference]: Without dead ends: 424 [2025-02-06 13:22:57,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=302, Invalid=568, Unknown=0, NotChecked=0, Total=870 [2025-02-06 13:22:57,312 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 154 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:57,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1008 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 13:22:57,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-02-06 13:22:57,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 229. [2025-02-06 13:22:57,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 209 states have (on average 1.244019138755981) internal successors, (260), 220 states have internal predecessors, (260), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:57,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 268 transitions. [2025-02-06 13:22:57,331 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 268 transitions. Word has length 56 [2025-02-06 13:22:57,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:57,331 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 268 transitions. [2025-02-06 13:22:57,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.428571428571429) internal successors, (93), 21 states have internal predecessors, (93), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 13:22:57,332 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 268 transitions. [2025-02-06 13:22:57,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-06 13:22:57,332 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:57,332 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 6, 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] [2025-02-06 13:22:57,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 13:22:57,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:57,537 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:57,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:57,539 INFO L85 PathProgramCache]: Analyzing trace with hash -94755507, now seen corresponding path program 1 times [2025-02-06 13:22:57,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:57,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044953435] [2025-02-06 13:22:57,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:57,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:57,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 13:22:57,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 13:22:57,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:57,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:57,766 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 41 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:22:57,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:57,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044953435] [2025-02-06 13:22:57,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044953435] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:22:57,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074863733] [2025-02-06 13:22:57,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:22:57,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:57,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:57,770 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:22:57,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 13:22:57,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 13:22:57,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 13:22:57,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:22:57,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:57,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 13:22:57,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:22:57,962 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 41 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:22:57,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:22:58,269 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 41 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:22:58,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074863733] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:22:58,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:22:58,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2025-02-06 13:22:58,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373815511] [2025-02-06 13:22:58,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:22:58,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 13:22:58,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:22:58,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 13:22:58,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2025-02-06 13:22:58,272 INFO L87 Difference]: Start difference. First operand 229 states and 268 transitions. Second operand has 26 states, 26 states have (on average 5.230769230769231) internal successors, (136), 26 states have internal predecessors, (136), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 13:22:58,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:22:58,669 INFO L93 Difference]: Finished difference Result 1224 states and 1497 transitions. [2025-02-06 13:22:58,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 13:22:58,669 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.230769230769231) internal successors, (136), 26 states have internal predecessors, (136), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 67 [2025-02-06 13:22:58,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:22:58,675 INFO L225 Difference]: With dead ends: 1224 [2025-02-06 13:22:58,675 INFO L226 Difference]: Without dead ends: 1034 [2025-02-06 13:22:58,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=449, Unknown=0, NotChecked=0, Total=702 [2025-02-06 13:22:58,677 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 699 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 13:22:58,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 431 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 13:22:58,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2025-02-06 13:22:58,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 309. [2025-02-06 13:22:58,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 289 states have (on average 1.231833910034602) internal successors, (356), 300 states have internal predecessors, (356), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:22:58,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 364 transitions. [2025-02-06 13:22:58,703 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 364 transitions. Word has length 67 [2025-02-06 13:22:58,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:22:58,703 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 364 transitions. [2025-02-06 13:22:58,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.230769230769231) internal successors, (136), 26 states have internal predecessors, (136), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 13:22:58,704 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 364 transitions. [2025-02-06 13:22:58,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-06 13:22:58,706 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:22:58,707 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:22:58,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 13:22:58,907 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,SelfDestructingSolverStorable17 [2025-02-06 13:22:58,908 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:22:58,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:22:58,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1387851496, now seen corresponding path program 2 times [2025-02-06 13:22:58,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:22:58,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328609320] [2025-02-06 13:22:58,909 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:22:58,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:22:58,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-02-06 13:22:58,945 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-02-06 13:22:58,950 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:22:58,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:59,236 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 48 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:22:59,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:22:59,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328609320] [2025-02-06 13:22:59,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328609320] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:22:59,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912949354] [2025-02-06 13:22:59,237 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:22:59,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:22:59,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:22:59,239 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:22:59,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 13:22:59,271 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 76 statements into 2 equivalence classes. [2025-02-06 13:22:59,375 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 76 of 76 statements. [2025-02-06 13:22:59,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:22:59,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:22:59,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 13:22:59,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:23:00,395 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 48 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:23:00,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:23:02,022 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 48 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:23:02,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912949354] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:23:02,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:23:02,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17, 16] total 38 [2025-02-06 13:23:02,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286084726] [2025-02-06 13:23:02,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:23:02,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-06 13:23:02,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:23:02,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-06 13:23:02,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=432, Invalid=974, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 13:23:02,028 INFO L87 Difference]: Start difference. First operand 309 states and 364 transitions. Second operand has 38 states, 38 states have (on average 3.9473684210526314) internal successors, (150), 38 states have internal predecessors, (150), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 13:23:08,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:23:08,844 INFO L93 Difference]: Finished difference Result 918 states and 1079 transitions. [2025-02-06 13:23:08,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-02-06 13:23:08,845 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.9473684210526314) internal successors, (150), 38 states have internal predecessors, (150), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 76 [2025-02-06 13:23:08,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:23:08,848 INFO L225 Difference]: With dead ends: 918 [2025-02-06 13:23:08,848 INFO L226 Difference]: Without dead ends: 652 [2025-02-06 13:23:08,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1242 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1124, Invalid=2416, Unknown=0, NotChecked=0, Total=3540 [2025-02-06 13:23:08,850 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 342 mSDsluCounter, 1635 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 1777 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-06 13:23:08,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 1777 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-02-06 13:23:08,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-02-06 13:23:08,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 309. [2025-02-06 13:23:08,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 289 states have (on average 1.2006920415224913) internal successors, (347), 300 states have internal predecessors, (347), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:23:08,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 355 transitions. [2025-02-06 13:23:08,877 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 355 transitions. Word has length 76 [2025-02-06 13:23:08,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:23:08,877 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 355 transitions. [2025-02-06 13:23:08,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.9473684210526314) internal successors, (150), 38 states have internal predecessors, (150), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 13:23:08,877 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 355 transitions. [2025-02-06 13:23:08,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 13:23:08,880 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:23:08,880 INFO L218 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 14, 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] [2025-02-06 13:23:08,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 13:23:09,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:23:09,084 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:23:09,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:23:09,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1198163149, now seen corresponding path program 2 times [2025-02-06 13:23:09,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:23:09,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889480201] [2025-02-06 13:23:09,085 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:23:09,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:23:09,090 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 107 statements into 2 equivalence classes. [2025-02-06 13:23:09,102 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 13:23:09,102 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:23:09,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:23:09,503 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 81 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:23:09,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:23:09,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889480201] [2025-02-06 13:23:09,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889480201] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:23:09,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828296663] [2025-02-06 13:23:09,504 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:23:09,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:23:09,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:23:09,518 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:23:09,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 13:23:09,554 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 107 statements into 2 equivalence classes. [2025-02-06 13:23:09,579 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 13:23:09,580 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:23:09,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:23:09,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 13:23:09,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:23:09,877 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 81 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:23:09,877 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:23:10,561 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 81 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:23:10,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828296663] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:23:10,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:23:10,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 50 [2025-02-06 13:23:10,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338862228] [2025-02-06 13:23:10,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:23:10,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-02-06 13:23:10,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:23:10,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-02-06 13:23:10,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=846, Invalid=1604, Unknown=0, NotChecked=0, Total=2450 [2025-02-06 13:23:10,566 INFO L87 Difference]: Start difference. First operand 309 states and 355 transitions. Second operand has 50 states, 50 states have (on average 5.12) internal successors, (256), 50 states have internal predecessors, (256), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 13:23:11,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 13:23:11,151 INFO L93 Difference]: Finished difference Result 2244 states and 2762 transitions. [2025-02-06 13:23:11,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-06 13:23:11,152 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.12) internal successors, (256), 50 states have internal predecessors, (256), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 107 [2025-02-06 13:23:11,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 13:23:11,159 INFO L225 Difference]: With dead ends: 2244 [2025-02-06 13:23:11,159 INFO L226 Difference]: Without dead ends: 2014 [2025-02-06 13:23:11,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=893, Invalid=1657, Unknown=0, NotChecked=0, Total=2550 [2025-02-06 13:23:11,161 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 1383 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1383 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 13:23:11,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1383 Valid, 773 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 13:23:11,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2025-02-06 13:23:11,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 469. [2025-02-06 13:23:11,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 449 states have (on average 1.200445434298441) internal successors, (539), 460 states have internal predecessors, (539), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 13:23:11,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 547 transitions. [2025-02-06 13:23:11,210 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 547 transitions. Word has length 107 [2025-02-06 13:23:11,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 13:23:11,210 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 547 transitions. [2025-02-06 13:23:11,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.12) internal successors, (256), 50 states have internal predecessors, (256), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 13:23:11,211 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 547 transitions. [2025-02-06 13:23:11,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 13:23:11,212 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 13:23:11,212 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 13, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:23:11,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 13:23:11,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:23:11,413 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-02-06 13:23:11,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:23:11,413 INFO L85 PathProgramCache]: Analyzing trace with hash 2011832728, now seen corresponding path program 3 times [2025-02-06 13:23:11,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:23:11,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834279242] [2025-02-06 13:23:11,414 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:23:11,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:23:11,422 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 116 statements into 15 equivalence classes. [2025-02-06 13:23:11,506 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 13:23:11,506 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-02-06 13:23:11,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:23:12,272 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 88 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:23:12,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:23:12,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834279242] [2025-02-06 13:23:12,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834279242] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:23:12,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200982389] [2025-02-06 13:23:12,273 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 13:23:12,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:23:12,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:23:12,275 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-02-06 13:23:12,278 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-02-06 13:23:12,316 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 116 statements into 15 equivalence classes. [2025-02-06 13:23:12,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 13:23:12,502 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-02-06 13:23:12,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:23:12,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-06 13:23:12,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:23:13,873 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 88 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:23:13,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:23:17,020 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 88 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:23:17,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200982389] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:23:17,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:23:17,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 24, 24] total 61 [2025-02-06 13:23:17,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823264693] [2025-02-06 13:23:17,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:23:17,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-02-06 13:23:17,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:23:17,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-02-06 13:23:17,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1143, Invalid=2517, Unknown=0, NotChecked=0, Total=3660 [2025-02-06 13:23:17,024 INFO L87 Difference]: Start difference. First operand 469 states and 547 transitions. Second operand has 61 states, 61 states have (on average 4.459016393442623) internal successors, (272), 61 states have internal predecessors, (272), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)