./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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_2a.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 f330893f1140a32f6e6dacd6cc5115391759545d59ea17334f6f3b644ed5a51c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:41:40,986 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:41:41,038 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 14:41:41,043 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:41:41,043 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:41:41,064 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:41:41,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:41:41,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:41:41,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:41:41,065 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:41:41,065 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:41:41,065 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:41:41,065 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:41:41,065 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:41:41,066 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:41:41,066 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:41:41,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:41:41,066 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:41:41,066 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:41:41,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:41:41,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:41:41,066 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:41:41,066 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:41:41,066 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:41:41,066 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:41:41,067 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:41:41,067 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:41:41,067 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:41:41,067 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:41:41,067 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:41:41,067 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:41:41,067 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:41:41,067 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:41:41,067 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:41:41,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:41:41,067 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:41:41,068 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:41:41,068 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:41:41,068 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:41:41,068 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:41:41,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:41:41,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:41:41,068 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:41:41,068 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:41:41,068 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:41:41,068 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 -> f330893f1140a32f6e6dacd6cc5115391759545d59ea17334f6f3b644ed5a51c [2025-03-17 14:41:41,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:41:41,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:41:41,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:41:41,296 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:41:41,296 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:41:41,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c [2025-03-17 14:41:42,406 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1798c4d4d/0cd6e3019d8e4f668e894e4220fefbe0/FLAGcf7da8733 [2025-03-17 14:41:42,627 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:41:42,629 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c [2025-03-17 14:41:42,638 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1798c4d4d/0cd6e3019d8e4f668e894e4220fefbe0/FLAGcf7da8733 [2025-03-17 14:41:42,967 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1798c4d4d/0cd6e3019d8e4f668e894e4220fefbe0 [2025-03-17 14:41:42,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:41:42,969 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:41:42,970 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:41:42,970 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:41:42,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:41:42,974 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:41:42" (1/1) ... [2025-03-17 14:41:42,974 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49935e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:42, skipping insertion in model container [2025-03-17 14:41:42,974 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:41:42" (1/1) ... [2025-03-17 14:41:42,987 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:41:43,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:41:43,145 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:41:43,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:41:43,182 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:41:43,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:43 WrapperNode [2025-03-17 14:41:43,184 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:41:43,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:41:43,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:41:43,185 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:41:43,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:43" (1/1) ... [2025-03-17 14:41:43,198 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:43" (1/1) ... [2025-03-17 14:41:43,216 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 166 [2025-03-17 14:41:43,219 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:41:43,220 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:41:43,220 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:41:43,220 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:41:43,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:43" (1/1) ... [2025-03-17 14:41:43,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:43" (1/1) ... [2025-03-17 14:41:43,228 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:43" (1/1) ... [2025-03-17 14:41:43,243 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-17 14:41:43,243 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:43" (1/1) ... [2025-03-17 14:41:43,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:43" (1/1) ... [2025-03-17 14:41:43,247 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:43" (1/1) ... [2025-03-17 14:41:43,247 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:43" (1/1) ... [2025-03-17 14:41:43,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:43" (1/1) ... [2025-03-17 14:41:43,248 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:43" (1/1) ... [2025-03-17 14:41:43,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:41:43,250 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:41:43,250 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:41:43,250 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:41:43,251 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:43" (1/1) ... [2025-03-17 14:41:43,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:41:43,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:43,275 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-17 14:41:43,277 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-17 14:41:43,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:41:43,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:41:43,295 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-03-17 14:41:43,295 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-03-17 14:41:43,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:41:43,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:41:43,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 14:41:43,295 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 14:41:43,342 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:41:43,344 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:41:43,648 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-17 14:41:43,649 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:41:43,665 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:41:43,665 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:41:43,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:41:43 BoogieIcfgContainer [2025-03-17 14:41:43,666 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:41:43,667 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:41:43,668 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:41:43,675 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:41:43,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:41:42" (1/3) ... [2025-03-17 14:41:43,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a9f8998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:41:43, skipping insertion in model container [2025-03-17 14:41:43,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:43" (2/3) ... [2025-03-17 14:41:43,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a9f8998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:41:43, skipping insertion in model container [2025-03-17 14:41:43,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:41:43" (3/3) ... [2025-03-17 14:41:43,677 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_2a.c.cil.c [2025-03-17 14:41:43,687 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:41:43,689 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_2a.c.cil.c that has 3 procedures, 104 locations, 1 initial locations, 2 loop locations, and 18 error locations. [2025-03-17 14:41:43,733 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:41:43,741 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;@17f77480, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:41:43,741 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-17 14:41:43,744 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 78 states have (on average 1.6538461538461537) internal successors, (129), 97 states have internal predecessors, (129), 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-17 14:41:43,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 14:41:43,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:43,748 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:43,748 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:43,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:43,753 INFO L85 PathProgramCache]: Analyzing trace with hash 336186968, now seen corresponding path program 1 times [2025-03-17 14:41:43,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:43,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125023038] [2025-03-17 14:41:43,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:43,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:43,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:41:43,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:41:43,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:43,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:43,902 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-17 14:41:43,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:43,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125023038] [2025-03-17 14:41:43,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125023038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:43,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:43,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:41:43,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139916630] [2025-03-17 14:41:43,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:43,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:41:43,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:43,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:41:43,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:41:43,920 INFO L87 Difference]: Start difference. First operand has 104 states, 78 states have (on average 1.6538461538461537) internal successors, (129), 97 states have internal predecessors, (129), 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.0) internal successors, (6), 3 states have internal predecessors, (6), 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-17 14:41:44,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:44,041 INFO L93 Difference]: Finished difference Result 251 states and 356 transitions. [2025-03-17 14:41:44,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:41:44,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2025-03-17 14:41:44,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:44,048 INFO L225 Difference]: With dead ends: 251 [2025-03-17 14:41:44,048 INFO L226 Difference]: Without dead ends: 132 [2025-03-17 14:41:44,051 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-17 14:41:44,052 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 80 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:44,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 328 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:44,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-17 14:41:44,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 122. [2025-03-17 14:41:44,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 102 states have (on average 1.5) internal successors, (153), 115 states have internal predecessors, (153), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 14:41:44,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 161 transitions. [2025-03-17 14:41:44,096 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 161 transitions. Word has length 7 [2025-03-17 14:41:44,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:44,096 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 161 transitions. [2025-03-17 14:41:44,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-17 14:41:44,097 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 161 transitions. [2025-03-17 14:41:44,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 14:41:44,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:44,098 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:44,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:41:44,098 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:44,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:44,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1128733074, now seen corresponding path program 1 times [2025-03-17 14:41:44,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:44,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30327972] [2025-03-17 14:41:44,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:44,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:44,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:41:44,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:41:44,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:44,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:44,160 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-17 14:41:44,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:44,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30327972] [2025-03-17 14:41:44,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30327972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:44,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:44,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:41:44,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670798361] [2025-03-17 14:41:44,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:44,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:44,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:44,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:44,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:44,162 INFO L87 Difference]: Start difference. First operand 122 states and 161 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-17 14:41:44,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:44,197 INFO L93 Difference]: Finished difference Result 122 states and 161 transitions. [2025-03-17 14:41:44,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:44,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2025-03-17 14:41:44,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:44,200 INFO L225 Difference]: With dead ends: 122 [2025-03-17 14:41:44,200 INFO L226 Difference]: Without dead ends: 121 [2025-03-17 14:41:44,201 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-17 14:41:44,202 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 1 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:44,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 171 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:44,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-17 14:41:44,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-03-17 14:41:44,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.4803921568627452) internal successors, (151), 114 states have internal predecessors, (151), 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-17 14:41:44,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 159 transitions. [2025-03-17 14:41:44,211 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 159 transitions. Word has length 11 [2025-03-17 14:41:44,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:44,211 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 159 transitions. [2025-03-17 14:41:44,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-17 14:41:44,211 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 159 transitions. [2025-03-17 14:41:44,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 14:41:44,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:44,215 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:44,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:41:44,215 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:44,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:44,215 INFO L85 PathProgramCache]: Analyzing trace with hash 630986918, now seen corresponding path program 1 times [2025-03-17 14:41:44,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:44,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831045240] [2025-03-17 14:41:44,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:44,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:44,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:41:44,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:41:44,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:44,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:44,287 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-17 14:41:44,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:44,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831045240] [2025-03-17 14:41:44,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831045240] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:44,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793287074] [2025-03-17 14:41:44,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:44,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:44,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:44,290 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-17 14:41:44,291 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-17 14:41:44,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:41:44,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:41:44,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:44,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:44,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:41:44,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:44,369 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-17 14:41:44,369 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:41:44,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793287074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:44,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:41:44,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-17 14:41:44,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599951118] [2025-03-17 14:41:44,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:44,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:44,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:44,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:44,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:41:44,370 INFO L87 Difference]: Start difference. First operand 121 states and 159 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-17 14:41:44,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:44,425 INFO L93 Difference]: Finished difference Result 133 states and 178 transitions. [2025-03-17 14:41:44,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:44,426 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-17 14:41:44,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:44,426 INFO L225 Difference]: With dead ends: 133 [2025-03-17 14:41:44,426 INFO L226 Difference]: Without dead ends: 132 [2025-03-17 14:41:44,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 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-17 14:41:44,427 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 13 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:44,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 167 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:44,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-17 14:41:44,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 122. [2025-03-17 14:41:44,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.4757281553398058) internal successors, (152), 115 states have internal predecessors, (152), 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-17 14:41:44,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 160 transitions. [2025-03-17 14:41:44,437 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 160 transitions. Word has length 12 [2025-03-17 14:41:44,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:44,437 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 160 transitions. [2025-03-17 14:41:44,437 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-17 14:41:44,438 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 160 transitions. [2025-03-17 14:41:44,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 14:41:44,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:44,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:44,451 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-17 14:41:44,638 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-17 14:41:44,639 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:44,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:44,639 INFO L85 PathProgramCache]: Analyzing trace with hash 631001910, now seen corresponding path program 1 times [2025-03-17 14:41:44,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:44,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616672697] [2025-03-17 14:41:44,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:44,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:44,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:41:44,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:41:44,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:44,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:44,664 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-17 14:41:44,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:44,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616672697] [2025-03-17 14:41:44,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616672697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:44,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:44,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:41:44,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592701202] [2025-03-17 14:41:44,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:44,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:44,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:44,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:44,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:44,665 INFO L87 Difference]: Start difference. First operand 122 states and 160 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) 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-17 14:41:44,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:44,713 INFO L93 Difference]: Finished difference Result 255 states and 341 transitions. [2025-03-17 14:41:44,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:44,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-17 14:41:44,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:44,714 INFO L225 Difference]: With dead ends: 255 [2025-03-17 14:41:44,714 INFO L226 Difference]: Without dead ends: 135 [2025-03-17 14:41:44,715 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-17 14:41:44,716 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 11 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:44,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 174 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:44,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-17 14:41:44,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 125. [2025-03-17 14:41:44,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 106 states have (on average 1.4622641509433962) internal successors, (155), 118 states have internal predecessors, (155), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 14:41:44,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 163 transitions. [2025-03-17 14:41:44,727 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 163 transitions. Word has length 12 [2025-03-17 14:41:44,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:44,727 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 163 transitions. [2025-03-17 14:41:44,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-17 14:41:44,728 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 163 transitions. [2025-03-17 14:41:44,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 14:41:44,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:44,728 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:44,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:41:44,728 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:44,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:44,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1282974901, now seen corresponding path program 1 times [2025-03-17 14:41:44,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:44,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317439631] [2025-03-17 14:41:44,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:44,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:44,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:41:44,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:41:44,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:44,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:44,788 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-17 14:41:44,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:44,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317439631] [2025-03-17 14:41:44,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317439631] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:44,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972841093] [2025-03-17 14:41:44,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:44,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:44,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:44,790 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-17 14:41:44,792 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-17 14:41:44,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:41:44,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:41:44,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:44,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:44,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:41:44,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:44,838 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-17 14:41:44,839 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:41:44,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972841093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:44,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:41:44,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-17 14:41:44,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596682384] [2025-03-17 14:41:44,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:44,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:41:44,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:44,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:41:44,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:41:44,840 INFO L87 Difference]: Start difference. First operand 125 states and 163 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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-17 14:41:44,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:44,918 INFO L93 Difference]: Finished difference Result 156 states and 210 transitions. [2025-03-17 14:41:44,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:41:44,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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-17 14:41:44,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:44,919 INFO L225 Difference]: With dead ends: 156 [2025-03-17 14:41:44,919 INFO L226 Difference]: Without dead ends: 154 [2025-03-17 14:41:44,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 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-17 14:41:44,920 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 24 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:44,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 252 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:44,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-17 14:41:44,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 132. [2025-03-17 14:41:44,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 113 states have (on average 1.4336283185840708) internal successors, (162), 125 states have internal predecessors, (162), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 14:41:44,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 170 transitions. [2025-03-17 14:41:44,929 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 170 transitions. Word has length 12 [2025-03-17 14:41:44,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:44,929 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 170 transitions. [2025-03-17 14:41:44,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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-17 14:41:44,929 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 170 transitions. [2025-03-17 14:41:44,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 14:41:44,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:44,930 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:44,936 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-17 14:41:45,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:45,135 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:45,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:45,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1117516267, now seen corresponding path program 1 times [2025-03-17 14:41:45,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:45,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442248006] [2025-03-17 14:41:45,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:45,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:45,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:41:45,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:41:45,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:45,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:45,164 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-17 14:41:45,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:45,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442248006] [2025-03-17 14:41:45,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442248006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:45,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:45,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:41:45,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625335430] [2025-03-17 14:41:45,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:45,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:45,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:45,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:45,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:45,165 INFO L87 Difference]: Start difference. First operand 132 states and 170 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-17 14:41:45,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:45,194 INFO L93 Difference]: Finished difference Result 132 states and 170 transitions. [2025-03-17 14:41:45,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:45,194 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 13 [2025-03-17 14:41:45,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:45,195 INFO L225 Difference]: With dead ends: 132 [2025-03-17 14:41:45,195 INFO L226 Difference]: Without dead ends: 131 [2025-03-17 14:41:45,195 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-17 14:41:45,195 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:45,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:45,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-17 14:41:45,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2025-03-17 14:41:45,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 111 states have (on average 1.4234234234234233) internal successors, (158), 122 states have internal predecessors, (158), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 14:41:45,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 166 transitions. [2025-03-17 14:41:45,204 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 166 transitions. Word has length 13 [2025-03-17 14:41:45,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:45,204 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 166 transitions. [2025-03-17 14:41:45,204 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-17 14:41:45,204 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 166 transitions. [2025-03-17 14:41:45,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 14:41:45,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:45,207 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:45,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:41:45,207 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:45,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:45,207 INFO L85 PathProgramCache]: Analyzing trace with hash 807125241, now seen corresponding path program 1 times [2025-03-17 14:41:45,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:45,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977856596] [2025-03-17 14:41:45,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:45,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:45,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:41:45,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:41:45,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:45,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:45,263 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-17 14:41:45,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:45,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977856596] [2025-03-17 14:41:45,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977856596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:45,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:45,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:41:45,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650052202] [2025-03-17 14:41:45,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:45,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:41:45,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:45,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:41:45,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:41:45,263 INFO L87 Difference]: Start difference. First operand 129 states and 166 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (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-17 14:41:45,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:45,348 INFO L93 Difference]: Finished difference Result 147 states and 187 transitions. [2025-03-17 14:41:45,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:41:45,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (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-17 14:41:45,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:45,350 INFO L225 Difference]: With dead ends: 147 [2025-03-17 14:41:45,350 INFO L226 Difference]: Without dead ends: 146 [2025-03-17 14:41:45,351 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-17 14:41:45,351 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 92 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:45,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 323 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:45,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-17 14:41:45,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 134. [2025-03-17 14:41:45,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 116 states have (on average 1.4137931034482758) internal successors, (164), 127 states have internal predecessors, (164), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 14:41:45,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 172 transitions. [2025-03-17 14:41:45,363 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 172 transitions. Word has length 14 [2025-03-17 14:41:45,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:45,364 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 172 transitions. [2025-03-17 14:41:45,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (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-17 14:41:45,364 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 172 transitions. [2025-03-17 14:41:45,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 14:41:45,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:45,364 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:45,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:41:45,364 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:45,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:45,366 INFO L85 PathProgramCache]: Analyzing trace with hash -283047443, now seen corresponding path program 1 times [2025-03-17 14:41:45,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:45,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530367645] [2025-03-17 14:41:45,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:45,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:45,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:41:45,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:41:45,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:45,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:45,414 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-17 14:41:45,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:45,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530367645] [2025-03-17 14:41:45,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530367645] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:45,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602410462] [2025-03-17 14:41:45,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:45,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:45,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:45,419 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-17 14:41:45,423 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-17 14:41:45,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:41:45,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:41:45,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:45,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:45,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:41:45,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:45,485 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-17 14:41:45,485 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:41:45,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602410462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:45,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:41:45,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-17 14:41:45,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500815442] [2025-03-17 14:41:45,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:45,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:41:45,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:45,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:41:45,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:41:45,486 INFO L87 Difference]: Start difference. First operand 134 states and 172 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-17 14:41:45,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:45,528 INFO L93 Difference]: Finished difference Result 146 states and 189 transitions. [2025-03-17 14:41:45,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:41:45,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-17 14:41:45,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:45,529 INFO L225 Difference]: With dead ends: 146 [2025-03-17 14:41:45,529 INFO L226 Difference]: Without dead ends: 145 [2025-03-17 14:41:45,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 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-17 14:41:45,530 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 8 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:45,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 181 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:45,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-17 14:41:45,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 134. [2025-03-17 14:41:45,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 116 states have (on average 1.4051724137931034) internal successors, (163), 127 states have internal predecessors, (163), 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-17 14:41:45,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 171 transitions. [2025-03-17 14:41:45,535 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 171 transitions. Word has length 14 [2025-03-17 14:41:45,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:45,535 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 171 transitions. [2025-03-17 14:41:45,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-17 14:41:45,536 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 171 transitions. [2025-03-17 14:41:45,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 14:41:45,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:45,536 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:45,543 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-17 14:41:45,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:45,737 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:45,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:45,738 INFO L85 PathProgramCache]: Analyzing trace with hash -2048792674, now seen corresponding path program 1 times [2025-03-17 14:41:45,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:45,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750615828] [2025-03-17 14:41:45,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:45,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:45,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:41:45,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:41:45,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:45,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:45,788 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-17 14:41:45,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:45,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750615828] [2025-03-17 14:41:45,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750615828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:45,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:45,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:41:45,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681514986] [2025-03-17 14:41:45,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:45,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:41:45,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:45,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:41:45,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:41:45,790 INFO L87 Difference]: Start difference. First operand 134 states and 171 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (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-17 14:41:45,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:45,867 INFO L93 Difference]: Finished difference Result 196 states and 253 transitions. [2025-03-17 14:41:45,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:41:45,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (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 22 [2025-03-17 14:41:45,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:45,868 INFO L225 Difference]: With dead ends: 196 [2025-03-17 14:41:45,868 INFO L226 Difference]: Without dead ends: 194 [2025-03-17 14:41:45,868 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-17 14:41:45,868 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 125 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:45,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 259 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:45,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-17 14:41:45,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 167. [2025-03-17 14:41:45,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 148 states have (on average 1.4189189189189189) internal successors, (210), 159 states have internal predecessors, (210), 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-17 14:41:45,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 218 transitions. [2025-03-17 14:41:45,877 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 218 transitions. Word has length 22 [2025-03-17 14:41:45,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:45,878 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 218 transitions. [2025-03-17 14:41:45,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (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-17 14:41:45,878 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 218 transitions. [2025-03-17 14:41:45,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 14:41:45,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:45,880 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:45,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:41:45,880 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:45,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:45,881 INFO L85 PathProgramCache]: Analyzing trace with hash -2048752891, now seen corresponding path program 1 times [2025-03-17 14:41:45,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:45,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648410706] [2025-03-17 14:41:45,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:45,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:45,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:41:45,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:41:45,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:45,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:45,928 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-17 14:41:45,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:45,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648410706] [2025-03-17 14:41:45,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648410706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:45,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:45,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:41:45,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164054158] [2025-03-17 14:41:45,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:45,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:41:45,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:45,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:41:45,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:41:45,931 INFO L87 Difference]: Start difference. First operand 167 states and 218 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (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-17 14:41:46,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:46,011 INFO L93 Difference]: Finished difference Result 192 states and 249 transitions. [2025-03-17 14:41:46,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:41:46,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (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 22 [2025-03-17 14:41:46,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:46,012 INFO L225 Difference]: With dead ends: 192 [2025-03-17 14:41:46,013 INFO L226 Difference]: Without dead ends: 190 [2025-03-17 14:41:46,013 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-17 14:41:46,014 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 119 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:46,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 263 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:46,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-17 14:41:46,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 160. [2025-03-17 14:41:46,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 141 states have (on average 1.4113475177304964) internal successors, (199), 152 states have internal predecessors, (199), 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-17 14:41:46,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 207 transitions. [2025-03-17 14:41:46,022 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 207 transitions. Word has length 22 [2025-03-17 14:41:46,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:46,023 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 207 transitions. [2025-03-17 14:41:46,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (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-17 14:41:46,023 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 207 transitions. [2025-03-17 14:41:46,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 14:41:46,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:46,025 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:46,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:41:46,025 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:46,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:46,026 INFO L85 PathProgramCache]: Analyzing trace with hash -542005244, now seen corresponding path program 1 times [2025-03-17 14:41:46,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:46,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86467812] [2025-03-17 14:41:46,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:46,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:46,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 14:41:46,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:41:46,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:46,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:46,070 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 14:41:46,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:46,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86467812] [2025-03-17 14:41:46,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86467812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:46,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:46,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:41:46,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034567511] [2025-03-17 14:41:46,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:46,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:41:46,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:46,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:41:46,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:41:46,071 INFO L87 Difference]: Start difference. First operand 160 states and 207 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, (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-17 14:41:46,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:46,138 INFO L93 Difference]: Finished difference Result 177 states and 230 transitions. [2025-03-17 14:41:46,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:41:46,138 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, (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 29 [2025-03-17 14:41:46,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:46,139 INFO L225 Difference]: With dead ends: 177 [2025-03-17 14:41:46,139 INFO L226 Difference]: Without dead ends: 175 [2025-03-17 14:41:46,139 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-17 14:41:46,140 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 124 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:46,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 252 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:46,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-17 14:41:46,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 150. [2025-03-17 14:41:46,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 133 states have (on average 1.406015037593985) internal successors, (187), 142 states have internal predecessors, (187), 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-17 14:41:46,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 195 transitions. [2025-03-17 14:41:46,149 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 195 transitions. Word has length 29 [2025-03-17 14:41:46,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:46,149 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 195 transitions. [2025-03-17 14:41:46,149 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, (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-17 14:41:46,149 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 195 transitions. [2025-03-17 14:41:46,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 14:41:46,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:46,150 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:46,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:41:46,150 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:46,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:46,151 INFO L85 PathProgramCache]: Analyzing trace with hash -541965461, now seen corresponding path program 1 times [2025-03-17 14:41:46,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:46,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615366424] [2025-03-17 14:41:46,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:46,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:46,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 14:41:46,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:41:46,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:46,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:46,194 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 14:41:46,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:46,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615366424] [2025-03-17 14:41:46,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615366424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:46,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:46,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:41:46,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070697154] [2025-03-17 14:41:46,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:46,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:41:46,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:46,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:41:46,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:41:46,196 INFO L87 Difference]: Start difference. First operand 150 states and 195 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, (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-17 14:41:46,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:46,264 INFO L93 Difference]: Finished difference Result 173 states and 226 transitions. [2025-03-17 14:41:46,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:41:46,265 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, (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 29 [2025-03-17 14:41:46,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:46,266 INFO L225 Difference]: With dead ends: 173 [2025-03-17 14:41:46,266 INFO L226 Difference]: Without dead ends: 171 [2025-03-17 14:41:46,266 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-17 14:41:46,266 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 118 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:46,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 254 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:46,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-17 14:41:46,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 141. [2025-03-17 14:41:46,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 126 states have (on average 1.3968253968253967) internal successors, (176), 133 states have internal predecessors, (176), 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-17 14:41:46,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 184 transitions. [2025-03-17 14:41:46,274 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 184 transitions. Word has length 29 [2025-03-17 14:41:46,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:46,274 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 184 transitions. [2025-03-17 14:41:46,274 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, (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-17 14:41:46,274 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 184 transitions. [2025-03-17 14:41:46,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 14:41:46,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:46,276 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:46,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:41:46,277 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:46,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:46,277 INFO L85 PathProgramCache]: Analyzing trace with hash -789190975, now seen corresponding path program 1 times [2025-03-17 14:41:46,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:46,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351831274] [2025-03-17 14:41:46,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:46,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:46,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 14:41:46,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 14:41:46,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:46,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:46,381 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 14:41:46,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:46,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351831274] [2025-03-17 14:41:46,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351831274] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:46,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154576965] [2025-03-17 14:41:46,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:46,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:46,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:46,384 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-17 14:41:46,386 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-17 14:41:46,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 14:41:46,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 14:41:46,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:46,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:46,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:41:46,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:46,464 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:41:46,464 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:41:46,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154576965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:46,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:41:46,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-17 14:41:46,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540320823] [2025-03-17 14:41:46,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:46,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:41:46,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:46,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:41:46,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:41:46,465 INFO L87 Difference]: Start difference. First operand 141 states and 184 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:41:46,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:46,543 INFO L93 Difference]: Finished difference Result 319 states and 412 transitions. [2025-03-17 14:41:46,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:41:46,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2025-03-17 14:41:46,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:46,544 INFO L225 Difference]: With dead ends: 319 [2025-03-17 14:41:46,544 INFO L226 Difference]: Without dead ends: 180 [2025-03-17 14:41:46,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:41:46,546 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 16 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:46,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 224 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:46,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-17 14:41:46,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 146. [2025-03-17 14:41:46,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 130 states have (on average 1.3846153846153846) internal successors, (180), 137 states have internal predecessors, (180), 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-17 14:41:46,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 188 transitions. [2025-03-17 14:41:46,556 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 188 transitions. Word has length 42 [2025-03-17 14:41:46,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:46,557 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 188 transitions. [2025-03-17 14:41:46,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:41:46,557 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 188 transitions. [2025-03-17 14:41:46,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 14:41:46,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:46,558 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:46,565 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-17 14:41:46,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:46,759 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:46,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:46,760 INFO L85 PathProgramCache]: Analyzing trace with hash 986323208, now seen corresponding path program 1 times [2025-03-17 14:41:46,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:46,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652997647] [2025-03-17 14:41:46,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:46,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:46,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 14:41:46,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 14:41:46,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:46,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:46,846 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 14:41:46,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:46,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652997647] [2025-03-17 14:41:46,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652997647] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:46,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529483854] [2025-03-17 14:41:46,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:46,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:46,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:46,849 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-17 14:41:46,850 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-17 14:41:46,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 14:41:46,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 14:41:46,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:46,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:46,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:41:46,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:46,928 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:41:46,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:41:47,018 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 14:41:47,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529483854] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:41:47,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:41:47,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-17 14:41:47,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053014217] [2025-03-17 14:41:47,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:41:47,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:41:47,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:47,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:41:47,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:41:47,020 INFO L87 Difference]: Start difference. First operand 146 states and 188 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 14:41:47,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:47,177 INFO L93 Difference]: Finished difference Result 449 states and 584 transitions. [2025-03-17 14:41:47,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:41:47,177 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 48 [2025-03-17 14:41:47,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:47,179 INFO L225 Difference]: With dead ends: 449 [2025-03-17 14:41:47,179 INFO L226 Difference]: Without dead ends: 342 [2025-03-17 14:41:47,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:41:47,180 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 138 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:47,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 461 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:47,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-03-17 14:41:47,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 158. [2025-03-17 14:41:47,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 142 states have (on average 1.3732394366197183) internal successors, (195), 149 states have internal predecessors, (195), 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-17 14:41:47,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 203 transitions. [2025-03-17 14:41:47,190 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 203 transitions. Word has length 48 [2025-03-17 14:41:47,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:47,191 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 203 transitions. [2025-03-17 14:41:47,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 14:41:47,191 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 203 transitions. [2025-03-17 14:41:47,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 14:41:47,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:47,191 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:47,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 14:41:47,392 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,SelfDestructingSolverStorable13 [2025-03-17 14:41:47,392 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:47,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:47,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1763765755, now seen corresponding path program 1 times [2025-03-17 14:41:47,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:47,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301797096] [2025-03-17 14:41:47,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:47,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:47,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 14:41:47,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 14:41:47,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:47,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:47,464 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 14:41:47,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:47,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301797096] [2025-03-17 14:41:47,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301797096] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:47,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003142622] [2025-03-17 14:41:47,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:47,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:47,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:47,467 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-17 14:41:47,476 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-17 14:41:47,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 14:41:47,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 14:41:47,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:47,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:47,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:41:47,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:47,549 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:41:47,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:41:47,615 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 14:41:47,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003142622] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:41:47,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:41:47,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-17 14:41:47,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062252746] [2025-03-17 14:41:47,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:41:47,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:41:47,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:47,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:41:47,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:41:47,616 INFO L87 Difference]: Start difference. First operand 158 states and 203 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 14:41:47,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:47,754 INFO L93 Difference]: Finished difference Result 459 states and 606 transitions. [2025-03-17 14:41:47,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:41:47,754 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 49 [2025-03-17 14:41:47,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:47,756 INFO L225 Difference]: With dead ends: 459 [2025-03-17 14:41:47,756 INFO L226 Difference]: Without dead ends: 352 [2025-03-17 14:41:47,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:41:47,757 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 123 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:47,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 372 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:47,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-03-17 14:41:47,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 170. [2025-03-17 14:41:47,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 154 states have (on average 1.3636363636363635) internal successors, (210), 161 states have internal predecessors, (210), 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-17 14:41:47,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 218 transitions. [2025-03-17 14:41:47,766 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 218 transitions. Word has length 49 [2025-03-17 14:41:47,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:47,766 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 218 transitions. [2025-03-17 14:41:47,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 14:41:47,766 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 218 transitions. [2025-03-17 14:41:47,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 14:41:47,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:47,767 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:47,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 14:41:47,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 14:41:47,967 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:47,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:47,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1348941928, now seen corresponding path program 1 times [2025-03-17 14:41:47,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:47,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935164183] [2025-03-17 14:41:47,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:47,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:47,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 14:41:47,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 14:41:47,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:47,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:47,996 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 14:41:47,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:47,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935164183] [2025-03-17 14:41:47,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935164183] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:47,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50068254] [2025-03-17 14:41:47,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:47,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:47,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:47,998 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-17 14:41:48,000 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-17 14:41:48,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 14:41:48,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 14:41:48,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:48,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:48,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 14:41:48,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:48,051 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-17 14:41:48,051 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:41:48,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50068254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:48,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:41:48,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2025-03-17 14:41:48,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530626177] [2025-03-17 14:41:48,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:48,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:48,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:48,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:48,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:48,052 INFO L87 Difference]: Start difference. First operand 170 states and 218 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:41:48,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:48,085 INFO L93 Difference]: Finished difference Result 303 states and 388 transitions. [2025-03-17 14:41:48,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:48,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 51 [2025-03-17 14:41:48,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:48,086 INFO L225 Difference]: With dead ends: 303 [2025-03-17 14:41:48,086 INFO L226 Difference]: Without dead ends: 187 [2025-03-17 14:41:48,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:48,087 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 6 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 166 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-17 14:41:48,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 166 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:48,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-17 14:41:48,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 175. [2025-03-17 14:41:48,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 159 states have (on average 1.3459119496855345) internal successors, (214), 166 states have internal predecessors, (214), 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-17 14:41:48,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 222 transitions. [2025-03-17 14:41:48,095 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 222 transitions. Word has length 51 [2025-03-17 14:41:48,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:48,095 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 222 transitions. [2025-03-17 14:41:48,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:41:48,095 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 222 transitions. [2025-03-17 14:41:48,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 14:41:48,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:48,096 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:48,106 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-17 14:41:48,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:48,297 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:48,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:48,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1028162080, now seen corresponding path program 1 times [2025-03-17 14:41:48,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:48,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718914020] [2025-03-17 14:41:48,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:48,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:48,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 14:41:48,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 14:41:48,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:48,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:48,404 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 14:41:48,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:48,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718914020] [2025-03-17 14:41:48,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718914020] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:48,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213570176] [2025-03-17 14:41:48,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:48,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:48,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:48,407 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-17 14:41:48,409 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-17 14:41:48,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 14:41:48,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 14:41:48,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:48,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:48,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 14:41:48,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:48,505 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 14:41:48,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:41:48,605 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 14:41:48,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213570176] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:41:48,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:41:48,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 17 [2025-03-17 14:41:48,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711805518] [2025-03-17 14:41:48,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:41:48,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 14:41:48,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:48,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 14:41:48,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-03-17 14:41:48,606 INFO L87 Difference]: Start difference. First operand 175 states and 222 transitions. Second operand has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 15 states have internal predecessors, (66), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-17 14:41:48,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:48,869 INFO L93 Difference]: Finished difference Result 366 states and 461 transitions. [2025-03-17 14:41:48,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 14:41:48,870 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 15 states have internal predecessors, (66), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 52 [2025-03-17 14:41:48,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:48,871 INFO L225 Difference]: With dead ends: 366 [2025-03-17 14:41:48,871 INFO L226 Difference]: Without dead ends: 203 [2025-03-17 14:41:48,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2025-03-17 14:41:48,871 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 45 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:48,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 872 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:41:48,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-17 14:41:48,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 147. [2025-03-17 14:41:48,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 131 states have (on average 1.3358778625954197) internal successors, (175), 138 states have internal predecessors, (175), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 14:41:48,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 183 transitions. [2025-03-17 14:41:48,883 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 183 transitions. Word has length 52 [2025-03-17 14:41:48,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:48,883 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 183 transitions. [2025-03-17 14:41:48,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 15 states have internal predecessors, (66), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-17 14:41:48,883 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 183 transitions. [2025-03-17 14:41:48,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 14:41:48,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:48,884 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:48,890 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-17 14:41:49,088 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,SelfDestructingSolverStorable16 [2025-03-17 14:41:49,088 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:49,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:49,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1473643643, now seen corresponding path program 1 times [2025-03-17 14:41:49,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:49,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127357996] [2025-03-17 14:41:49,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:49,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:49,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 14:41:49,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 14:41:49,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:49,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:49,169 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 14:41:49,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:49,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127357996] [2025-03-17 14:41:49,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127357996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:49,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462693809] [2025-03-17 14:41:49,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:49,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:49,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:49,171 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-17 14:41:49,173 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-17 14:41:49,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 14:41:49,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 14:41:49,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:49,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:49,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:41:49,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:49,284 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-17 14:41:49,284 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:41:49,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462693809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:49,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:41:49,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-17 14:41:49,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304744087] [2025-03-17 14:41:49,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:49,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:49,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:49,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:49,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:41:49,285 INFO L87 Difference]: Start difference. First operand 147 states and 183 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:41:49,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:49,324 INFO L93 Difference]: Finished difference Result 276 states and 344 transitions. [2025-03-17 14:41:49,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:49,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2025-03-17 14:41:49,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:49,326 INFO L225 Difference]: With dead ends: 276 [2025-03-17 14:41:49,326 INFO L226 Difference]: Without dead ends: 161 [2025-03-17 14:41:49,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:41:49,327 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 7 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:49,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 168 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:49,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-17 14:41:49,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 143. [2025-03-17 14:41:49,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 127 states have (on average 1.3228346456692914) internal successors, (168), 134 states have internal predecessors, (168), 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-17 14:41:49,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 176 transitions. [2025-03-17 14:41:49,336 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 176 transitions. Word has length 57 [2025-03-17 14:41:49,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:49,336 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 176 transitions. [2025-03-17 14:41:49,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:41:49,336 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 176 transitions. [2025-03-17 14:41:49,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-17 14:41:49,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:49,336 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:49,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 14:41:49,537 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,SelfDestructingSolverStorable17 [2025-03-17 14:41:49,537 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:49,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:49,537 INFO L85 PathProgramCache]: Analyzing trace with hash 435109393, now seen corresponding path program 1 times [2025-03-17 14:41:49,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:49,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521953645] [2025-03-17 14:41:49,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:49,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:49,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 14:41:49,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 14:41:49,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:49,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:49,638 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 14:41:49,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:49,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521953645] [2025-03-17 14:41:49,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521953645] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:49,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042569034] [2025-03-17 14:41:49,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:49,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:49,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:49,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-17 14:41:49,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-17 14:41:49,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 14:41:49,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 14:41:49,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:49,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:49,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 14:41:49,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:49,734 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 14:41:49,734 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:41:49,885 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 14:41:49,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042569034] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:41:49,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:41:49,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 9] total 17 [2025-03-17 14:41:49,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038205166] [2025-03-17 14:41:49,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:41:49,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 14:41:49,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:49,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 14:41:49,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-03-17 14:41:49,887 INFO L87 Difference]: Start difference. First operand 143 states and 176 transitions. Second operand has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 14 states have internal predecessors, (59), 4 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-17 14:41:50,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:50,076 INFO L93 Difference]: Finished difference Result 209 states and 253 transitions. [2025-03-17 14:41:50,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 14:41:50,076 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 14 states have internal predecessors, (59), 4 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) Word has length 58 [2025-03-17 14:41:50,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:50,077 INFO L225 Difference]: With dead ends: 209 [2025-03-17 14:41:50,077 INFO L226 Difference]: Without dead ends: 162 [2025-03-17 14:41:50,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2025-03-17 14:41:50,077 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 63 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:50,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 967 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:50,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-17 14:41:50,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 143. [2025-03-17 14:41:50,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 127 states have (on average 1.3070866141732282) internal successors, (166), 134 states have internal predecessors, (166), 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-17 14:41:50,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 174 transitions. [2025-03-17 14:41:50,087 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 174 transitions. Word has length 58 [2025-03-17 14:41:50,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:50,087 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 174 transitions. [2025-03-17 14:41:50,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 14 states have internal predecessors, (59), 4 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-17 14:41:50,087 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 174 transitions. [2025-03-17 14:41:50,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-17 14:41:50,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:50,088 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:50,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 14:41:50,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:50,292 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:50,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:50,292 INFO L85 PathProgramCache]: Analyzing trace with hash 219299764, now seen corresponding path program 1 times [2025-03-17 14:41:50,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:50,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084485352] [2025-03-17 14:41:50,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:50,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:50,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-17 14:41:50,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-17 14:41:50,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:50,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 14:41:50,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:50,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084485352] [2025-03-17 14:41:50,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084485352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:50,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:50,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 14:41:50,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52395807] [2025-03-17 14:41:50,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:50,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:41:50,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:50,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:41:50,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:41:50,397 INFO L87 Difference]: Start difference. First operand 143 states and 174 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:41:50,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:50,443 INFO L93 Difference]: Finished difference Result 195 states and 231 transitions. [2025-03-17 14:41:50,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:41:50,443 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 60 [2025-03-17 14:41:50,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:50,444 INFO L225 Difference]: With dead ends: 195 [2025-03-17 14:41:50,444 INFO L226 Difference]: Without dead ends: 146 [2025-03-17 14:41:50,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:41:50,445 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 1 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:50,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 504 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:50,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-17 14:41:50,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2025-03-17 14:41:50,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 127 states have (on average 1.2913385826771653) internal successors, (164), 134 states have internal predecessors, (164), 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-17 14:41:50,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 172 transitions. [2025-03-17 14:41:50,454 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 172 transitions. Word has length 60 [2025-03-17 14:41:50,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:50,454 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 172 transitions. [2025-03-17 14:41:50,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:41:50,454 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 172 transitions. [2025-03-17 14:41:50,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-17 14:41:50,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:50,455 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:50,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 14:41:50,455 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:50,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:50,455 INFO L85 PathProgramCache]: Analyzing trace with hash 68636368, now seen corresponding path program 2 times [2025-03-17 14:41:50,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:50,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765578529] [2025-03-17 14:41:50,456 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:41:50,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:50,462 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-03-17 14:41:50,472 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 63 statements. [2025-03-17 14:41:50,473 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:41:50,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:50,745 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-17 14:41:50,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:50,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765578529] [2025-03-17 14:41:50,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765578529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:50,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:50,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 14:41:50,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675260035] [2025-03-17 14:41:50,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:50,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:41:50,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:50,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:41:50,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:41:50,746 INFO L87 Difference]: Start difference. First operand 143 states and 172 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:41:50,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:50,931 INFO L93 Difference]: Finished difference Result 179 states and 214 transitions. [2025-03-17 14:41:50,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 14:41:50,931 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 63 [2025-03-17 14:41:50,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:50,932 INFO L225 Difference]: With dead ends: 179 [2025-03-17 14:41:50,932 INFO L226 Difference]: Without dead ends: 176 [2025-03-17 14:41:50,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:41:50,932 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 55 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:50,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 690 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:50,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-17 14:41:50,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 140. [2025-03-17 14:41:50,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 127 states have (on average 1.2677165354330708) internal successors, (161), 131 states have internal predecessors, (161), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 14:41:50,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 169 transitions. [2025-03-17 14:41:50,941 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 169 transitions. Word has length 63 [2025-03-17 14:41:50,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:50,941 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 169 transitions. [2025-03-17 14:41:50,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:41:50,941 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 169 transitions. [2025-03-17 14:41:50,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-17 14:41:50,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:50,942 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:50,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 14:41:50,942 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:50,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:50,942 INFO L85 PathProgramCache]: Analyzing trace with hash 2127727479, now seen corresponding path program 1 times [2025-03-17 14:41:50,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:50,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966321123] [2025-03-17 14:41:50,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:50,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:50,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 14:41:50,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 14:41:50,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:50,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:51,282 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-17 14:41:51,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:51,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966321123] [2025-03-17 14:41:51,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966321123] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:51,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139132429] [2025-03-17 14:41:51,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:51,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:51,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:51,285 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:41:51,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 14:41:51,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 14:41:51,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 14:41:51,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:51,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:51,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 14:41:51,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:51,397 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-17 14:41:51,398 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:41:51,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139132429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:51,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:41:51,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 13 [2025-03-17 14:41:51,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624663763] [2025-03-17 14:41:51,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:51,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:41:51,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:51,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:41:51,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:41:51,399 INFO L87 Difference]: Start difference. First operand 140 states and 169 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:41:51,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:51,482 INFO L93 Difference]: Finished difference Result 198 states and 234 transitions. [2025-03-17 14:41:51,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:41:51,482 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 64 [2025-03-17 14:41:51,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:51,483 INFO L225 Difference]: With dead ends: 198 [2025-03-17 14:41:51,483 INFO L226 Difference]: Without dead ends: 162 [2025-03-17 14:41:51,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:41:51,484 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 7 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:51,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 607 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:51,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-17 14:41:51,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 154. [2025-03-17 14:41:51,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 138 states have (on average 1.2463768115942029) internal successors, (172), 143 states have internal predecessors, (172), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-17 14:41:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 185 transitions. [2025-03-17 14:41:51,494 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 185 transitions. Word has length 64 [2025-03-17 14:41:51,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:51,495 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 185 transitions. [2025-03-17 14:41:51,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:41:51,495 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 185 transitions. [2025-03-17 14:41:51,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-17 14:41:51,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:51,496 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:51,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-17 14:41:51,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-17 14:41:51,700 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:51,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:51,702 INFO L85 PathProgramCache]: Analyzing trace with hash -2038157098, now seen corresponding path program 1 times [2025-03-17 14:41:51,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:51,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692204193] [2025-03-17 14:41:51,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:51,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:51,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 14:41:51,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 14:41:51,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:51,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:51,977 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-17 14:41:51,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:51,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692204193] [2025-03-17 14:41:51,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692204193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:51,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:51,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 14:41:51,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730894065] [2025-03-17 14:41:51,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:51,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:41:51,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:51,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:41:51,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:41:51,978 INFO L87 Difference]: Start difference. First operand 154 states and 185 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:41:52,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:52,058 INFO L93 Difference]: Finished difference Result 176 states and 210 transitions. [2025-03-17 14:41:52,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:41:52,058 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 64 [2025-03-17 14:41:52,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:52,059 INFO L225 Difference]: With dead ends: 176 [2025-03-17 14:41:52,059 INFO L226 Difference]: Without dead ends: 175 [2025-03-17 14:41:52,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:41:52,060 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 9 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:52,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 522 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:52,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-17 14:41:52,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-03-17 14:41:52,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 159 states have (on average 1.2327044025157232) internal successors, (196), 163 states have internal predecessors, (196), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-17 14:41:52,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 209 transitions. [2025-03-17 14:41:52,071 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 209 transitions. Word has length 64 [2025-03-17 14:41:52,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:52,071 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 209 transitions. [2025-03-17 14:41:52,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:41:52,071 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 209 transitions. [2025-03-17 14:41:52,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 14:41:52,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:52,072 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:52,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 14:41:52,072 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:52,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:52,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1241639471, now seen corresponding path program 1 times [2025-03-17 14:41:52,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:52,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516841458] [2025-03-17 14:41:52,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:52,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:52,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 14:41:52,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 14:41:52,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:52,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-17 14:41:52,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:52,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516841458] [2025-03-17 14:41:52,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516841458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:52,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:52,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:41:52,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464923221] [2025-03-17 14:41:52,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:52,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:41:52,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:52,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:41:52,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:41:52,114 INFO L87 Difference]: Start difference. First operand 175 states and 209 transitions. Second operand has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:41:52,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:52,184 INFO L93 Difference]: Finished difference Result 175 states and 209 transitions. [2025-03-17 14:41:52,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:41:52,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 65 [2025-03-17 14:41:52,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:52,185 INFO L225 Difference]: With dead ends: 175 [2025-03-17 14:41:52,185 INFO L226 Difference]: Without dead ends: 174 [2025-03-17 14:41:52,185 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-17 14:41:52,185 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 29 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:52,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 189 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:52,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-17 14:41:52,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2025-03-17 14:41:52,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 159 states have (on average 1.2264150943396226) internal successors, (195), 162 states have internal predecessors, (195), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-17 14:41:52,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 208 transitions. [2025-03-17 14:41:52,196 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 208 transitions. Word has length 65 [2025-03-17 14:41:52,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:52,196 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 208 transitions. [2025-03-17 14:41:52,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:41:52,197 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 208 transitions. [2025-03-17 14:41:52,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-17 14:41:52,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:52,197 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:52,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 14:41:52,197 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:52,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:52,198 INFO L85 PathProgramCache]: Analyzing trace with hash -163881996, now seen corresponding path program 1 times [2025-03-17 14:41:52,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:52,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026383714] [2025-03-17 14:41:52,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:52,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:52,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 14:41:52,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 14:41:52,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:52,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:52,286 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 14:41:52,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:52,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026383714] [2025-03-17 14:41:52,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026383714] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:52,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168112299] [2025-03-17 14:41:52,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:52,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:52,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:52,290 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:41:52,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 14:41:52,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 14:41:52,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 14:41:52,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:52,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:52,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 14:41:52,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:52,471 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-17 14:41:52,471 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:41:52,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168112299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:52,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:41:52,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2025-03-17 14:41:52,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353322827] [2025-03-17 14:41:52,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:52,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:41:52,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:52,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:41:52,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:41:52,473 INFO L87 Difference]: Start difference. First operand 174 states and 208 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:41:52,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:52,573 INFO L93 Difference]: Finished difference Result 213 states and 251 transitions. [2025-03-17 14:41:52,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:41:52,574 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 66 [2025-03-17 14:41:52,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:52,575 INFO L225 Difference]: With dead ends: 213 [2025-03-17 14:41:52,575 INFO L226 Difference]: Without dead ends: 191 [2025-03-17 14:41:52,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:41:52,575 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 11 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:52,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 588 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:52,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-17 14:41:52,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 184. [2025-03-17 14:41:52,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 169 states have (on average 1.2189349112426036) internal successors, (206), 172 states have internal predecessors, (206), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-17 14:41:52,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 219 transitions. [2025-03-17 14:41:52,587 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 219 transitions. Word has length 66 [2025-03-17 14:41:52,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:52,587 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 219 transitions. [2025-03-17 14:41:52,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:41:52,587 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 219 transitions. [2025-03-17 14:41:52,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 14:41:52,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:52,589 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:52,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-17 14:41:52,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-17 14:41:52,790 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:52,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:52,791 INFO L85 PathProgramCache]: Analyzing trace with hash -769022346, now seen corresponding path program 1 times [2025-03-17 14:41:52,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:52,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725941376] [2025-03-17 14:41:52,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:52,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:52,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 14:41:52,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 14:41:52,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:52,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:52,887 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 14:41:52,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:52,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725941376] [2025-03-17 14:41:52,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725941376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:52,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399673725] [2025-03-17 14:41:52,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:52,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:52,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:52,890 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:41:52,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 14:41:52,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 14:41:52,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 14:41:52,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:52,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:52,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 14:41:52,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:53,075 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-17 14:41:53,075 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:41:53,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399673725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:53,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:41:53,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 15 [2025-03-17 14:41:53,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17043338] [2025-03-17 14:41:53,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:53,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:41:53,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:53,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:41:53,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-17 14:41:53,076 INFO L87 Difference]: Start difference. First operand 184 states and 219 transitions. Second operand has 12 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:41:53,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:53,203 INFO L93 Difference]: Finished difference Result 205 states and 241 transitions. [2025-03-17 14:41:53,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:41:53,203 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 68 [2025-03-17 14:41:53,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:53,204 INFO L225 Difference]: With dead ends: 205 [2025-03-17 14:41:53,204 INFO L226 Difference]: Without dead ends: 195 [2025-03-17 14:41:53,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-17 14:41:53,205 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 36 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:53,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 451 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:53,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-17 14:41:53,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 190. [2025-03-17 14:41:53,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 176 states have (on average 1.1988636363636365) internal successors, (211), 178 states have internal predecessors, (211), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-17 14:41:53,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 224 transitions. [2025-03-17 14:41:53,219 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 224 transitions. Word has length 68 [2025-03-17 14:41:53,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:53,219 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 224 transitions. [2025-03-17 14:41:53,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:41:53,220 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 224 transitions. [2025-03-17 14:41:53,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-17 14:41:53,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:53,220 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:53,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-17 14:41:53,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-17 14:41:53,421 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:53,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:53,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1035932716, now seen corresponding path program 1 times [2025-03-17 14:41:53,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:53,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535975273] [2025-03-17 14:41:53,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:53,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:53,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 14:41:53,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 14:41:53,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:53,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:53,493 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-17 14:41:53,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:53,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535975273] [2025-03-17 14:41:53,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535975273] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:53,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009093052] [2025-03-17 14:41:53,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:53,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:53,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:53,496 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:41:53,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 14:41:53,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 14:41:53,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 14:41:53,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:53,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:53,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 14:41:53,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:53,596 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 14:41:53,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:41:53,677 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 14:41:53,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009093052] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:41:53,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:41:53,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2025-03-17 14:41:53,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548821630] [2025-03-17 14:41:53,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:41:53,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 14:41:53,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:53,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 14:41:53,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-17 14:41:53,678 INFO L87 Difference]: Start difference. First operand 190 states and 224 transitions. Second operand has 15 states, 15 states have (on average 5.4) internal successors, (81), 13 states have internal predecessors, (81), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-17 14:41:53,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:53,933 INFO L93 Difference]: Finished difference Result 418 states and 491 transitions. [2025-03-17 14:41:53,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 14:41:53,934 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 13 states have internal predecessors, (81), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 71 [2025-03-17 14:41:53,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:53,935 INFO L225 Difference]: With dead ends: 418 [2025-03-17 14:41:53,935 INFO L226 Difference]: Without dead ends: 257 [2025-03-17 14:41:53,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2025-03-17 14:41:53,936 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 35 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:53,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 634 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:41:53,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-17 14:41:53,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 196. [2025-03-17 14:41:53,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 182 states have (on average 1.1868131868131868) internal successors, (216), 183 states have internal predecessors, (216), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-17 14:41:53,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 229 transitions. [2025-03-17 14:41:53,950 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 229 transitions. Word has length 71 [2025-03-17 14:41:53,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:53,950 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 229 transitions. [2025-03-17 14:41:53,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 13 states have internal predecessors, (81), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-17 14:41:53,951 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 229 transitions. [2025-03-17 14:41:53,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 14:41:53,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:53,952 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:53,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-17 14:41:54,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:54,156 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:54,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:54,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1151000519, now seen corresponding path program 1 times [2025-03-17 14:41:54,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:54,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060443133] [2025-03-17 14:41:54,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:54,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:54,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 14:41:54,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 14:41:54,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:54,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:54,284 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-17 14:41:54,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:54,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060443133] [2025-03-17 14:41:54,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060443133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:54,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:54,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:41:54,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305883674] [2025-03-17 14:41:54,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:54,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:41:54,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:54,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:41:54,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:41:54,286 INFO L87 Difference]: Start difference. First operand 196 states and 229 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:41:54,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:54,340 INFO L93 Difference]: Finished difference Result 196 states and 229 transitions. [2025-03-17 14:41:54,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:41:54,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 75 [2025-03-17 14:41:54,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:54,342 INFO L225 Difference]: With dead ends: 196 [2025-03-17 14:41:54,342 INFO L226 Difference]: Without dead ends: 195 [2025-03-17 14:41:54,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:41:54,342 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 27 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:54,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 241 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:54,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-17 14:41:54,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 174. [2025-03-17 14:41:54,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 161 states have (on average 1.186335403726708) internal successors, (191), 162 states have internal predecessors, (191), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-17 14:41:54,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 204 transitions. [2025-03-17 14:41:54,351 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 204 transitions. Word has length 75 [2025-03-17 14:41:54,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:54,351 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 204 transitions. [2025-03-17 14:41:54,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:41:54,351 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 204 transitions. [2025-03-17 14:41:54,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-17 14:41:54,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:54,353 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:54,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 14:41:54,353 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:54,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:54,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1990065815, now seen corresponding path program 1 times [2025-03-17 14:41:54,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:54,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974138945] [2025-03-17 14:41:54,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:54,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:54,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 14:41:54,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 14:41:54,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:54,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:54,464 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-17 14:41:54,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:54,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974138945] [2025-03-17 14:41:54,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974138945] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:54,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785203330] [2025-03-17 14:41:54,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:54,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:54,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:54,467 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:41:54,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-17 14:41:54,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 14:41:54,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 14:41:54,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:54,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:54,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 14:41:54,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:54,627 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-17 14:41:54,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:41:54,771 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-17 14:41:54,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785203330] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:41:54,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:41:54,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2025-03-17 14:41:54,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286954303] [2025-03-17 14:41:54,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:41:54,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 14:41:54,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:54,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 14:41:54,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2025-03-17 14:41:54,772 INFO L87 Difference]: Start difference. First operand 174 states and 204 transitions. Second operand has 19 states, 19 states have (on average 5.052631578947368) internal successors, (96), 17 states have internal predecessors, (96), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-17 14:41:55,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:55,118 INFO L93 Difference]: Finished difference Result 391 states and 459 transitions. [2025-03-17 14:41:55,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 14:41:55,119 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.052631578947368) internal successors, (96), 17 states have internal predecessors, (96), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 77 [2025-03-17 14:41:55,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:55,120 INFO L225 Difference]: With dead ends: 391 [2025-03-17 14:41:55,120 INFO L226 Difference]: Without dead ends: 246 [2025-03-17 14:41:55,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2025-03-17 14:41:55,121 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 61 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:55,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 756 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 14:41:55,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-17 14:41:55,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 178. [2025-03-17 14:41:55,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 165 states have (on average 1.1696969696969697) internal successors, (193), 166 states have internal predecessors, (193), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-17 14:41:55,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 206 transitions. [2025-03-17 14:41:55,151 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 206 transitions. Word has length 77 [2025-03-17 14:41:55,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:55,151 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 206 transitions. [2025-03-17 14:41:55,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.052631578947368) internal successors, (96), 17 states have internal predecessors, (96), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-17 14:41:55,152 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 206 transitions. [2025-03-17 14:41:55,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-17 14:41:55,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:55,152 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:55,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-17 14:41:55,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-17 14:41:55,354 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:55,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:55,354 INFO L85 PathProgramCache]: Analyzing trace with hash 75727099, now seen corresponding path program 1 times [2025-03-17 14:41:55,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:55,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822232318] [2025-03-17 14:41:55,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:55,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:55,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 14:41:55,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 14:41:55,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:55,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:55,435 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-17 14:41:55,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:55,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822232318] [2025-03-17 14:41:55,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822232318] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:55,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315582364] [2025-03-17 14:41:55,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:55,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:55,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:55,438 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:41:55,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-17 14:41:55,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 14:41:55,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 14:41:55,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:55,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:55,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 14:41:55,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:55,548 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 26 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 14:41:55,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:41:55,677 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-17 14:41:55,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315582364] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:41:55,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:41:55,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-03-17 14:41:55,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395087966] [2025-03-17 14:41:55,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:41:55,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 14:41:55,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:55,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 14:41:55,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2025-03-17 14:41:55,679 INFO L87 Difference]: Start difference. First operand 178 states and 206 transitions. Second operand has 20 states, 20 states have (on average 6.1) internal successors, (122), 20 states have internal predecessors, (122), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 14:41:55,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:55,863 INFO L93 Difference]: Finished difference Result 697 states and 839 transitions. [2025-03-17 14:41:55,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 14:41:55,863 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.1) internal successors, (122), 20 states have internal predecessors, (122), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2025-03-17 14:41:55,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:55,865 INFO L225 Difference]: With dead ends: 697 [2025-03-17 14:41:55,865 INFO L226 Difference]: Without dead ends: 555 [2025-03-17 14:41:55,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=267, Unknown=0, NotChecked=0, Total=420 [2025-03-17 14:41:55,866 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 304 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:55,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 371 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:55,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-17 14:41:55,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 202. [2025-03-17 14:41:55,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 189 states have (on average 1.17989417989418) internal successors, (223), 190 states have internal predecessors, (223), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-17 14:41:55,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 236 transitions. [2025-03-17 14:41:55,878 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 236 transitions. Word has length 78 [2025-03-17 14:41:55,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:55,878 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 236 transitions. [2025-03-17 14:41:55,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.1) internal successors, (122), 20 states have internal predecessors, (122), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 14:41:55,878 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 236 transitions. [2025-03-17 14:41:55,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-17 14:41:55,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:55,879 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:55,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-17 14:41:56,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:56,083 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:56,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:56,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1106980050, now seen corresponding path program 1 times [2025-03-17 14:41:56,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:56,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099130112] [2025-03-17 14:41:56,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:56,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:56,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 14:41:56,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 14:41:56,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:56,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-17 14:41:56,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:56,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099130112] [2025-03-17 14:41:56,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099130112] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:56,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528787998] [2025-03-17 14:41:56,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:56,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:56,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:56,238 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:41:56,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-17 14:41:56,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 14:41:56,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 14:41:56,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:56,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:56,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 14:41:56,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:56,358 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-17 14:41:56,359 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:41:56,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528787998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:56,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:41:56,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2025-03-17 14:41:56,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76156025] [2025-03-17 14:41:56,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:56,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:41:56,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:56,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:41:56,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-17 14:41:56,360 INFO L87 Difference]: Start difference. First operand 202 states and 236 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:41:56,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:56,453 INFO L93 Difference]: Finished difference Result 250 states and 289 transitions. [2025-03-17 14:41:56,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:41:56,453 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 81 [2025-03-17 14:41:56,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:56,454 INFO L225 Difference]: With dead ends: 250 [2025-03-17 14:41:56,454 INFO L226 Difference]: Without dead ends: 223 [2025-03-17 14:41:56,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:41:56,455 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 14 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:56,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 586 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:56,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-17 14:41:56,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 208. [2025-03-17 14:41:56,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 195 states have (on average 1.1794871794871795) internal successors, (230), 195 states have internal predecessors, (230), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-17 14:41:56,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 243 transitions. [2025-03-17 14:41:56,466 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 243 transitions. Word has length 81 [2025-03-17 14:41:56,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:56,466 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 243 transitions. [2025-03-17 14:41:56,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:41:56,466 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 243 transitions. [2025-03-17 14:41:56,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-17 14:41:56,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:56,467 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:56,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-17 14:41:56,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:56,667 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:56,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:56,668 INFO L85 PathProgramCache]: Analyzing trace with hash 601421425, now seen corresponding path program 2 times [2025-03-17 14:41:56,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:56,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881352606] [2025-03-17 14:41:56,668 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:41:56,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:56,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 81 statements into 2 equivalence classes. [2025-03-17 14:41:56,679 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 81 statements. [2025-03-17 14:41:56,679 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:41:56,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:56,763 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-17 14:41:56,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:56,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881352606] [2025-03-17 14:41:56,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881352606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:56,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:56,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:41:56,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759332250] [2025-03-17 14:41:56,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:56,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:41:56,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:56,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:41:56,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:41:56,766 INFO L87 Difference]: Start difference. First operand 208 states and 243 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:41:56,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:56,826 INFO L93 Difference]: Finished difference Result 208 states and 243 transitions. [2025-03-17 14:41:56,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:41:56,826 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 81 [2025-03-17 14:41:56,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:56,827 INFO L225 Difference]: With dead ends: 208 [2025-03-17 14:41:56,827 INFO L226 Difference]: Without dead ends: 207 [2025-03-17 14:41:56,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:41:56,829 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 28 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:56,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 304 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:56,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-17 14:41:56,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 200. [2025-03-17 14:41:56,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 188 states have (on average 1.1808510638297873) internal successors, (222), 187 states have internal predecessors, (222), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-17 14:41:56,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 235 transitions. [2025-03-17 14:41:56,844 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 235 transitions. Word has length 81 [2025-03-17 14:41:56,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:56,844 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 235 transitions. [2025-03-17 14:41:56,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:41:56,844 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 235 transitions. [2025-03-17 14:41:56,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-17 14:41:56,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:56,845 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:56,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 14:41:56,845 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-17 14:41:56,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:56,845 INFO L85 PathProgramCache]: Analyzing trace with hash -785738423, now seen corresponding path program 1 times [2025-03-17 14:41:56,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:56,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89730822] [2025-03-17 14:41:56,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:56,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:56,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 14:41:56,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 14:41:56,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:56,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:56,887 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-17 14:41:56,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:56,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89730822] [2025-03-17 14:41:56,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89730822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:56,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:56,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:41:56,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40246726] [2025-03-17 14:41:56,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:56,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:41:56,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:56,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:41:56,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:41:56,888 INFO L87 Difference]: Start difference. First operand 200 states and 235 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:41:56,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:56,915 INFO L93 Difference]: Finished difference Result 200 states and 235 transitions. [2025-03-17 14:41:56,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:41:56,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 90 [2025-03-17 14:41:56,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:56,916 INFO L225 Difference]: With dead ends: 200 [2025-03-17 14:41:56,916 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 14:41:56,916 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-17 14:41:56,916 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 17 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:56,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 180 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:56,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 14:41:56,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 14:41:56,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:56,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 14:41:56,917 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 90 [2025-03-17 14:41:56,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:56,917 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 14:41:56,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:41:56,918 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 14:41:56,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 14:41:56,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2025-03-17 14:41:56,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2025-03-17 14:41:56,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2025-03-17 14:41:56,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-03-17 14:41:56,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-03-17 14:41:56,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-03-17 14:41:56,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-03-17 14:41:56,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-03-17 14:41:56,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2025-03-17 14:41:56,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2025-03-17 14:41:56,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-03-17 14:41:56,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-03-17 14:41:56,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-03-17 14:41:56,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-03-17 14:41:56,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-03-17 14:41:56,921 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-03-17 14:41:56,921 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-03-17 14:41:56,921 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-03-17 14:41:56,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 14:41:56,923 INFO L422 BasicCegarLoop]: Path program histogram: [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] [2025-03-17 14:41:56,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 14:42:03,899 WARN L286 SmtUtils]: Spent 6.96s on a formula simplification. DAG size of input: 81 DAG size of output: 86 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-17 14:42:10,339 WARN L286 SmtUtils]: Spent 6.44s on a formula simplification. DAG size of input: 81 DAG size of output: 86 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-17 14:42:17,060 WARN L286 SmtUtils]: Spent 6.35s on a formula simplification. DAG size of input: 81 DAG size of output: 86 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)