./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_5.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-e2fb8be-m [2025-03-09 01:39:04,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:39:04,277 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 01:39:04,283 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:39:04,283 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:39:04,308 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:39:04,309 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:39:04,309 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:39:04,309 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:39:04,309 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:39:04,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:39:04,309 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:39:04,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:39:04,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:39:04,310 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:39:04,310 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:39:04,310 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:39:04,310 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:39:04,310 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:39:04,310 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:39:04,310 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:39:04,310 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:39:04,310 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:39:04,310 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:39:04,310 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:39:04,310 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:39:04,310 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:39:04,310 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:39:04,310 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:39:04,310 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:39:04,311 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:39:04,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:39:04,311 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:39:04,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:39:04,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:39:04,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:39:04,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:39:04,311 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:39:04,311 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:39:04,311 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:39:04,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:39:04,311 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:39:04,311 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:39:04,311 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:39:04,311 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:39:04,311 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/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-03-09 01:39:04,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:39:04,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:39:04,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:39:04,522 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:39:04,522 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:39:04,524 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_5.c.cil.c [2025-03-09 01:39:05,650 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc5702aa5/b267ad4fb29c41ee91cf0a56199f672c/FLAG8f767cca4 [2025-03-09 01:39:05,887 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:39:05,888 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5.c.cil.c [2025-03-09 01:39:05,899 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc5702aa5/b267ad4fb29c41ee91cf0a56199f672c/FLAG8f767cca4 [2025-03-09 01:39:05,915 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc5702aa5/b267ad4fb29c41ee91cf0a56199f672c [2025-03-09 01:39:05,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:39:05,919 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:39:05,922 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:39:05,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:39:05,926 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:39:05,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:39:05" (1/1) ... [2025-03-09 01:39:05,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@577f00f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:39:05, skipping insertion in model container [2025-03-09 01:39:05,929 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:39:05" (1/1) ... [2025-03-09 01:39:05,944 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:39:06,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:39:06,101 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:39:06,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:39:06,155 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:39:06,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:39:06 WrapperNode [2025-03-09 01:39:06,157 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:39:06,158 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:39:06,158 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:39:06,158 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:39:06,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:39:06" (1/1) ... [2025-03-09 01:39:06,170 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:39:06" (1/1) ... [2025-03-09 01:39:06,194 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 169 [2025-03-09 01:39:06,197 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:39:06,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:39:06,198 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:39:06,198 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:39:06,204 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:39:06" (1/1) ... [2025-03-09 01:39:06,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:39:06" (1/1) ... [2025-03-09 01:39:06,205 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:39:06" (1/1) ... [2025-03-09 01:39:06,220 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-03-09 01:39:06,224 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:39:06" (1/1) ... [2025-03-09 01:39:06,224 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:39:06" (1/1) ... [2025-03-09 01:39:06,227 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:39:06" (1/1) ... [2025-03-09 01:39:06,230 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:39:06" (1/1) ... [2025-03-09 01:39:06,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:39:06" (1/1) ... [2025-03-09 01:39:06,231 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:39:06" (1/1) ... [2025-03-09 01:39:06,232 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:39:06,234 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:39:06,234 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:39:06,234 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:39:06,235 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:39:06" (1/1) ... [2025-03-09 01:39:06,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:39:06,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:39:06,260 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:39:06,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:39:06,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:39:06,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:39:06,280 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-03-09 01:39:06,280 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-03-09 01:39:06,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:39:06,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:39:06,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 01:39:06,280 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 01:39:06,327 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:39:06,329 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:39:06,620 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-09 01:39:06,620 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:39:06,643 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:39:06,643 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:39:06,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:39:06 BoogieIcfgContainer [2025-03-09 01:39:06,644 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:39:06,645 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:39:06,645 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:39:06,650 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:39:06,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:39:05" (1/3) ... [2025-03-09 01:39:06,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bdfec3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:39:06, skipping insertion in model container [2025-03-09 01:39:06,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:39:06" (2/3) ... [2025-03-09 01:39:06,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bdfec3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:39:06, skipping insertion in model container [2025-03-09 01:39:06,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:39:06" (3/3) ... [2025-03-09 01:39:06,652 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_5.c.cil.c [2025-03-09 01:39:06,663 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:39:06,664 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_5.c.cil.c that has 3 procedures, 121 locations, 1 initial locations, 2 loop locations, and 24 error locations. [2025-03-09 01:39:06,709 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:39:06,717 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;@68a7e778, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:39:06,717 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-03-09 01:39:06,720 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 89 states have (on average 1.6404494382022472) internal successors, (146), 114 states have internal predecessors, (146), 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-03-09 01:39:06,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 01:39:06,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:06,724 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:06,725 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 01:39:06,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:06,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1548344680, now seen corresponding path program 1 times [2025-03-09 01:39:06,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:06,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414962237] [2025-03-09 01:39:06,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:06,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:06,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:39:06,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:39:06,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:06,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:06,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:39:06,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:06,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414962237] [2025-03-09 01:39:06,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414962237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:06,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:39:06,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:39:06,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914470455] [2025-03-09 01:39:06,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:06,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:39:06,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:06,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:39:06,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:39:06,928 INFO L87 Difference]: Start difference. First operand has 121 states, 89 states have (on average 1.6404494382022472) internal successors, (146), 114 states have internal predecessors, (146), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:39:07,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:07,045 INFO L93 Difference]: Finished difference Result 289 states and 395 transitions. [2025-03-09 01:39:07,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:39:07,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 01:39:07,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:07,052 INFO L225 Difference]: With dead ends: 289 [2025-03-09 01:39:07,052 INFO L226 Difference]: Without dead ends: 151 [2025-03-09 01:39:07,055 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-03-09 01:39:07,057 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 85 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:07,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 370 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:39:07,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-09 01:39:07,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 139. [2025-03-09 01:39:07,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 113 states have (on average 1.5221238938053097) internal successors, (172), 132 states have internal predecessors, (172), 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-03-09 01:39:07,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 180 transitions. [2025-03-09 01:39:07,102 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 180 transitions. Word has length 8 [2025-03-09 01:39:07,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:07,102 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 180 transitions. [2025-03-09 01:39:07,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:39:07,102 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 180 transitions. [2025-03-09 01:39:07,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 01:39:07,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:07,103 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:07,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:39:07,104 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 01:39:07,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:07,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1070457006, now seen corresponding path program 1 times [2025-03-09 01:39:07,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:07,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939957341] [2025-03-09 01:39:07,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:07,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:07,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:39:07,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:39:07,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:07,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:07,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:39:07,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:07,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939957341] [2025-03-09 01:39:07,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939957341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:07,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:39:07,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:39:07,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616936045] [2025-03-09 01:39:07,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:07,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:39:07,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:07,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:39:07,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:39:07,151 INFO L87 Difference]: Start difference. First operand 139 states and 180 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:39:07,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:07,206 INFO L93 Difference]: Finished difference Result 139 states and 180 transitions. [2025-03-09 01:39:07,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:39:07,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-09 01:39:07,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:07,210 INFO L225 Difference]: With dead ends: 139 [2025-03-09 01:39:07,210 INFO L226 Difference]: Without dead ends: 138 [2025-03-09 01:39:07,210 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-03-09 01:39:07,210 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 191 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.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:07,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 191 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:39:07,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-09 01:39:07,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-03-09 01:39:07,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 113 states have (on average 1.5044247787610618) internal successors, (170), 131 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-03-09 01:39:07,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 178 transitions. [2025-03-09 01:39:07,219 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 178 transitions. Word has length 12 [2025-03-09 01:39:07,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:07,219 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 178 transitions. [2025-03-09 01:39:07,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:39:07,219 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 178 transitions. [2025-03-09 01:39:07,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 01:39:07,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:07,222 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:07,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:39:07,222 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 01:39:07,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:07,223 INFO L85 PathProgramCache]: Analyzing trace with hash -738390639, now seen corresponding path program 1 times [2025-03-09 01:39:07,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:07,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236358335] [2025-03-09 01:39:07,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:07,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:07,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:39:07,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:39:07,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:07,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:07,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:39:07,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:07,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236358335] [2025-03-09 01:39:07,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236358335] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:39:07,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086308963] [2025-03-09 01:39:07,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:07,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:39:07,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:39:07,336 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:39:07,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:39:07,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:39:07,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:39:07,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:07,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:07,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:39:07,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:39:07,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:39:07,424 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:39:07,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086308963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:07,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:39:07,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-09 01:39:07,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369532005] [2025-03-09 01:39:07,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:07,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:39:07,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:07,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:39:07,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:39:07,427 INFO L87 Difference]: Start difference. First operand 138 states and 178 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:39:07,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:07,512 INFO L93 Difference]: Finished difference Result 166 states and 224 transitions. [2025-03-09 01:39:07,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:39:07,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-09 01:39:07,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:07,514 INFO L225 Difference]: With dead ends: 166 [2025-03-09 01:39:07,514 INFO L226 Difference]: Without dead ends: 164 [2025-03-09 01:39:07,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:39:07,514 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 31 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:07,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 194 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:39:07,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-09 01:39:07,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 146. [2025-03-09 01:39:07,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 121 states have (on average 1.487603305785124) internal successors, (180), 139 states have internal predecessors, (180), 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-03-09 01:39:07,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 188 transitions. [2025-03-09 01:39:07,530 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 188 transitions. Word has length 13 [2025-03-09 01:39:07,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:07,530 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 188 transitions. [2025-03-09 01:39:07,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:39:07,531 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 188 transitions. [2025-03-09 01:39:07,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 01:39:07,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:07,532 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:07,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:39:07,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:39:07,732 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 01:39:07,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:07,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1175571180, now seen corresponding path program 1 times [2025-03-09 01:39:07,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:07,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776522235] [2025-03-09 01:39:07,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:07,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:07,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:39:07,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:39:07,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:07,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:07,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:39:07,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:07,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776522235] [2025-03-09 01:39:07,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776522235] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:39:07,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612494326] [2025-03-09 01:39:07,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:07,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:39:07,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:39:07,803 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:39:07,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:39:07,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:39:07,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:39:07,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:07,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:07,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:39:07,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:39:07,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:39:07,846 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:39:07,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612494326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:07,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:39:07,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-09 01:39:07,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223818880] [2025-03-09 01:39:07,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:07,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:39:07,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:07,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:39:07,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:39:07,848 INFO L87 Difference]: Start difference. First operand 146 states and 188 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-03-09 01:39:07,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:07,899 INFO L93 Difference]: Finished difference Result 151 states and 195 transitions. [2025-03-09 01:39:07,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:39:07,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-09 01:39:07,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:07,900 INFO L225 Difference]: With dead ends: 151 [2025-03-09 01:39:07,900 INFO L226 Difference]: Without dead ends: 150 [2025-03-09 01:39:07,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:39:07,900 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 16 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:07,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 182 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:39:07,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-09 01:39:07,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2025-03-09 01:39:07,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 122 states have (on average 1.4836065573770492) internal successors, (181), 140 states have internal predecessors, (181), 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-03-09 01:39:07,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 189 transitions. [2025-03-09 01:39:07,908 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 189 transitions. Word has length 13 [2025-03-09 01:39:07,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:07,908 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 189 transitions. [2025-03-09 01:39:07,908 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-03-09 01:39:07,908 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 189 transitions. [2025-03-09 01:39:07,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-09 01:39:07,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:07,909 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:07,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:39:08,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-09 01:39:08,109 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 01:39:08,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:08,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1415273323, now seen corresponding path program 1 times [2025-03-09 01:39:08,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:08,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078519180] [2025-03-09 01:39:08,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:08,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:08,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:39:08,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:39:08,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:08,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:08,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:39:08,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:08,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078519180] [2025-03-09 01:39:08,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078519180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:08,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:39:08,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:39:08,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960938730] [2025-03-09 01:39:08,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:08,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:39:08,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:08,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:39:08,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:39:08,137 INFO L87 Difference]: Start difference. First operand 147 states and 189 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-03-09 01:39:08,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:08,180 INFO L93 Difference]: Finished difference Result 147 states and 189 transitions. [2025-03-09 01:39:08,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:39:08,181 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-03-09 01:39:08,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:08,181 INFO L225 Difference]: With dead ends: 147 [2025-03-09 01:39:08,181 INFO L226 Difference]: Without dead ends: 146 [2025-03-09 01:39:08,182 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-03-09 01:39:08,182 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-03-09 01:39:08,182 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-03-09 01:39:08,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-09 01:39:08,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2025-03-09 01:39:08,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 120 states have (on average 1.475) internal successors, (177), 137 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-03-09 01:39:08,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 185 transitions. [2025-03-09 01:39:08,193 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 185 transitions. Word has length 14 [2025-03-09 01:39:08,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:08,193 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 185 transitions. [2025-03-09 01:39:08,193 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-03-09 01:39:08,193 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 185 transitions. [2025-03-09 01:39:08,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-09 01:39:08,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:08,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:08,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:39:08,194 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 01:39:08,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:08,194 INFO L85 PathProgramCache]: Analyzing trace with hash 797811933, now seen corresponding path program 1 times [2025-03-09 01:39:08,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:08,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901223435] [2025-03-09 01:39:08,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:08,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:08,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:39:08,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:39:08,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:08,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:08,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:39:08,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:08,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901223435] [2025-03-09 01:39:08,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901223435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:08,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:39:08,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:39:08,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274339522] [2025-03-09 01:39:08,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:08,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:39:08,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:08,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:39:08,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:39:08,220 INFO L87 Difference]: Start difference. First operand 144 states and 185 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-03-09 01:39:08,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:08,259 INFO L93 Difference]: Finished difference Result 295 states and 384 transitions. [2025-03-09 01:39:08,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:39:08,260 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-03-09 01:39:08,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:08,261 INFO L225 Difference]: With dead ends: 295 [2025-03-09 01:39:08,261 INFO L226 Difference]: Without dead ends: 154 [2025-03-09 01:39:08,261 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-03-09 01:39:08,262 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 15 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:08,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 194 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:39:08,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-09 01:39:08,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 146. [2025-03-09 01:39:08,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 122 states have (on average 1.4508196721311475) internal successors, (177), 139 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-03-09 01:39:08,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 185 transitions. [2025-03-09 01:39:08,275 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 185 transitions. Word has length 14 [2025-03-09 01:39:08,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:08,275 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 185 transitions. [2025-03-09 01:39:08,275 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-03-09 01:39:08,275 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 185 transitions. [2025-03-09 01:39:08,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 01:39:08,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:08,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:08,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:39:08,276 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 01:39:08,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:08,276 INFO L85 PathProgramCache]: Analyzing trace with hash -923581581, now seen corresponding path program 1 times [2025-03-09 01:39:08,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:08,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096507073] [2025-03-09 01:39:08,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:08,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:08,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:39:08,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:39:08,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:08,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:08,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:39:08,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:08,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096507073] [2025-03-09 01:39:08,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096507073] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:39:08,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752004202] [2025-03-09 01:39:08,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:08,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:39:08,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:39:08,341 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:39:08,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:39:08,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:39:08,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:39:08,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:08,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:08,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:39:08,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:39:08,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:39:08,408 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:39:08,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752004202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:08,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:39:08,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-09 01:39:08,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924615325] [2025-03-09 01:39:08,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:08,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:39:08,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:08,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:39:08,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:39:08,409 INFO L87 Difference]: Start difference. First operand 146 states and 185 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:39:08,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:08,463 INFO L93 Difference]: Finished difference Result 163 states and 211 transitions. [2025-03-09 01:39:08,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:39:08,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-09 01:39:08,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:08,464 INFO L225 Difference]: With dead ends: 163 [2025-03-09 01:39:08,464 INFO L226 Difference]: Without dead ends: 162 [2025-03-09 01:39:08,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:39:08,465 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 10 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:08,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 277 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:39:08,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-09 01:39:08,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 156. [2025-03-09 01:39:08,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 132 states have (on average 1.4318181818181819) internal successors, (189), 149 states have internal predecessors, (189), 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-03-09 01:39:08,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 197 transitions. [2025-03-09 01:39:08,470 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 197 transitions. Word has length 15 [2025-03-09 01:39:08,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:08,470 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 197 transitions. [2025-03-09 01:39:08,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:39:08,470 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 197 transitions. [2025-03-09 01:39:08,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 01:39:08,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:08,471 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:08,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:39:08,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:39:08,671 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 01:39:08,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:08,672 INFO L85 PathProgramCache]: Analyzing trace with hash 920657480, now seen corresponding path program 1 times [2025-03-09 01:39:08,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:08,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897774715] [2025-03-09 01:39:08,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:08,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:08,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:39:08,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:39:08,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:08,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:08,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:39:08,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:08,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897774715] [2025-03-09 01:39:08,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897774715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:08,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:39:08,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:39:08,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379365137] [2025-03-09 01:39:08,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:08,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:39:08,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:08,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:39:08,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:39:08,703 INFO L87 Difference]: Start difference. First operand 156 states and 197 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) 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-03-09 01:39:08,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:08,742 INFO L93 Difference]: Finished difference Result 315 states and 402 transitions. [2025-03-09 01:39:08,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:39:08,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) 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-03-09 01:39:08,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:08,744 INFO L225 Difference]: With dead ends: 315 [2025-03-09 01:39:08,745 INFO L226 Difference]: Without dead ends: 162 [2025-03-09 01:39:08,745 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-03-09 01:39:08,746 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 7 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:08,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 201 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:39:08,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-09 01:39:08,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 156. [2025-03-09 01:39:08,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 132 states have (on average 1.4015151515151516) internal successors, (185), 149 states have internal predecessors, (185), 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-03-09 01:39:08,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 193 transitions. [2025-03-09 01:39:08,754 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 193 transitions. Word has length 15 [2025-03-09 01:39:08,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:08,754 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 193 transitions. [2025-03-09 01:39:08,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) 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-03-09 01:39:08,754 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 193 transitions. [2025-03-09 01:39:08,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 01:39:08,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:08,756 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:08,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:39:08,756 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 01:39:08,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:08,757 INFO L85 PathProgramCache]: Analyzing trace with hash 166591103, now seen corresponding path program 1 times [2025-03-09 01:39:08,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:08,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550952733] [2025-03-09 01:39:08,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:08,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:08,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:39:08,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:39:08,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:08,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:08,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:39:08,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:08,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550952733] [2025-03-09 01:39:08,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550952733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:08,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:39:08,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:39:08,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060942570] [2025-03-09 01:39:08,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:08,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:39:08,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:08,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:39:08,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:39:08,815 INFO L87 Difference]: Start difference. First operand 156 states and 193 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-03-09 01:39:08,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:08,914 INFO L93 Difference]: Finished difference Result 171 states and 207 transitions. [2025-03-09 01:39:08,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:39:08,914 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-03-09 01:39:08,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:08,915 INFO L225 Difference]: With dead ends: 171 [2025-03-09 01:39:08,915 INFO L226 Difference]: Without dead ends: 169 [2025-03-09 01:39:08,915 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-03-09 01:39:08,916 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 89 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:08,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 356 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:39:08,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-09 01:39:08,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 159. [2025-03-09 01:39:08,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 135 states have (on average 1.4) internal successors, (189), 152 states have internal predecessors, (189), 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-03-09 01:39:08,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 197 transitions. [2025-03-09 01:39:08,925 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 197 transitions. Word has length 15 [2025-03-09 01:39:08,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:08,926 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 197 transitions. [2025-03-09 01:39:08,926 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-03-09 01:39:08,926 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 197 transitions. [2025-03-09 01:39:08,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 01:39:08,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:08,927 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:08,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:39:08,929 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 01:39:08,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:08,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1433742043, now seen corresponding path program 1 times [2025-03-09 01:39:08,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:08,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394079455] [2025-03-09 01:39:08,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:08,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:08,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:39:08,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:39:08,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:08,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:08,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:39:08,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:08,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394079455] [2025-03-09 01:39:08,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394079455] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:39:08,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810182978] [2025-03-09 01:39:08,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:08,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:39:08,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:39:08,981 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:39:08,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:39:09,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:39:09,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:39:09,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:09,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:09,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:39:09,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:39:09,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:39:09,037 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:39:09,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810182978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:09,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:39:09,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-09 01:39:09,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273525184] [2025-03-09 01:39:09,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:09,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:39:09,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:09,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:39:09,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:39:09,038 INFO L87 Difference]: Start difference. First operand 159 states and 197 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-03-09 01:39:09,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:09,120 INFO L93 Difference]: Finished difference Result 325 states and 400 transitions. [2025-03-09 01:39:09,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:39:09,120 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-03-09 01:39:09,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:09,121 INFO L225 Difference]: With dead ends: 325 [2025-03-09 01:39:09,121 INFO L226 Difference]: Without dead ends: 169 [2025-03-09 01:39:09,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:39:09,122 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 75 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:09,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 365 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:39:09,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-09 01:39:09,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 151. [2025-03-09 01:39:09,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 127 states have (on average 1.4015748031496063) internal successors, (178), 144 states have internal predecessors, (178), 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-03-09 01:39:09,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 186 transitions. [2025-03-09 01:39:09,127 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 186 transitions. Word has length 16 [2025-03-09 01:39:09,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:09,127 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 186 transitions. [2025-03-09 01:39:09,128 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-03-09 01:39:09,128 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 186 transitions. [2025-03-09 01:39:09,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 01:39:09,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:09,128 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:09,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 01:39:09,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:39:09,329 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 01:39:09,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:09,329 INFO L85 PathProgramCache]: Analyzing trace with hash 764964387, now seen corresponding path program 1 times [2025-03-09 01:39:09,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:09,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917658288] [2025-03-09 01:39:09,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:09,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:09,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:39:09,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:39:09,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:09,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:09,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:39:09,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:09,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917658288] [2025-03-09 01:39:09,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917658288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:09,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:39:09,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:39:09,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296870477] [2025-03-09 01:39:09,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:09,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:39:09,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:09,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:39:09,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:39:09,379 INFO L87 Difference]: Start difference. First operand 151 states and 186 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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-03-09 01:39:09,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:09,435 INFO L93 Difference]: Finished difference Result 304 states and 374 transitions. [2025-03-09 01:39:09,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:39:09,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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-03-09 01:39:09,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:09,437 INFO L225 Difference]: With dead ends: 304 [2025-03-09 01:39:09,437 INFO L226 Difference]: Without dead ends: 156 [2025-03-09 01:39:09,437 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-03-09 01:39:09,438 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 4 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:09,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 298 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:39:09,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-09 01:39:09,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-03-09 01:39:09,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 131 states have (on average 1.3893129770992367) internal successors, (182), 148 states have internal predecessors, (182), 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-03-09 01:39:09,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 190 transitions. [2025-03-09 01:39:09,446 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 190 transitions. Word has length 16 [2025-03-09 01:39:09,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:09,447 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 190 transitions. [2025-03-09 01:39:09,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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-03-09 01:39:09,447 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 190 transitions. [2025-03-09 01:39:09,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 01:39:09,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:09,448 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:09,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:39:09,448 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 01:39:09,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:09,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1712633269, now seen corresponding path program 1 times [2025-03-09 01:39:09,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:09,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680534150] [2025-03-09 01:39:09,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:09,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:09,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:39:09,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:39:09,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:09,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:09,493 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:39:09,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:09,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680534150] [2025-03-09 01:39:09,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680534150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:09,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:39:09,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:39:09,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818257189] [2025-03-09 01:39:09,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:09,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:39:09,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:09,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:39:09,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:39:09,494 INFO L87 Difference]: Start difference. First operand 156 states and 190 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 01:39:09,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:09,586 INFO L93 Difference]: Finished difference Result 215 states and 263 transitions. [2025-03-09 01:39:09,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:39:09,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-03-09 01:39:09,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:09,588 INFO L225 Difference]: With dead ends: 215 [2025-03-09 01:39:09,588 INFO L226 Difference]: Without dead ends: 211 [2025-03-09 01:39:09,588 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-03-09 01:39:09,588 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 135 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:09,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 281 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:39:09,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-09 01:39:09,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 199. [2025-03-09 01:39:09,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 174 states have (on average 1.3793103448275863) internal successors, (240), 190 states have internal predecessors, (240), 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-03-09 01:39:09,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 248 transitions. [2025-03-09 01:39:09,598 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 248 transitions. Word has length 23 [2025-03-09 01:39:09,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:09,598 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 248 transitions. [2025-03-09 01:39:09,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 01:39:09,598 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 248 transitions. [2025-03-09 01:39:09,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 01:39:09,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:09,599 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:09,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:39:09,600 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 01:39:09,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:09,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1712673052, now seen corresponding path program 1 times [2025-03-09 01:39:09,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:09,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041386951] [2025-03-09 01:39:09,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:09,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:09,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:39:09,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:39:09,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:09,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:09,640 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:39:09,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:09,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041386951] [2025-03-09 01:39:09,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041386951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:09,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:39:09,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:39:09,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871483418] [2025-03-09 01:39:09,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:09,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:39:09,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:09,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:39:09,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:39:09,642 INFO L87 Difference]: Start difference. First operand 199 states and 248 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 01:39:09,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:09,719 INFO L93 Difference]: Finished difference Result 221 states and 268 transitions. [2025-03-09 01:39:09,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:39:09,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-03-09 01:39:09,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:09,721 INFO L225 Difference]: With dead ends: 221 [2025-03-09 01:39:09,721 INFO L226 Difference]: Without dead ends: 219 [2025-03-09 01:39:09,721 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-03-09 01:39:09,722 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 137 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:09,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 284 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:39:09,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-09 01:39:09,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 191. [2025-03-09 01:39:09,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 166 states have (on average 1.3734939759036144) internal successors, (228), 182 states have internal predecessors, (228), 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-03-09 01:39:09,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 236 transitions. [2025-03-09 01:39:09,730 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 236 transitions. Word has length 23 [2025-03-09 01:39:09,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:09,731 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 236 transitions. [2025-03-09 01:39:09,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 01:39:09,731 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 236 transitions. [2025-03-09 01:39:09,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 01:39:09,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:09,731 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:09,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:39:09,732 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 01:39:09,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:09,732 INFO L85 PathProgramCache]: Analyzing trace with hash 793244985, now seen corresponding path program 1 times [2025-03-09 01:39:09,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:09,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481427227] [2025-03-09 01:39:09,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:09,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:09,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:39:09,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:39:09,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:09,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:09,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:39:09,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:09,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481427227] [2025-03-09 01:39:09,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481427227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:09,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:39:09,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:39:09,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219825082] [2025-03-09 01:39:09,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:09,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:39:09,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:09,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:39:09,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:39:09,772 INFO L87 Difference]: Start difference. First operand 191 states and 236 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 01:39:09,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:09,817 INFO L93 Difference]: Finished difference Result 338 states and 415 transitions. [2025-03-09 01:39:09,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:39:09,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-03-09 01:39:09,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:09,820 INFO L225 Difference]: With dead ends: 338 [2025-03-09 01:39:09,820 INFO L226 Difference]: Without dead ends: 178 [2025-03-09 01:39:09,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-03-09 01:39:09,821 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 34 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:09,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 298 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:39:09,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-09 01:39:09,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2025-03-09 01:39:09,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 150 states have (on average 1.3733333333333333) internal successors, (206), 166 states have internal predecessors, (206), 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-03-09 01:39:09,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 214 transitions. [2025-03-09 01:39:09,826 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 214 transitions. Word has length 23 [2025-03-09 01:39:09,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:09,826 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 214 transitions. [2025-03-09 01:39:09,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 01:39:09,827 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 214 transitions. [2025-03-09 01:39:09,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 01:39:09,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:09,827 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:09,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:39:09,827 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 01:39:09,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:09,828 INFO L85 PathProgramCache]: Analyzing trace with hash 897637477, now seen corresponding path program 1 times [2025-03-09 01:39:09,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:09,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070939388] [2025-03-09 01:39:09,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:09,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:09,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:39:09,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:39:09,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:09,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:09,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:39:09,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:09,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070939388] [2025-03-09 01:39:09,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070939388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:09,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:39:09,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:39:09,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427277198] [2025-03-09 01:39:09,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:09,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:39:09,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:09,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:39:09,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:39:09,862 INFO L87 Difference]: Start difference. First operand 175 states and 214 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 01:39:09,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:09,954 INFO L93 Difference]: Finished difference Result 338 states and 415 transitions. [2025-03-09 01:39:09,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:39:09,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-03-09 01:39:09,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:09,955 INFO L225 Difference]: With dead ends: 338 [2025-03-09 01:39:09,955 INFO L226 Difference]: Without dead ends: 194 [2025-03-09 01:39:09,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-03-09 01:39:09,957 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 67 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:09,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 358 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:39:09,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-09 01:39:09,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 186. [2025-03-09 01:39:09,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 161 states have (on average 1.360248447204969) internal successors, (219), 177 states have internal predecessors, (219), 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-03-09 01:39:09,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 227 transitions. [2025-03-09 01:39:09,965 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 227 transitions. Word has length 23 [2025-03-09 01:39:09,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:09,966 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 227 transitions. [2025-03-09 01:39:09,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 01:39:09,966 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 227 transitions. [2025-03-09 01:39:09,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 01:39:09,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:09,967 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:09,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:39:09,967 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 01:39:09,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:09,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1105984481, now seen corresponding path program 1 times [2025-03-09 01:39:09,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:09,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881107622] [2025-03-09 01:39:09,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:09,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:09,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:39:09,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:39:09,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:09,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:09,995 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:39:09,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:09,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881107622] [2025-03-09 01:39:09,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881107622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:09,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:39:09,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:39:09,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798747852] [2025-03-09 01:39:09,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:09,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:39:09,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:09,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:39:09,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:39:09,996 INFO L87 Difference]: Start difference. First operand 186 states and 227 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 01:39:10,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:10,044 INFO L93 Difference]: Finished difference Result 190 states and 233 transitions. [2025-03-09 01:39:10,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:39:10,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-03-09 01:39:10,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:10,045 INFO L225 Difference]: With dead ends: 190 [2025-03-09 01:39:10,045 INFO L226 Difference]: Without dead ends: 189 [2025-03-09 01:39:10,045 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-03-09 01:39:10,046 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 7 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:10,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 259 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:39:10,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-09 01:39:10,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 176. [2025-03-09 01:39:10,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 151 states have (on average 1.3708609271523178) internal successors, (207), 167 states have internal predecessors, (207), 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-03-09 01:39:10,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 215 transitions. [2025-03-09 01:39:10,052 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 215 transitions. Word has length 27 [2025-03-09 01:39:10,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:10,052 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 215 transitions. [2025-03-09 01:39:10,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 01:39:10,052 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 215 transitions. [2025-03-09 01:39:10,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-09 01:39:10,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:10,053 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:10,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:39:10,053 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 01:39:10,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:10,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1163766868, now seen corresponding path program 1 times [2025-03-09 01:39:10,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:10,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413870987] [2025-03-09 01:39:10,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:10,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:10,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 01:39:10,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 01:39:10,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:10,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:10,110 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 01:39:10,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:10,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413870987] [2025-03-09 01:39:10,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413870987] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:39:10,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669142937] [2025-03-09 01:39:10,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:10,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:39:10,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:39:10,112 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:39:10,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:39:10,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 01:39:10,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 01:39:10,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:10,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:10,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:39:10,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:39:10,198 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:39:10,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:39:10,314 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 01:39:10,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669142937] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:39:10,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:39:10,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-03-09 01:39:10,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458392898] [2025-03-09 01:39:10,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:39:10,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:39:10,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:10,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:39:10,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:39:10,315 INFO L87 Difference]: Start difference. First operand 176 states and 215 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 01:39:10,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:10,568 INFO L93 Difference]: Finished difference Result 620 states and 794 transitions. [2025-03-09 01:39:10,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 01:39:10,569 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2025-03-09 01:39:10,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:10,570 INFO L225 Difference]: With dead ends: 620 [2025-03-09 01:39:10,570 INFO L226 Difference]: Without dead ends: 476 [2025-03-09 01:39:10,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:39:10,571 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 354 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:10,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 384 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:39:10,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-03-09 01:39:10,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 192. [2025-03-09 01:39:10,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 167 states have (on average 1.3592814371257484) internal successors, (227), 183 states have internal predecessors, (227), 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-03-09 01:39:10,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 235 transitions. [2025-03-09 01:39:10,581 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 235 transitions. Word has length 40 [2025-03-09 01:39:10,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:10,582 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 235 transitions. [2025-03-09 01:39:10,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 01:39:10,582 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 235 transitions. [2025-03-09 01:39:10,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-09 01:39:10,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:10,582 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:10,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:39:10,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 01:39:10,783 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 01:39:10,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:10,783 INFO L85 PathProgramCache]: Analyzing trace with hash -724624423, now seen corresponding path program 1 times [2025-03-09 01:39:10,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:10,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254787401] [2025-03-09 01:39:10,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:10,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:10,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 01:39:10,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 01:39:10,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:10,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:10,844 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:39:10,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:10,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254787401] [2025-03-09 01:39:10,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254787401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:10,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:39:10,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:39:10,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123935876] [2025-03-09 01:39:10,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:10,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:39:10,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:10,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:39:10,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:39:10,846 INFO L87 Difference]: Start difference. First operand 192 states and 235 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-03-09 01:39:10,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:10,929 INFO L93 Difference]: Finished difference Result 196 states and 238 transitions. [2025-03-09 01:39:10,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:39:10,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 45 [2025-03-09 01:39:10,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:10,931 INFO L225 Difference]: With dead ends: 196 [2025-03-09 01:39:10,931 INFO L226 Difference]: Without dead ends: 193 [2025-03-09 01:39:10,931 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-03-09 01:39:10,931 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 125 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:10,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 301 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:39:10,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-09 01:39:10,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 182. [2025-03-09 01:39:10,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 160 states have (on average 1.34375) internal successors, (215), 173 states have internal predecessors, (215), 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-03-09 01:39:10,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 223 transitions. [2025-03-09 01:39:10,940 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 223 transitions. Word has length 45 [2025-03-09 01:39:10,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:10,941 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 223 transitions. [2025-03-09 01:39:10,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-03-09 01:39:10,941 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 223 transitions. [2025-03-09 01:39:10,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-09 01:39:10,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:10,942 INFO L218 NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1] [2025-03-09 01:39:10,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 01:39:10,942 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 01:39:10,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:10,943 INFO L85 PathProgramCache]: Analyzing trace with hash -724664206, now seen corresponding path program 1 times [2025-03-09 01:39:10,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:10,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330790273] [2025-03-09 01:39:10,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:10,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:10,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 01:39:10,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 01:39:10,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:10,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:10,993 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:39:10,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:10,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330790273] [2025-03-09 01:39:10,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330790273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:10,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:39:10,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:39:10,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563508043] [2025-03-09 01:39:10,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:10,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:39:10,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:10,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:39:10,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:39:10,996 INFO L87 Difference]: Start difference. First operand 182 states and 223 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-03-09 01:39:11,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:11,076 INFO L93 Difference]: Finished difference Result 190 states and 232 transitions. [2025-03-09 01:39:11,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:39:11,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 45 [2025-03-09 01:39:11,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:11,078 INFO L225 Difference]: With dead ends: 190 [2025-03-09 01:39:11,078 INFO L226 Difference]: Without dead ends: 188 [2025-03-09 01:39:11,078 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-03-09 01:39:11,079 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 134 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:11,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 294 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:39:11,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-09 01:39:11,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 172. [2025-03-09 01:39:11,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 152 states have (on average 1.3421052631578947) internal successors, (204), 163 states have internal predecessors, (204), 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-03-09 01:39:11,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 212 transitions. [2025-03-09 01:39:11,088 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 212 transitions. Word has length 45 [2025-03-09 01:39:11,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:11,088 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 212 transitions. [2025-03-09 01:39:11,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-03-09 01:39:11,088 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 212 transitions. [2025-03-09 01:39:11,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-09 01:39:11,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:11,089 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:11,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 01:39:11,089 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 01:39:11,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:11,089 INFO L85 PathProgramCache]: Analyzing trace with hash -867994359, now seen corresponding path program 1 times [2025-03-09 01:39:11,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:11,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536467664] [2025-03-09 01:39:11,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:11,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:11,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 01:39:11,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 01:39:11,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:11,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:11,158 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 01:39:11,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:11,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536467664] [2025-03-09 01:39:11,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536467664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:11,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:39:11,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:39:11,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301943863] [2025-03-09 01:39:11,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:11,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:39:11,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:11,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:39:11,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:39:11,159 INFO L87 Difference]: Start difference. First operand 172 states and 212 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-03-09 01:39:11,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:11,214 INFO L93 Difference]: Finished difference Result 326 states and 402 transitions. [2025-03-09 01:39:11,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:39:11,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 45 [2025-03-09 01:39:11,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:11,216 INFO L225 Difference]: With dead ends: 326 [2025-03-09 01:39:11,216 INFO L226 Difference]: Without dead ends: 195 [2025-03-09 01:39:11,216 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-03-09 01:39:11,216 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 10 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:11,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 286 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:39:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-09 01:39:11,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 168. [2025-03-09 01:39:11,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 148 states have (on average 1.3310810810810811) internal successors, (197), 159 states have internal predecessors, (197), 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-03-09 01:39:11,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 205 transitions. [2025-03-09 01:39:11,229 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 205 transitions. Word has length 45 [2025-03-09 01:39:11,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:11,229 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 205 transitions. [2025-03-09 01:39:11,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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-03-09 01:39:11,229 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 205 transitions. [2025-03-09 01:39:11,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-09 01:39:11,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:11,230 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:11,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 01:39:11,230 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 01:39:11,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:11,231 INFO L85 PathProgramCache]: Analyzing trace with hash -117395698, now seen corresponding path program 1 times [2025-03-09 01:39:11,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:11,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270719138] [2025-03-09 01:39:11,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:11,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:11,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 01:39:11,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 01:39:11,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:11,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:11,298 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:39:11,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:11,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270719138] [2025-03-09 01:39:11,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270719138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:11,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:39:11,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:39:11,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54111205] [2025-03-09 01:39:11,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:11,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:39:11,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:11,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:39:11,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:39:11,299 INFO L87 Difference]: Start difference. First operand 168 states and 205 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-03-09 01:39:11,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:11,385 INFO L93 Difference]: Finished difference Result 375 states and 455 transitions. [2025-03-09 01:39:11,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:39:11,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 46 [2025-03-09 01:39:11,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:11,386 INFO L225 Difference]: With dead ends: 375 [2025-03-09 01:39:11,386 INFO L226 Difference]: Without dead ends: 245 [2025-03-09 01:39:11,387 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-03-09 01:39:11,387 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 40 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:11,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 267 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:39:11,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-09 01:39:11,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 168. [2025-03-09 01:39:11,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 148 states have (on average 1.3243243243243243) internal successors, (196), 159 states have internal predecessors, (196), 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-03-09 01:39:11,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 204 transitions. [2025-03-09 01:39:11,396 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 204 transitions. Word has length 46 [2025-03-09 01:39:11,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:11,396 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 204 transitions. [2025-03-09 01:39:11,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-03-09 01:39:11,397 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 204 transitions. [2025-03-09 01:39:11,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 01:39:11,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:11,397 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:11,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 01:39:11,397 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 01:39:11,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:11,397 INFO L85 PathProgramCache]: Analyzing trace with hash -789350892, now seen corresponding path program 1 times [2025-03-09 01:39:11,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:11,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070734956] [2025-03-09 01:39:11,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:11,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:11,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 01:39:11,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 01:39:11,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:11,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:11,553 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:39:11,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:11,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070734956] [2025-03-09 01:39:11,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070734956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:39:11,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103623365] [2025-03-09 01:39:11,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:11,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:39:11,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:39:11,557 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:39:11,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:39:11,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 01:39:11,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 01:39:11,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:11,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:11,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:39:11,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:39:11,846 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:39:11,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:39:12,064 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:39:12,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103623365] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:39:12,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:39:12,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 19 [2025-03-09 01:39:12,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363892664] [2025-03-09 01:39:12,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:39:12,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 01:39:12,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:12,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 01:39:12,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2025-03-09 01:39:12,066 INFO L87 Difference]: Start difference. First operand 168 states and 204 transitions. Second operand has 19 states, 19 states have (on average 4.368421052631579) internal successors, (83), 19 states have internal predecessors, (83), 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-03-09 01:39:15,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.51s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-09 01:39:16,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:16,186 INFO L93 Difference]: Finished difference Result 493 states and 593 transitions. [2025-03-09 01:39:16,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-09 01:39:16,189 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.368421052631579) internal successors, (83), 19 states have internal predecessors, (83), 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 50 [2025-03-09 01:39:16,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:16,191 INFO L225 Difference]: With dead ends: 493 [2025-03-09 01:39:16,191 INFO L226 Difference]: Without dead ends: 347 [2025-03-09 01:39:16,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=234, Invalid=416, Unknown=0, NotChecked=0, Total=650 [2025-03-09 01:39:16,192 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 132 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:16,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 639 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-09 01:39:16,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-09 01:39:16,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 168. [2025-03-09 01:39:16,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 148 states have (on average 1.2972972972972974) internal successors, (192), 159 states have internal predecessors, (192), 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-03-09 01:39:16,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 200 transitions. [2025-03-09 01:39:16,213 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 200 transitions. Word has length 50 [2025-03-09 01:39:16,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:16,213 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 200 transitions. [2025-03-09 01:39:16,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.368421052631579) internal successors, (83), 19 states have internal predecessors, (83), 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-03-09 01:39:16,213 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 200 transitions. [2025-03-09 01:39:16,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-09 01:39:16,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:16,214 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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] [2025-03-09 01:39:16,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 01:39:16,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:39:16,414 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 01:39:16,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:16,415 INFO L85 PathProgramCache]: Analyzing trace with hash -868687460, now seen corresponding path program 1 times [2025-03-09 01:39:16,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:16,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243135668] [2025-03-09 01:39:16,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:16,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:16,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 01:39:16,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 01:39:16,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:16,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:16,588 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 66 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:39:16,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:16,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243135668] [2025-03-09 01:39:16,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243135668] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:39:16,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952523289] [2025-03-09 01:39:16,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:16,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:39:16,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:39:16,591 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:39:16,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:39:16,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 01:39:16,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 01:39:16,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:16,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:16,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:39:16,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:39:16,744 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 66 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:39:16,744 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:39:17,011 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 66 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:39:17,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952523289] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:39:17,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:39:17,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2025-03-09 01:39:17,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799682061] [2025-03-09 01:39:17,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:39:17,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-09 01:39:17,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:17,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-09 01:39:17,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2025-03-09 01:39:17,012 INFO L87 Difference]: Start difference. First operand 168 states and 200 transitions. Second operand has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 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-03-09 01:39:17,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:17,516 INFO L93 Difference]: Finished difference Result 914 states and 1152 transitions. [2025-03-09 01:39:17,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 01:39:17,517 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 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 56 [2025-03-09 01:39:17,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:17,519 INFO L225 Difference]: With dead ends: 914 [2025-03-09 01:39:17,520 INFO L226 Difference]: Without dead ends: 794 [2025-03-09 01:39:17,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=304, Invalid=508, Unknown=0, NotChecked=0, Total=812 [2025-03-09 01:39:17,521 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 520 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:17,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 673 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 01:39:17,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2025-03-09 01:39:17,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 200. [2025-03-09 01:39:17,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 180 states have (on average 1.288888888888889) internal successors, (232), 191 states have internal predecessors, (232), 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-03-09 01:39:17,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 240 transitions. [2025-03-09 01:39:17,535 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 240 transitions. Word has length 56 [2025-03-09 01:39:17,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:17,536 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 240 transitions. [2025-03-09 01:39:17,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 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-03-09 01:39:17,536 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 240 transitions. [2025-03-09 01:39:17,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-09 01:39:17,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:17,536 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:17,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 01:39:17,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:39:17,738 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 01:39:17,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:17,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1474827308, now seen corresponding path program 2 times [2025-03-09 01:39:17,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:17,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970894515] [2025-03-09 01:39:17,738 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:39:17,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:17,747 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-03-09 01:39:17,765 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 01:39:17,769 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:39:17,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:17,990 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:39:17,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:17,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970894515] [2025-03-09 01:39:17,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970894515] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:39:17,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340671293] [2025-03-09 01:39:17,990 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:39:17,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:39:17,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:39:17,992 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:39:17,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:39:18,018 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-03-09 01:39:18,064 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 01:39:18,064 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:39:18,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:18,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 01:39:18,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:39:19,376 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:39:19,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:39:20,676 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:39:20,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340671293] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:39:20,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:39:20,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 18, 17] total 40 [2025-03-09 01:39:20,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911565064] [2025-03-09 01:39:20,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:39:20,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-09 01:39:20,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:20,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-09 01:39:20,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=473, Invalid=1087, Unknown=0, NotChecked=0, Total=1560 [2025-03-09 01:39:20,678 INFO L87 Difference]: Start difference. First operand 200 states and 240 transitions. Second operand has 40 states, 40 states have (on average 3.25) internal successors, (130), 40 states have internal predecessors, (130), 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-03-09 01:39:27,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-09 01:39:30,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:30,489 INFO L93 Difference]: Finished difference Result 657 states and 793 transitions. [2025-03-09 01:39:30,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-09 01:39:30,490 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.25) internal successors, (130), 40 states have internal predecessors, (130), 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 66 [2025-03-09 01:39:30,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:30,492 INFO L225 Difference]: With dead ends: 657 [2025-03-09 01:39:30,492 INFO L226 Difference]: Without dead ends: 509 [2025-03-09 01:39:30,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1086 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=923, Invalid=1939, Unknown=0, NotChecked=0, Total=2862 [2025-03-09 01:39:30,493 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 320 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:30,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1710 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1155 Invalid, 1 Unknown, 0 Unchecked, 7.9s Time] [2025-03-09 01:39:30,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-03-09 01:39:30,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 200. [2025-03-09 01:39:30,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 180 states have (on average 1.2444444444444445) internal successors, (224), 191 states have internal predecessors, (224), 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-03-09 01:39:30,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 232 transitions. [2025-03-09 01:39:30,506 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 232 transitions. Word has length 66 [2025-03-09 01:39:30,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:30,506 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 232 transitions. [2025-03-09 01:39:30,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.25) internal successors, (130), 40 states have internal predecessors, (130), 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-03-09 01:39:30,507 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 232 transitions. [2025-03-09 01:39:30,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-09 01:39:30,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:30,507 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 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] [2025-03-09 01:39:30,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 01:39:30,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-09 01:39:30,711 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 01:39:30,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:30,711 INFO L85 PathProgramCache]: Analyzing trace with hash 59050444, now seen corresponding path program 2 times [2025-03-09 01:39:30,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:30,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835174481] [2025-03-09 01:39:30,712 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:39:30,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:30,716 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 88 statements into 2 equivalence classes. [2025-03-09 01:39:30,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 88 of 88 statements. [2025-03-09 01:39:30,724 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:39:30,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:31,044 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 9 proven. 378 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:39:31,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:31,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835174481] [2025-03-09 01:39:31,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835174481] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:39:31,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107276167] [2025-03-09 01:39:31,045 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:39:31,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:39:31,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:39:31,047 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:39:31,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 01:39:31,075 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 88 statements into 2 equivalence classes. [2025-03-09 01:39:31,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 88 of 88 statements. [2025-03-09 01:39:31,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:39:31,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:31,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 01:39:31,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:39:31,359 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 9 proven. 378 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:39:31,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:39:31,963 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 9 proven. 378 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:39:31,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107276167] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:39:31,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:39:31,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 50 [2025-03-09 01:39:31,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588932449] [2025-03-09 01:39:31,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:39:31,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-09 01:39:31,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:31,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-09 01:39:31,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=846, Invalid=1604, Unknown=0, NotChecked=0, Total=2450 [2025-03-09 01:39:31,965 INFO L87 Difference]: Start difference. First operand 200 states and 232 transitions. Second operand has 50 states, 50 states have (on average 4.14) internal successors, (207), 50 states have internal predecessors, (207), 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-03-09 01:39:32,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:32,713 INFO L93 Difference]: Finished difference Result 1586 states and 2016 transitions. [2025-03-09 01:39:32,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-09 01:39:32,714 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.14) internal successors, (207), 50 states have internal predecessors, (207), 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 88 [2025-03-09 01:39:32,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:32,717 INFO L225 Difference]: With dead ends: 1586 [2025-03-09 01:39:32,717 INFO L226 Difference]: Without dead ends: 1466 [2025-03-09 01:39:32,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=992, Invalid=1764, Unknown=0, NotChecked=0, Total=2756 [2025-03-09 01:39:32,718 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 1429 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1429 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:32,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1429 Valid, 706 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 01:39:32,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2025-03-09 01:39:32,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 264. [2025-03-09 01:39:32,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 244 states have (on average 1.2459016393442623) internal successors, (304), 255 states have internal predecessors, (304), 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-03-09 01:39:32,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 312 transitions. [2025-03-09 01:39:32,737 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 312 transitions. Word has length 88 [2025-03-09 01:39:32,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:32,737 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 312 transitions. [2025-03-09 01:39:32,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.14) internal successors, (207), 50 states have internal predecessors, (207), 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-03-09 01:39:32,737 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 312 transitions. [2025-03-09 01:39:32,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-09 01:39:32,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:32,738 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 13, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:32,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 01:39:32,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-09 01:39:32,938 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 01:39:32,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:32,939 INFO L85 PathProgramCache]: Analyzing trace with hash -2029797284, now seen corresponding path program 3 times [2025-03-09 01:39:32,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:32,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490195826] [2025-03-09 01:39:32,939 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:39:32,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:32,943 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 98 statements into 15 equivalence classes. [2025-03-09 01:39:33,002 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 98 of 98 statements. [2025-03-09 01:39:33,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-09 01:39:33,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:33,637 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 18 proven. 364 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:39:33,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:33,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490195826] [2025-03-09 01:39:33,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490195826] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:39:33,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167540303] [2025-03-09 01:39:33,638 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:39:33,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:39:33,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:39:33,640 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:39:33,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 01:39:33,686 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 98 statements into 15 equivalence classes. [2025-03-09 01:39:33,940 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 98 of 98 statements. [2025-03-09 01:39:33,941 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-09 01:39:33,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:33,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-09 01:39:33,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:39:35,185 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 18 proven. 364 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:39:35,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:39:42,150 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 18 proven. 364 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:39:42,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167540303] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:39:42,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:39:42,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 26, 26] total 66 [2025-03-09 01:39:42,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768005859] [2025-03-09 01:39:42,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:39:42,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-03-09 01:39:42,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:42,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-03-09 01:39:42,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1279, Invalid=3011, Unknown=0, NotChecked=0, Total=4290 [2025-03-09 01:39:42,153 INFO L87 Difference]: Start difference. First operand 264 states and 312 transitions. Second operand has 66 states, 66 states have (on average 3.4242424242424243) internal successors, (226), 66 states have internal predecessors, (226), 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-03-09 01:40:29,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-09 01:40:40,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:40:40,101 INFO L93 Difference]: Finished difference Result 1002 states and 1210 transitions. [2025-03-09 01:40:40,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-03-09 01:40:40,102 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 3.4242424242424243) internal successors, (226), 66 states have internal predecessors, (226), 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 98 [2025-03-09 01:40:40,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:40:40,104 INFO L225 Difference]: With dead ends: 1002 [2025-03-09 01:40:40,104 INFO L226 Difference]: Without dead ends: 854 [2025-03-09 01:40:40,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 168 SyntacticMatches, 3 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3508 ImplicationChecksByTransitivity, 52.4s TimeCoverageRelationStatistics Valid=2857, Invalid=6263, Unknown=0, NotChecked=0, Total=9120 [2025-03-09 01:40:40,106 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 1270 mSDsluCounter, 2752 mSDsCounter, 0 mSdLazyCounter, 3036 mSolverCounterSat, 269 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1270 SdHoareTripleChecker+Valid, 2915 SdHoareTripleChecker+Invalid, 3306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 3036 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:40:40,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1270 Valid, 2915 Invalid, 3306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 3036 Invalid, 1 Unknown, 0 Unchecked, 12.1s Time] [2025-03-09 01:40:40,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2025-03-09 01:40:40,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 264. [2025-03-09 01:40:40,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 244 states have (on average 1.1844262295081966) internal successors, (289), 255 states have internal predecessors, (289), 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-03-09 01:40:40,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 297 transitions. [2025-03-09 01:40:40,129 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 297 transitions. Word has length 98 [2025-03-09 01:40:40,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:40:40,129 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 297 transitions. [2025-03-09 01:40:40,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 3.4242424242424243) internal successors, (226), 66 states have internal predecessors, (226), 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-03-09 01:40:40,129 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 297 transitions. [2025-03-09 01:40:40,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-09 01:40:40,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:40:40,131 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 23, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:40:40,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 01:40:40,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-09 01:40:40,333 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 01:40:40,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:40:40,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1698502248, now seen corresponding path program 4 times [2025-03-09 01:40:40,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:40:40,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053237260] [2025-03-09 01:40:40,333 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:40:40,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:40:40,340 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 138 statements into 2 equivalence classes. [2025-03-09 01:40:40,402 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 138 of 138 statements. [2025-03-09 01:40:40,402 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:40:40,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:40:40,403 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:40:40,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-09 01:40:40,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-09 01:40:40,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:40:40,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:40:40,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 01:40:40,481 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:40:40,482 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2025-03-09 01:40:40,483 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2025-03-09 01:40:40,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2025-03-09 01:40:40,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2025-03-09 01:40:40,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2025-03-09 01:40:40,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2025-03-09 01:40:40,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2025-03-09 01:40:40,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2025-03-09 01:40:40,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2025-03-09 01:40:40,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2025-03-09 01:40:40,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2025-03-09 01:40:40,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2025-03-09 01:40:40,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2025-03-09 01:40:40,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2025-03-09 01:40:40,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2025-03-09 01:40:40,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2025-03-09 01:40:40,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2025-03-09 01:40:40,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2025-03-09 01:40:40,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2025-03-09 01:40:40,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2025-03-09 01:40:40,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2025-03-09 01:40:40,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2025-03-09 01:40:40,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2025-03-09 01:40:40,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2025-03-09 01:40:40,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-09 01:40:40,487 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:40:40,531 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:40:40,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:40:40 BoogieIcfgContainer [2025-03-09 01:40:40,538 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:40:40,539 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:40:40,539 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:40:40,539 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:40:40,540 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:39:06" (3/4) ... [2025-03-09 01:40:40,541 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 01:40:40,542 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:40:40,543 INFO L158 Benchmark]: Toolchain (without parser) took 94623.88ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 106.5MB in the beginning and 204.7MB in the end (delta: -98.2MB). Peak memory consumption was 148.5MB. Max. memory is 16.1GB. [2025-03-09 01:40:40,544 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:40:40,544 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.23ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 93.3MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:40:40,544 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.21ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.4MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:40:40,544 INFO L158 Benchmark]: Boogie Preprocessor took 35.27ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 89.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:40:40,545 INFO L158 Benchmark]: IcfgBuilder took 409.75ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 64.0MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-09 01:40:40,545 INFO L158 Benchmark]: TraceAbstraction took 93893.42ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 63.1MB in the beginning and 204.8MB in the end (delta: -141.7MB). Peak memory consumption was 98.2MB. Max. memory is 16.1GB. [2025-03-09 01:40:40,546 INFO L158 Benchmark]: Witness Printer took 3.41ms. Allocated memory is still 385.9MB. Free memory was 204.8MB in the beginning and 204.7MB in the end (delta: 120.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:40:40,547 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.23ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 93.3MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.21ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.4MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.27ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 89.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 409.75ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 64.0MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 93893.42ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 63.1MB in the beginning and 204.8MB in the end (delta: -141.7MB). Peak memory consumption was 98.2MB. Max. memory is 16.1GB. * Witness Printer took 3.41ms. Allocated memory is still 385.9MB. Free memory was 204.8MB in the beginning and 204.7MB in the end (delta: 120.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 76. Possible FailurePath: [L221] unsigned int a ; [L222] unsigned int ma = __VERIFIER_nondet_uint(); [L223] signed char ea = __VERIFIER_nondet_char(); [L224] unsigned int b ; [L225] unsigned int mb = __VERIFIER_nondet_uint(); [L226] signed char eb = __VERIFIER_nondet_char(); [L227] unsigned int r_mul ; [L228] unsigned int zero ; [L229] unsigned int one ; [L230] int sb ; [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; [L234] int __retres16 ; VAL [ea=0, eb=0] [L238] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L238] RET, EXPR base2flt(0, 0) VAL [ea=0, eb=0] [L238] zero = base2flt(0, 0) [L239] CALL, EXPR base2flt(1, 0) VAL [\old(e)=0, \old(m)=1] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L35] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-24, m=16777216] [L47] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=1, e=-24, m=16777216] [L76] EXPR m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=1, e=-24] [L76] m = m & ~ (1U << 24U) [L77] EXPR e + 128 VAL [\old(e)=0, \old(m)=1, e=-24, m=0] [L77] EXPR (e + 128) << 24U VAL [\old(e)=0, \old(m)=1, e=-24, m=0] [L77] EXPR m | (unsigned int )((e + 128) << 24U) VAL [\old(e)=0, \old(m)=1] [L77] res = m | (unsigned int )((e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=0, \old(m)=1, __retres4=1744830464] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=1, \result=1744830464] [L239] RET, EXPR base2flt(1, 0) VAL [ea=0, eb=0, zero=0] [L239] one = base2flt(1, 0) [L240] CALL base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L76] EXPR m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0] [L76] m = m & ~ (1U << 24U) [L77] EXPR e + 128 VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L77] (e + 128) << 24U VAL [\old(e)=0, \old(m)=16777216, m=0] - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 121 locations, 161 edges, 24 error locations. Started 1 CEGAR loops. OverallTime: 93.8s, OverallIterations: 27, TraceHistogramMax: 24, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 74.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 5059 SdHoareTripleChecker+Valid, 26.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5049 mSDsluCounter, 12469 SdHoareTripleChecker+Invalid, 25.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9799 mSDsCounter, 562 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7312 IncrementalHoareTripleChecker+Invalid, 7876 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 562 mSolverCounterUnsat, 2670 mSDtfsCounter, 7312 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1107 GetRequests, 770 SyntacticMatches, 5 SemanticMatches, 332 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6142 ImplicationChecksByTransitivity, 57.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=264occurred in iteration=25, InterpolantAutomatonStates: 278, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 3436 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 1442 NumberOfCodeBlocks, 1442 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 1660 ConstructedInterpolants, 0 QuantifiedInterpolants, 9005 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1166 ConjunctsInSsa, 122 ConjunctsInUnsatCore, 42 InterpolantComputations, 20 PerfectInterpolantSequences, 415/3065 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-09 01:40:40,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_5.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-e2fb8be-m [2025-03-09 01:40:42,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:40:42,493 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2025-03-09 01:40:42,497 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:40:42,497 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:40:42,516 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:40:42,517 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:40:42,517 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:40:42,517 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:40:42,517 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:40:42,517 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:40:42,518 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:40:42,518 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:40:42,518 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:40:42,518 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:40:42,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:40:42,518 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:40:42,518 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:40:42,518 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:40:42,518 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:40:42,518 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:40:42,518 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:40:42,518 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:40:42,518 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:40:42,518 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-09 01:40:42,518 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:40:42,519 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-09 01:40:42,520 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:40:42,520 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:40:42,520 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:40:42,520 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:40:42,520 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:40:42,520 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:40:42,520 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:40:42,520 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:40:42,520 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:40:42,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:40:42,520 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:40:42,521 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:40:42,521 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:40:42,521 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:40:42,521 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-09 01:40:42,521 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-09 01:40:42,521 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:40:42,521 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:40:42,521 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:40:42,521 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:40:42,521 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/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-03-09 01:40:42,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:40:42,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:40:42,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:40:42,829 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:40:42,829 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:40:42,830 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_5.c.cil.c [2025-03-09 01:40:44,035 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/794f107aa/3cc418590a0f49bc93be3b9abafff21a/FLAGf94447d87 [2025-03-09 01:40:44,199 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:40:44,200 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5.c.cil.c [2025-03-09 01:40:44,206 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/794f107aa/3cc418590a0f49bc93be3b9abafff21a/FLAGf94447d87 [2025-03-09 01:40:44,218 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/794f107aa/3cc418590a0f49bc93be3b9abafff21a [2025-03-09 01:40:44,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:40:44,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:40:44,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:40:44,226 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:40:44,229 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:40:44,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:40:44" (1/1) ... [2025-03-09 01:40:44,232 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e7bc6f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:40:44, skipping insertion in model container [2025-03-09 01:40:44,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:40:44" (1/1) ... [2025-03-09 01:40:44,249 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:40:44,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:40:44,430 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:40:44,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:40:44,489 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:40:44,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:40:44 WrapperNode [2025-03-09 01:40:44,490 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:40:44,491 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:40:44,491 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:40:44,491 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:40:44,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:40:44" (1/1) ... [2025-03-09 01:40:44,507 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:40:44" (1/1) ... [2025-03-09 01:40:44,524 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 135 [2025-03-09 01:40:44,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:40:44,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:40:44,525 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:40:44,525 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:40:44,531 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:40:44" (1/1) ... [2025-03-09 01:40:44,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:40:44" (1/1) ... [2025-03-09 01:40:44,533 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:40:44" (1/1) ... [2025-03-09 01:40:44,542 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-03-09 01:40:44,543 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:40:44" (1/1) ... [2025-03-09 01:40:44,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:40:44" (1/1) ... [2025-03-09 01:40:44,547 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:40:44" (1/1) ... [2025-03-09 01:40:44,548 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:40:44" (1/1) ... [2025-03-09 01:40:44,549 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:40:44" (1/1) ... [2025-03-09 01:40:44,550 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:40:44" (1/1) ... [2025-03-09 01:40:44,551 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:40:44,552 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:40:44,552 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:40:44,552 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:40:44,556 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:40:44" (1/1) ... [2025-03-09 01:40:44,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:40:44,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:40:44,584 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:40:44,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:40:44,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:40:44,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-09 01:40:44,610 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-03-09 01:40:44,610 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-03-09 01:40:44,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:40:44,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:40:44,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 01:40:44,610 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert