./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-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_4-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 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:41:43,001 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:41:43,057 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:43,062 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:41:43,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:41:43,084 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:41:43,085 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:41:43,085 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:41:43,085 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:41:43,085 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:41:43,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:41:43,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:41:43,086 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:41:43,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:41:43,087 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:41:43,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:41:43,087 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:41:43,087 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:41:43,087 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:41:43,087 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:41:43,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:41:43,087 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:41:43,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:41:43,088 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:41:43,088 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:41:43,088 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:41:43,088 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:41:43,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:41:43,088 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:41:43,088 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:41:43,088 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:41:43,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:41:43,089 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:41:43,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:41:43,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:41:43,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:41:43,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:41:43,089 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:41:43,089 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:41:43,090 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:41:43,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:41:43,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:41:43,090 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:41:43,090 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:41:43,090 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:41:43,090 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 -> 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b [2025-03-17 14:41:43,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:41:43,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:41:43,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:41:43,300 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:41:43,300 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:41:43,301 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2025-03-17 14:41:44,430 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6e12b37c/87688d9bd1c44be8a6c22ba12d4ede44/FLAG2981b1f17 [2025-03-17 14:41:44,658 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:41:44,659 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2025-03-17 14:41:44,668 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6e12b37c/87688d9bd1c44be8a6c22ba12d4ede44/FLAG2981b1f17 [2025-03-17 14:41:44,994 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6e12b37c/87688d9bd1c44be8a6c22ba12d4ede44 [2025-03-17 14:41:44,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:41:44,997 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:41:44,999 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:41:44,999 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:41:45,002 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:41:45,003 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:41:44" (1/1) ... [2025-03-17 14:41:45,004 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56cf97a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:45, skipping insertion in model container [2025-03-17 14:41:45,004 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:41:44" (1/1) ... [2025-03-17 14:41:45,020 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:41:45,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:41:45,167 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:41:45,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:41:45,216 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:41:45,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:45 WrapperNode [2025-03-17 14:41:45,217 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:41:45,218 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:41:45,218 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:41:45,218 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:41:45,223 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:45" (1/1) ... [2025-03-17 14:41:45,228 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:45" (1/1) ... [2025-03-17 14:41:45,238 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2025-03-17 14:41:45,238 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:41:45,238 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:41:45,238 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:41:45,239 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:41:45,244 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:45" (1/1) ... [2025-03-17 14:41:45,244 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:45" (1/1) ... [2025-03-17 14:41:45,245 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:45" (1/1) ... [2025-03-17 14:41:45,260 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:45,260 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:45" (1/1) ... [2025-03-17 14:41:45,260 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:45" (1/1) ... [2025-03-17 14:41:45,263 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:45" (1/1) ... [2025-03-17 14:41:45,264 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:45" (1/1) ... [2025-03-17 14:41:45,268 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:45" (1/1) ... [2025-03-17 14:41:45,272 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:45" (1/1) ... [2025-03-17 14:41:45,273 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:41:45,273 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:41:45,273 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:41:45,273 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:41:45,274 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:45" (1/1) ... [2025-03-17 14:41:45,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:41:45,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:45,299 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:45,302 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:45,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:41:45,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:41:45,320 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-03-17 14:41:45,320 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-03-17 14:41:45,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:41:45,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:41:45,320 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2025-03-17 14:41:45,320 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2025-03-17 14:41:45,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 14:41:45,320 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 14:41:45,375 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:41:45,376 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:41:45,728 INFO L? ?]: Removed 64 outVars from TransFormulas that were not future-live. [2025-03-17 14:41:45,732 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:41:45,751 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:41:45,751 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 14:41:45,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:41:45 BoogieIcfgContainer [2025-03-17 14:41:45,751 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:41:45,753 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:41:45,753 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:41:45,756 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:41:45,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:41:44" (1/3) ... [2025-03-17 14:41:45,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372d6eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:41:45, skipping insertion in model container [2025-03-17 14:41:45,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:45" (2/3) ... [2025-03-17 14:41:45,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@372d6eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:41:45, skipping insertion in model container [2025-03-17 14:41:45,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:41:45" (3/3) ... [2025-03-17 14:41:45,758 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2025-03-17 14:41:45,767 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:41:45,768 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_4-2a.c.cil.c that has 4 procedures, 103 locations, 1 initial locations, 2 loop locations, and 16 error locations. [2025-03-17 14:41:45,801 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:41:45,810 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;@2f299fc0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:41:45,810 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-17 14:41:45,814 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 75 states have (on average 1.6133333333333333) internal successors, (121), 91 states have internal predecessors, (121), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 14:41:45,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 14:41:45,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:45,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:45,819 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:45,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:45,823 INFO L85 PathProgramCache]: Analyzing trace with hash -426691127, now seen corresponding path program 1 times [2025-03-17 14:41:45,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:45,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357628278] [2025-03-17 14:41:45,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:45,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:45,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:41:45,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:41:45,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:45,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:45,966 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,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:45,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357628278] [2025-03-17 14:41:45,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357628278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:45,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:45,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:41:45,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42931999] [2025-03-17 14:41:45,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:45,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:41:45,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:45,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:41:45,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:41:45,984 INFO L87 Difference]: Start difference. First operand has 103 states, 75 states have (on average 1.6133333333333333) internal successors, (121), 91 states have internal predecessors, (121), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) 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:46,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:46,117 INFO L93 Difference]: Finished difference Result 249 states and 354 transitions. [2025-03-17 14:41:46,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:41:46,121 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:46,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:46,126 INFO L225 Difference]: With dead ends: 249 [2025-03-17 14:41:46,127 INFO L226 Difference]: Without dead ends: 140 [2025-03-17 14:41:46,132 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:46,137 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 80 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:46,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 320 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:46,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-17 14:41:46,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 130. [2025-03-17 14:41:46,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 107 states have (on average 1.5046728971962617) internal successors, (161), 119 states have internal predecessors, (161), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:41:46,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 174 transitions. [2025-03-17 14:41:46,169 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 174 transitions. Word has length 7 [2025-03-17 14:41:46,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:46,170 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 174 transitions. [2025-03-17 14:41:46,170 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:46,170 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 174 transitions. [2025-03-17 14:41:46,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 14:41:46,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:46,171 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:46,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:41:46,171 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:46,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:46,172 INFO L85 PathProgramCache]: Analyzing trace with hash 737894531, now seen corresponding path program 1 times [2025-03-17 14:41:46,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:46,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409890485] [2025-03-17 14:41:46,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:46,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:46,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:41:46,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:41:46,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:46,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:46,220 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:46,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:46,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409890485] [2025-03-17 14:41:46,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409890485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:46,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:46,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:41:46,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498979094] [2025-03-17 14:41:46,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:46,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:46,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:46,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:46,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:46,222 INFO L87 Difference]: Start difference. First operand 130 states and 174 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:46,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:46,281 INFO L93 Difference]: Finished difference Result 130 states and 174 transitions. [2025-03-17 14:41:46,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:46,282 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:46,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:46,283 INFO L225 Difference]: With dead ends: 130 [2025-03-17 14:41:46,283 INFO L226 Difference]: Without dead ends: 129 [2025-03-17 14:41:46,284 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:46,284 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:46,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 193 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:46,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-17 14:41:46,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-03-17 14:41:46,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 107 states have (on average 1.485981308411215) internal successors, (159), 118 states have internal predecessors, (159), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:41:46,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 172 transitions. [2025-03-17 14:41:46,300 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 172 transitions. Word has length 11 [2025-03-17 14:41:46,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:46,300 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 172 transitions. [2025-03-17 14:41:46,300 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:46,301 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 172 transitions. [2025-03-17 14:41:46,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 14:41:46,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:46,301 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:46,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:41:46,301 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:46,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:46,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1399893973, now seen corresponding path program 1 times [2025-03-17 14:41:46,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:46,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201174775] [2025-03-17 14:41:46,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:46,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:46,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:41:46,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:41:46,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:46,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:46,387 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:46,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:46,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201174775] [2025-03-17 14:41:46,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201174775] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:46,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666102223] [2025-03-17 14:41:46,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:46,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:46,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:46,389 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:46,390 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:46,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:41:46,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:41:46,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:46,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:46,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:41:46,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:46,448 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:46,448 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:41:46,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666102223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:46,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:41:46,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-17 14:41:46,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591651222] [2025-03-17 14:41:46,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:46,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:46,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:46,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:46,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:41:46,449 INFO L87 Difference]: Start difference. First operand 129 states and 172 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:46,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:46,499 INFO L93 Difference]: Finished difference Result 141 states and 191 transitions. [2025-03-17 14:41:46,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:46,499 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:46,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:46,500 INFO L225 Difference]: With dead ends: 141 [2025-03-17 14:41:46,500 INFO L226 Difference]: Without dead ends: 140 [2025-03-17 14:41:46,500 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:46,501 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 13 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:46,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 189 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:46,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-17 14:41:46,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 130. [2025-03-17 14:41:46,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.4814814814814814) internal successors, (160), 119 states have internal predecessors, (160), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:41:46,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 173 transitions. [2025-03-17 14:41:46,511 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 173 transitions. Word has length 12 [2025-03-17 14:41:46,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:46,511 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 173 transitions. [2025-03-17 14:41:46,511 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:46,511 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 173 transitions. [2025-03-17 14:41:46,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 14:41:46,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:46,511 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:46,517 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:46,712 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:46,712 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:46,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:46,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1399908965, now seen corresponding path program 1 times [2025-03-17 14:41:46,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:46,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945197558] [2025-03-17 14:41:46,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:46,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:46,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:41:46,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:41:46,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:46,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:46,748 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:46,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:46,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945197558] [2025-03-17 14:41:46,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945197558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:46,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:46,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:41:46,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548123810] [2025-03-17 14:41:46,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:46,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:46,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:46,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:46,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:46,750 INFO L87 Difference]: Start difference. First operand 130 states and 173 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:46,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:46,799 INFO L93 Difference]: Finished difference Result 249 states and 330 transitions. [2025-03-17 14:41:46,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:46,799 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:46,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:46,800 INFO L225 Difference]: With dead ends: 249 [2025-03-17 14:41:46,800 INFO L226 Difference]: Without dead ends: 143 [2025-03-17 14:41:46,801 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:46,801 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 11 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:46,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 194 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:46,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-17 14:41:46,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 133. [2025-03-17 14:41:46,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 111 states have (on average 1.4684684684684686) internal successors, (163), 122 states have internal predecessors, (163), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:41:46,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 176 transitions. [2025-03-17 14:41:46,809 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 176 transitions. Word has length 12 [2025-03-17 14:41:46,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:46,809 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 176 transitions. [2025-03-17 14:41:46,809 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:46,809 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 176 transitions. [2025-03-17 14:41:46,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 14:41:46,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:46,809 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:46,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:41:46,809 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:46,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:46,810 INFO L85 PathProgramCache]: Analyzing trace with hash -514067846, now seen corresponding path program 1 times [2025-03-17 14:41:46,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:46,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167205747] [2025-03-17 14:41:46,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:46,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:46,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:41:46,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:41:46,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:46,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:46,854 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:46,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:46,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167205747] [2025-03-17 14:41:46,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167205747] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:46,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236841804] [2025-03-17 14:41:46,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:46,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:46,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:46,857 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:46,859 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:46,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:41:46,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:41:46,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:46,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:46,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:41:46,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:46,911 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:46,911 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:41:46,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236841804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:46,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:41:46,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-17 14:41:46,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903360615] [2025-03-17 14:41:46,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:46,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:41:46,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:46,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:41:46,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:41:46,912 INFO L87 Difference]: Start difference. First operand 133 states and 176 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:46,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:46,990 INFO L93 Difference]: Finished difference Result 164 states and 223 transitions. [2025-03-17 14:41:46,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:41:46,990 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:46,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:46,991 INFO L225 Difference]: With dead ends: 164 [2025-03-17 14:41:46,991 INFO L226 Difference]: Without dead ends: 162 [2025-03-17 14:41:46,991 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:46,992 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 24 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:46,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 285 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:46,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-17 14:41:47,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 140. [2025-03-17 14:41:47,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 118 states have (on average 1.4406779661016949) internal successors, (170), 129 states have internal predecessors, (170), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:41:47,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 183 transitions. [2025-03-17 14:41:47,005 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 183 transitions. Word has length 12 [2025-03-17 14:41:47,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:47,005 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 183 transitions. [2025-03-17 14:41:47,005 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:47,005 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 183 transitions. [2025-03-17 14:41:47,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 14:41:47,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:47,005 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:47,011 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:47,206 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:47,206 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:47,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:47,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1243765958, now seen corresponding path program 1 times [2025-03-17 14:41:47,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:47,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524441733] [2025-03-17 14:41:47,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:47,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:47,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:41:47,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:41:47,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:47,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:47,226 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:47,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:47,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524441733] [2025-03-17 14:41:47,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524441733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:47,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:47,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:41:47,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856892071] [2025-03-17 14:41:47,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:47,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:47,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:47,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:47,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:47,227 INFO L87 Difference]: Start difference. First operand 140 states and 183 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:47,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:47,258 INFO L93 Difference]: Finished difference Result 140 states and 183 transitions. [2025-03-17 14:41:47,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:47,259 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:47,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:47,259 INFO L225 Difference]: With dead ends: 140 [2025-03-17 14:41:47,260 INFO L226 Difference]: Without dead ends: 139 [2025-03-17 14:41:47,260 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:47,261 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:47,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 192 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:47,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-17 14:41:47,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2025-03-17 14:41:47,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 116 states have (on average 1.4310344827586208) internal successors, (166), 126 states have internal predecessors, (166), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:41:47,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 179 transitions. [2025-03-17 14:41:47,273 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 179 transitions. Word has length 13 [2025-03-17 14:41:47,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:47,273 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 179 transitions. [2025-03-17 14:41:47,274 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:47,274 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 179 transitions. [2025-03-17 14:41:47,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 14:41:47,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:47,275 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:47,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:41:47,276 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:47,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:47,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1425857122, now seen corresponding path program 1 times [2025-03-17 14:41:47,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:47,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205187066] [2025-03-17 14:41:47,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:47,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:47,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:41:47,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:41:47,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:47,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:47,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:41:47,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:47,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205187066] [2025-03-17 14:41:47,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205187066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:47,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:47,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:41:47,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246938428] [2025-03-17 14:41:47,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:47,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:41:47,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:47,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:41:47,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:41:47,322 INFO L87 Difference]: Start difference. First operand 137 states and 179 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:41:47,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:47,429 INFO L93 Difference]: Finished difference Result 200 states and 262 transitions. [2025-03-17 14:41:47,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:41:47,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-17 14:41:47,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:47,430 INFO L225 Difference]: With dead ends: 200 [2025-03-17 14:41:47,430 INFO L226 Difference]: Without dead ends: 198 [2025-03-17 14:41:47,430 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:47,431 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 76 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:47,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 355 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:47,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-17 14:41:47,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 180. [2025-03-17 14:41:47,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 158 states have (on average 1.4303797468354431) internal successors, (226), 168 states have internal predecessors, (226), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:41:47,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 239 transitions. [2025-03-17 14:41:47,444 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 239 transitions. Word has length 15 [2025-03-17 14:41:47,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:47,445 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 239 transitions. [2025-03-17 14:41:47,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:41:47,445 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 239 transitions. [2025-03-17 14:41:47,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 14:41:47,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:47,446 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:47,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:41:47,447 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:47,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:47,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1425896905, now seen corresponding path program 1 times [2025-03-17 14:41:47,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:47,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453223099] [2025-03-17 14:41:47,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:47,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:47,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:41:47,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:41:47,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:47,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:47,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:41:47,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:47,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453223099] [2025-03-17 14:41:47,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453223099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:47,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:47,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:41:47,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730588703] [2025-03-17 14:41:47,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:47,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:41:47,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:47,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:41:47,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:41:47,488 INFO L87 Difference]: Start difference. First operand 180 states and 239 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:41:47,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:47,565 INFO L93 Difference]: Finished difference Result 197 states and 258 transitions. [2025-03-17 14:41:47,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:41:47,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-17 14:41:47,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:47,567 INFO L225 Difference]: With dead ends: 197 [2025-03-17 14:41:47,567 INFO L226 Difference]: Without dead ends: 195 [2025-03-17 14:41:47,567 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:47,567 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 70 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:47,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 357 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:47,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-17 14:41:47,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 173. [2025-03-17 14:41:47,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 151 states have (on average 1.423841059602649) internal successors, (215), 161 states have internal predecessors, (215), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:41:47,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 228 transitions. [2025-03-17 14:41:47,574 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 228 transitions. Word has length 15 [2025-03-17 14:41:47,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:47,575 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 228 transitions. [2025-03-17 14:41:47,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:41:47,575 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 228 transitions. [2025-03-17 14:41:47,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 14:41:47,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:47,577 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:47,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:41:47,577 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:47,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:47,577 INFO L85 PathProgramCache]: Analyzing trace with hash -97742500, now seen corresponding path program 1 times [2025-03-17 14:41:47,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:47,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808469654] [2025-03-17 14:41:47,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:47,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:47,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:41:47,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:41:47,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:47,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:47,637 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:47,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:47,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808469654] [2025-03-17 14:41:47,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808469654] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:47,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337580952] [2025-03-17 14:41:47,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:47,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:47,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:47,639 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:47,641 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:47,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:41:47,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:41:47,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:47,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:47,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:41:47,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:47,696 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:47,696 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:41:47,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337580952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:47,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:41:47,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-17 14:41:47,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805494628] [2025-03-17 14:41:47,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:47,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:41:47,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:47,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:41:47,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:41:47,697 INFO L87 Difference]: Start difference. First operand 173 states and 228 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:47,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:47,740 INFO L93 Difference]: Finished difference Result 189 states and 252 transitions. [2025-03-17 14:41:47,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:41:47,740 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:47,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:47,741 INFO L225 Difference]: With dead ends: 189 [2025-03-17 14:41:47,741 INFO L226 Difference]: Without dead ends: 188 [2025-03-17 14:41:47,741 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:47,742 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 8 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:47,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 203 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:47,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-17 14:41:47,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2025-03-17 14:41:47,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 146 states have (on average 1.417808219178082) internal successors, (207), 156 states have internal predecessors, (207), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:41:47,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 220 transitions. [2025-03-17 14:41:47,752 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 220 transitions. Word has length 14 [2025-03-17 14:41:47,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:47,752 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 220 transitions. [2025-03-17 14:41:47,753 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:47,753 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 220 transitions. [2025-03-17 14:41:47,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 14:41:47,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:47,753 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:47,760 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:47,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:47,958 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:47,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:47,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1282127443, now seen corresponding path program 1 times [2025-03-17 14:41:47,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:47,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984402318] [2025-03-17 14:41:47,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:47,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:47,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:41:47,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:41:47,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:47,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:47,995 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:47,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:47,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984402318] [2025-03-17 14:41:47,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984402318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:47,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:47,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:41:47,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621199551] [2025-03-17 14:41:47,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:47,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:41:47,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:47,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:41:47,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:41:47,997 INFO L87 Difference]: Start difference. First operand 168 states and 220 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:48,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:48,081 INFO L93 Difference]: Finished difference Result 185 states and 242 transitions. [2025-03-17 14:41:48,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:41:48,081 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:48,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:48,082 INFO L225 Difference]: With dead ends: 185 [2025-03-17 14:41:48,082 INFO L226 Difference]: Without dead ends: 183 [2025-03-17 14:41:48,082 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:48,083 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 74 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:48,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 348 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:48,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-17 14:41:48,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 158. [2025-03-17 14:41:48,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 138 states have (on average 1.4130434782608696) internal successors, (195), 146 states have internal predecessors, (195), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:41:48,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 208 transitions. [2025-03-17 14:41:48,091 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 208 transitions. Word has length 22 [2025-03-17 14:41:48,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:48,091 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 208 transitions. [2025-03-17 14:41:48,092 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:48,092 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 208 transitions. [2025-03-17 14:41:48,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 14:41:48,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:48,092 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:48,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:41:48,092 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:48,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:48,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1282087660, now seen corresponding path program 1 times [2025-03-17 14:41:48,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:48,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442727772] [2025-03-17 14:41:48,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:48,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:48,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:41:48,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:41:48,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:48,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:48,136 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:48,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:48,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442727772] [2025-03-17 14:41:48,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442727772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:48,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:48,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:41:48,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224050059] [2025-03-17 14:41:48,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:48,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:41:48,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:48,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:41:48,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:41:48,137 INFO L87 Difference]: Start difference. First operand 158 states and 208 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:48,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:48,218 INFO L93 Difference]: Finished difference Result 181 states and 238 transitions. [2025-03-17 14:41:48,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:41:48,218 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:48,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:48,220 INFO L225 Difference]: With dead ends: 181 [2025-03-17 14:41:48,220 INFO L226 Difference]: Without dead ends: 179 [2025-03-17 14:41:48,220 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:48,221 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 68 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:48,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 350 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:48,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-17 14:41:48,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 149. [2025-03-17 14:41:48,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 131 states have (on average 1.4045801526717556) internal successors, (184), 137 states have internal predecessors, (184), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:41:48,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 197 transitions. [2025-03-17 14:41:48,230 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 197 transitions. Word has length 22 [2025-03-17 14:41:48,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:48,230 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 197 transitions. [2025-03-17 14:41:48,231 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:48,231 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 197 transitions. [2025-03-17 14:41:48,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 14:41:48,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:48,231 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:48,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:41:48,232 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:48,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:48,232 INFO L85 PathProgramCache]: Analyzing trace with hash 442422006, now seen corresponding path program 1 times [2025-03-17 14:41:48,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:48,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739069316] [2025-03-17 14:41:48,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:48,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:48,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 14:41:48,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 14:41:48,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:48,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:48,386 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 14:41:48,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:48,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739069316] [2025-03-17 14:41:48,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739069316] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:48,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456086607] [2025-03-17 14:41:48,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:48,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:48,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:48,390 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:48,391 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:48,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 14:41:48,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 14:41:48,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:48,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:48,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:41:48,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:48,475 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 14:41:48,475 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:41:48,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456086607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:48,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:41:48,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2025-03-17 14:41:48,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640602999] [2025-03-17 14:41:48,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:48,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:41:48,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:48,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:41:48,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:41:48,476 INFO L87 Difference]: Start difference. First operand 149 states and 197 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:41:48,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:48,528 INFO L93 Difference]: Finished difference Result 149 states and 197 transitions. [2025-03-17 14:41:48,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:41:48,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2025-03-17 14:41:48,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:48,530 INFO L225 Difference]: With dead ends: 149 [2025-03-17 14:41:48,530 INFO L226 Difference]: Without dead ends: 148 [2025-03-17 14:41:48,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:41:48,530 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 1 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:48,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 360 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:48,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-17 14:41:48,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-03-17 14:41:48,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 131 states have (on average 1.3969465648854962) internal successors, (183), 136 states have internal predecessors, (183), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:41:48,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 196 transitions. [2025-03-17 14:41:48,537 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 196 transitions. Word has length 40 [2025-03-17 14:41:48,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:48,537 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 196 transitions. [2025-03-17 14:41:48,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:41:48,537 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 196 transitions. [2025-03-17 14:41:48,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 14:41:48,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:48,539 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:48,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 14:41:48,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:48,743 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:48,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:48,743 INFO L85 PathProgramCache]: Analyzing trace with hash 830180376, now seen corresponding path program 1 times [2025-03-17 14:41:48,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:48,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006789137] [2025-03-17 14:41:48,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:48,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:48,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 14:41:48,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 14:41:48,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:48,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:48,900 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 14:41:48,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:48,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006789137] [2025-03-17 14:41:48,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006789137] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:48,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062770796] [2025-03-17 14:41:48,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:48,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:48,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:48,902 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:48,904 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:48,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 14:41:48,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 14:41:48,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:48,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:48,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 14:41:48,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:48,970 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 14:41:48,970 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:41:49,091 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 14:41:49,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062770796] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:41:49,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:41:49,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-03-17 14:41:49,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127450239] [2025-03-17 14:41:49,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:41:49,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:41:49,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:49,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:41:49,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:41:49,095 INFO L87 Difference]: Start difference. First operand 148 states and 196 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 12 states have internal predecessors, (38), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-17 14:41:49,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:49,230 INFO L93 Difference]: Finished difference Result 222 states and 288 transitions. [2025-03-17 14:41:49,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:41:49,231 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 12 states have internal predecessors, (38), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 41 [2025-03-17 14:41:49,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:49,231 INFO L225 Difference]: With dead ends: 222 [2025-03-17 14:41:49,231 INFO L226 Difference]: Without dead ends: 170 [2025-03-17 14:41:49,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-03-17 14:41:49,232 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 10 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:49,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1124 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:49,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-17 14:41:49,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 161. [2025-03-17 14:41:49,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 140 states have (on average 1.3785714285714286) internal successors, (193), 146 states have internal predecessors, (193), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-17 14:41:49,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 211 transitions. [2025-03-17 14:41:49,239 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 211 transitions. Word has length 41 [2025-03-17 14:41:49,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:49,240 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 211 transitions. [2025-03-17 14:41:49,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 12 states have internal predecessors, (38), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-17 14:41:49,240 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 211 transitions. [2025-03-17 14:41:49,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 14:41:49,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:49,240 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:49,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 14:41:49,441 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,SelfDestructingSolverStorable12 [2025-03-17 14:41:49,441 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:49,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:49,441 INFO L85 PathProgramCache]: Analyzing trace with hash 2108764503, now seen corresponding path program 1 times [2025-03-17 14:41:49,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:49,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250733894] [2025-03-17 14:41:49,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:49,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:49,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 14:41:49,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 14:41:49,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:49,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:49,583 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 14:41:49,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:49,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250733894] [2025-03-17 14:41:49,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250733894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:49,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:49,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 14:41:49,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115375753] [2025-03-17 14:41:49,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:49,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:41:49,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:49,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:41:49,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:41:49,586 INFO L87 Difference]: Start difference. First operand 161 states and 211 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 14:41:49,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:49,688 INFO L93 Difference]: Finished difference Result 270 states and 346 transitions. [2025-03-17 14:41:49,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:41:49,688 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 49 [2025-03-17 14:41:49,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:49,689 INFO L225 Difference]: With dead ends: 270 [2025-03-17 14:41:49,689 INFO L226 Difference]: Without dead ends: 212 [2025-03-17 14:41:49,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:41:49,690 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 107 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:49,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 777 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:49,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-17 14:41:49,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 204. [2025-03-17 14:41:49,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 177 states have (on average 1.3559322033898304) internal successors, (240), 183 states have internal predecessors, (240), 14 states have call successors, (14), 7 states have call predecessors, (14), 8 states have return successors, (15), 13 states have call predecessors, (15), 12 states have call successors, (15) [2025-03-17 14:41:49,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 269 transitions. [2025-03-17 14:41:49,702 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 269 transitions. Word has length 49 [2025-03-17 14:41:49,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:49,702 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 269 transitions. [2025-03-17 14:41:49,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 14:41:49,703 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 269 transitions. [2025-03-17 14:41:49,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 14:41:49,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:49,703 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:49,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:41:49,704 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:49,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:49,704 INFO L85 PathProgramCache]: Analyzing trace with hash -463749024, now seen corresponding path program 1 times [2025-03-17 14:41:49,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:49,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014331230] [2025-03-17 14:41:49,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:49,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:49,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 14:41:49,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 14:41:49,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:49,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:49,807 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 14:41:49,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:49,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014331230] [2025-03-17 14:41:49,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014331230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:49,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:49,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 14:41:49,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451586454] [2025-03-17 14:41:49,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:49,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:41:49,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:49,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:41:49,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:41:49,810 INFO L87 Difference]: Start difference. First operand 204 states and 269 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:41:49,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:49,883 INFO L93 Difference]: Finished difference Result 307 states and 397 transitions. [2025-03-17 14:41:49,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:41:49,883 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 44 [2025-03-17 14:41:49,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:49,884 INFO L225 Difference]: With dead ends: 307 [2025-03-17 14:41:49,884 INFO L226 Difference]: Without dead ends: 219 [2025-03-17 14:41:49,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:41:49,886 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 7 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:49,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 661 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:49,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-17 14:41:49,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 208. [2025-03-17 14:41:49,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 181 states have (on average 1.3480662983425415) internal successors, (244), 187 states have internal predecessors, (244), 13 states have call successors, (13), 8 states have call predecessors, (13), 9 states have return successors, (14), 12 states have call predecessors, (14), 11 states have call successors, (14) [2025-03-17 14:41:49,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 271 transitions. [2025-03-17 14:41:49,896 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 271 transitions. Word has length 44 [2025-03-17 14:41:49,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:49,896 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 271 transitions. [2025-03-17 14:41:49,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:41:49,896 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 271 transitions. [2025-03-17 14:41:49,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 14:41:49,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:49,897 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:49,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 14:41:49,898 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:49,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:49,898 INFO L85 PathProgramCache]: Analyzing trace with hash -943913403, now seen corresponding path program 1 times [2025-03-17 14:41:49,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:49,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146275241] [2025-03-17 14:41:49,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:49,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:49,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 14:41:49,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 14:41:49,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:49,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:49,996 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 14:41:49,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:49,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146275241] [2025-03-17 14:41:49,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146275241] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:49,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845481337] [2025-03-17 14:41:49,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:49,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:49,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:49,999 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:50,000 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:50,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 14:41:50,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 14:41:50,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:50,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:50,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 14:41:50,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:50,112 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 14:41:50,112 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:41:50,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845481337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:50,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:41:50,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-03-17 14:41:50,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107780177] [2025-03-17 14:41:50,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:50,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:41:50,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:50,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:41:50,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:41:50,114 INFO L87 Difference]: Start difference. First operand 208 states and 271 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 14:41:50,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:50,207 INFO L93 Difference]: Finished difference Result 320 states and 409 transitions. [2025-03-17 14:41:50,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:41:50,208 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52 [2025-03-17 14:41:50,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:50,209 INFO L225 Difference]: With dead ends: 320 [2025-03-17 14:41:50,209 INFO L226 Difference]: Without dead ends: 262 [2025-03-17 14:41:50,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-03-17 14:41:50,210 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 105 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:50,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 948 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:50,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-17 14:41:50,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 215. [2025-03-17 14:41:50,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 185 states have (on average 1.3405405405405406) internal successors, (248), 192 states have internal predecessors, (248), 15 states have call successors, (15), 8 states have call predecessors, (15), 10 states have return successors, (18), 14 states have call predecessors, (18), 13 states have call successors, (18) [2025-03-17 14:41:50,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 281 transitions. [2025-03-17 14:41:50,233 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 281 transitions. Word has length 52 [2025-03-17 14:41:50,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:50,234 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 281 transitions. [2025-03-17 14:41:50,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 14:41:50,234 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 281 transitions. [2025-03-17 14:41:50,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 14:41:50,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:50,234 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:50,240 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:50,435 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,SelfDestructingSolverStorable15 [2025-03-17 14:41:50,435 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:50,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:50,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1552823742, now seen corresponding path program 2 times [2025-03-17 14:41:50,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:50,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50463033] [2025-03-17 14:41:50,436 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:41:50,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:50,440 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-03-17 14:41:50,454 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 47 statements. [2025-03-17 14:41:50,454 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:41:50,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:50,612 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 14:41:50,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:50,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50463033] [2025-03-17 14:41:50,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50463033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:50,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:50,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 14:41:50,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337838747] [2025-03-17 14:41:50,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:50,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:41:50,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:50,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:41:50,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:41:50,614 INFO L87 Difference]: Start difference. First operand 215 states and 281 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:41:50,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:50,835 INFO L93 Difference]: Finished difference Result 401 states and 515 transitions. [2025-03-17 14:41:50,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:41:50,835 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2025-03-17 14:41:50,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:50,836 INFO L225 Difference]: With dead ends: 401 [2025-03-17 14:41:50,836 INFO L226 Difference]: Without dead ends: 319 [2025-03-17 14:41:50,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:41:50,837 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 152 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:50,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1415 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:41:50,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-03-17 14:41:50,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 266. [2025-03-17 14:41:50,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 232 states have (on average 1.3448275862068966) internal successors, (312), 239 states have internal predecessors, (312), 17 states have call successors, (17), 10 states have call predecessors, (17), 12 states have return successors, (20), 16 states have call predecessors, (20), 15 states have call successors, (20) [2025-03-17 14:41:50,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 349 transitions. [2025-03-17 14:41:50,855 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 349 transitions. Word has length 47 [2025-03-17 14:41:50,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:50,855 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 349 transitions. [2025-03-17 14:41:50,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:41:50,855 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 349 transitions. [2025-03-17 14:41:50,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 14:41:50,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:50,856 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:50,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 14:41:50,856 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:50,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:50,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1388833857, now seen corresponding path program 1 times [2025-03-17 14:41:50,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:50,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526231117] [2025-03-17 14:41:50,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:50,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:50,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 14:41:50,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 14:41:50,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:50,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:51,181 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 14:41:51,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:51,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526231117] [2025-03-17 14:41:51,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526231117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:51,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:51,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 14:41:51,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830858231] [2025-03-17 14:41:51,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:51,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:41:51,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:51,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:41:51,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:41:51,183 INFO L87 Difference]: Start difference. First operand 266 states and 349 transitions. Second operand has 10 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:41:51,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:51,414 INFO L93 Difference]: Finished difference Result 296 states and 383 transitions. [2025-03-17 14:41:51,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:41:51,414 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2025-03-17 14:41:51,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:51,415 INFO L225 Difference]: With dead ends: 296 [2025-03-17 14:41:51,415 INFO L226 Difference]: Without dead ends: 292 [2025-03-17 14:41:51,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:41:51,416 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 92 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:51,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1060 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:41:51,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-03-17 14:41:51,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 275. [2025-03-17 14:41:51,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 240 states have (on average 1.3166666666666667) internal successors, (316), 245 states have internal predecessors, (316), 20 states have call successors, (20), 10 states have call predecessors, (20), 12 states have return successors, (23), 19 states have call predecessors, (23), 18 states have call successors, (23) [2025-03-17 14:41:51,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 359 transitions. [2025-03-17 14:41:51,430 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 359 transitions. Word has length 47 [2025-03-17 14:41:51,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:51,430 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 359 transitions. [2025-03-17 14:41:51,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:41:51,430 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 359 transitions. [2025-03-17 14:41:51,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 14:41:51,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:51,431 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:51,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 14:41:51,431 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:51,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:51,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1159575187, now seen corresponding path program 1 times [2025-03-17 14:41:51,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:51,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579739381] [2025-03-17 14:41:51,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:51,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:51,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 14:41:51,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 14:41:51,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:51,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:51,493 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 14:41:51,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:51,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579739381] [2025-03-17 14:41:51,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579739381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:51,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:51,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:41:51,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295407225] [2025-03-17 14:41:51,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:51,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:51,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:51,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:51,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:51,494 INFO L87 Difference]: Start difference. First operand 275 states and 359 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:41:51,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:51,527 INFO L93 Difference]: Finished difference Result 281 states and 365 transitions. [2025-03-17 14:41:51,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:51,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 55 [2025-03-17 14:41:51,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:51,529 INFO L225 Difference]: With dead ends: 281 [2025-03-17 14:41:51,529 INFO L226 Difference]: Without dead ends: 276 [2025-03-17 14:41:51,529 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:51,530 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 22 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:51,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 147 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:51,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-17 14:41:51,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 270. [2025-03-17 14:41:51,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 238 states have (on average 1.281512605042017) internal successors, (305), 241 states have internal predecessors, (305), 19 states have call successors, (19), 10 states have call predecessors, (19), 12 states have return successors, (22), 18 states have call predecessors, (22), 17 states have call successors, (22) [2025-03-17 14:41:51,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 346 transitions. [2025-03-17 14:41:51,542 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 346 transitions. Word has length 55 [2025-03-17 14:41:51,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:51,542 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 346 transitions. [2025-03-17 14:41:51,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:41:51,542 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 346 transitions. [2025-03-17 14:41:51,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-17 14:41:51,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:51,543 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1] [2025-03-17 14:41:51,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 14:41:51,543 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:51,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:51,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1252845952, now seen corresponding path program 1 times [2025-03-17 14:41:51,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:51,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121476970] [2025-03-17 14:41:51,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:51,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:51,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 14:41:51,563 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,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:51,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:51,653 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 14:41:51,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:51,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121476970] [2025-03-17 14:41:51,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121476970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:51,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:51,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 14:41:51,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556907323] [2025-03-17 14:41:51,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:51,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:41:51,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:51,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:41:51,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:41:51,655 INFO L87 Difference]: Start difference. First operand 270 states and 346 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 14:41:51,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:51,766 INFO L93 Difference]: Finished difference Result 483 states and 618 transitions. [2025-03-17 14:41:51,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:41:51,767 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 64 [2025-03-17 14:41:51,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:51,768 INFO L225 Difference]: With dead ends: 483 [2025-03-17 14:41:51,769 INFO L226 Difference]: Without dead ends: 376 [2025-03-17 14:41:51,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:41:51,769 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 33 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:51,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 629 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:51,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-17 14:41:51,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 309. [2025-03-17 14:41:51,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 274 states have (on average 1.2664233576642336) internal successors, (347), 277 states have internal predecessors, (347), 22 states have call successors, (22), 10 states have call predecessors, (22), 12 states have return successors, (25), 21 states have call predecessors, (25), 20 states have call successors, (25) [2025-03-17 14:41:51,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 394 transitions. [2025-03-17 14:41:51,782 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 394 transitions. Word has length 64 [2025-03-17 14:41:51,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:51,782 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 394 transitions. [2025-03-17 14:41:51,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 14:41:51,782 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 394 transitions. [2025-03-17 14:41:51,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 14:41:51,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:51,783 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1] [2025-03-17 14:41:51,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 14:41:51,783 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:51,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:51,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1949052430, now seen corresponding path program 1 times [2025-03-17 14:41:51,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:51,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621317053] [2025-03-17 14:41:51,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:51,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:51,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 14:41:51,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 14:41:51,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:51,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:52,007 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-17 14:41:52,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:52,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621317053] [2025-03-17 14:41:52,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621317053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:52,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:52,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 14:41:52,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242880467] [2025-03-17 14:41:52,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:52,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:41:52,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:52,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:41:52,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:41:52,008 INFO L87 Difference]: Start difference. First operand 309 states and 394 transitions. Second operand has 11 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 14:41:52,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:52,235 INFO L93 Difference]: Finished difference Result 332 states and 421 transitions. [2025-03-17 14:41:52,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 14:41:52,236 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 65 [2025-03-17 14:41:52,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:52,236 INFO L225 Difference]: With dead ends: 332 [2025-03-17 14:41:52,236 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 14:41:52,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-03-17 14:41:52,237 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 92 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:52,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1016 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:41:52,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 14:41:52,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 14:41:52,238 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:52,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 14:41:52,238 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2025-03-17 14:41:52,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:52,238 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 14:41:52,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 14:41:52,239 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 14:41:52,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 14:41:52,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2025-03-17 14:41:52,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-03-17 14:41:52,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-03-17 14:41:52,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2025-03-17 14:41:52,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-03-17 14:41:52,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-03-17 14:41:52,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-03-17 14:41:52,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-03-17 14:41:52,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-03-17 14:41:52,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-03-17 14:41:52,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-03-17 14:41:52,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-03-17 14:41:52,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-03-17 14:41:52,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-03-17 14:41:52,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-03-17 14:41:52,242 INFO L782 garLoopResultBuilder]: Registering result SAFE for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-03-17 14:41:52,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 14:41:52,244 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:52,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 14:41:52,903 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:41:52,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:41:52 BoogieIcfgContainer [2025-03-17 14:41:52,913 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:41:52,914 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:41:52,914 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:41:52,914 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:41:52,915 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:41:45" (3/4) ... [2025-03-17 14:41:52,917 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 14:41:52,920 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure base2flt [2025-03-17 14:41:52,921 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure addflt [2025-03-17 14:41:52,921 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-17 14:41:52,926 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-03-17 14:41:52,927 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-17 14:41:52,927 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 14:41:52,927 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 14:41:52,946 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= (2147483649 + e)) || (\old(e) != 0))) && (e <= 127)) [2025-03-17 14:41:52,946 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) && (e <= 127)) [2025-03-17 14:41:52,961 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) && (e <= 127)) [2025-03-17 14:41:52,961 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= (2147483649 + e)) || (\old(e) != 0))) && (e <= 127)) [2025-03-17 14:41:52,988 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:41:52,989 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:41:52,989 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:41:52,990 INFO L158 Benchmark]: Toolchain (without parser) took 7992.36ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 113.9MB in the beginning and 149.8MB in the end (delta: -35.9MB). Peak memory consumption was 69.1MB. Max. memory is 16.1GB. [2025-03-17 14:41:52,990 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory was 123.9MB in the beginning and 123.6MB in the end (delta: 293.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:41:52,990 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.83ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 100.4MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:41:52,990 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.19ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 99.1MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:41:52,990 INFO L158 Benchmark]: Boogie Preprocessor took 34.41ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 97.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:41:52,990 INFO L158 Benchmark]: IcfgBuilder took 478.23ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 73.5MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 14:41:52,990 INFO L158 Benchmark]: TraceAbstraction took 7160.22ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 73.0MB in the beginning and 157.8MB in the end (delta: -84.8MB). Peak memory consumption was 54.0MB. Max. memory is 16.1GB. [2025-03-17 14:41:52,991 INFO L158 Benchmark]: Witness Printer took 75.17ms. Allocated memory is still 251.7MB. Free memory was 157.8MB in the beginning and 149.8MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:41:52,993 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory was 123.9MB in the beginning and 123.6MB in the end (delta: 293.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.83ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 100.4MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.19ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 99.1MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.41ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 97.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 478.23ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 73.5MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7160.22ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 73.0MB in the beginning and 157.8MB in the end (delta: -84.8MB). Peak memory consumption was 54.0MB. Max. memory is 16.1GB. * Witness Printer took 75.17ms. Allocated memory is still 251.7MB. Free memory was 157.8MB in the beginning and 149.8MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 142]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 142]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 134]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 134]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 116]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 116]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 113]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 113]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 110]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 110]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 103 locations, 145 edges, 16 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 21, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1073 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1046 mSDsluCounter, 11123 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8852 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2688 IncrementalHoareTripleChecker+Invalid, 2756 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 2271 mSDtfsCounter, 2688 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 368 GetRequests, 228 SyntacticMatches, 2 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred in iteration=20, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 387 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 830 NumberOfCodeBlocks, 813 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 843 ConstructedInterpolants, 0 QuantifiedInterpolants, 1603 SizeOfPredicates, 3 NumberOfNonLiveVariables, 596 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 28 InterpolantComputations, 20 PerfectInterpolantSequences, 262/284 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 38]: Location Invariant Derived location invariant: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= (2147483649 + e)) || (\old(e) != 0))) && (e <= 127)) - InvariantResult [Line: 58]: Location Invariant Derived location invariant: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) && (e <= 127)) RESULT: Ultimate proved your program to be correct! [2025-03-17 14:41:53,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE