./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_5a.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 f6c91769726962c1478685c30d57ac239987d5f8a5f6832d1d60b9c031f35855 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:39:04,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:39:04,574 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 01:39:04,578 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:39:04,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:39:04,599 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:39:04,600 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:39:04,600 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:39:04,600 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:39:04,600 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:39:04,601 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:39:04,601 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:39:04,601 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:39:04,601 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:39:04,601 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:39:04,601 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:39:04,601 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:39:04,601 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:39:04,601 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:39:04,602 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:39:04,602 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:39:04,602 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:39:04,602 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:39:04,602 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:39:04,602 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:39:04,602 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:39:04,602 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:39:04,602 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:39:04,602 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:39:04,602 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:39:04,602 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:39:04,602 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:39:04,602 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:39:04,602 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:39:04,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:39:04,602 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:39:04,602 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:39:04,603 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:39:04,603 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:39:04,603 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:39:04,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:39:04,603 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:39:04,603 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:39:04,603 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:39:04,603 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:39:04,603 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 -> f6c91769726962c1478685c30d57ac239987d5f8a5f6832d1d60b9c031f35855 [2025-03-09 01:39:04,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:39:04,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:39:04,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:39:04,810 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:39:04,810 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:39:04,811 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c [2025-03-09 01:39:05,927 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32a43f32a/46ed8e5ba516433887775161be9f22f8/FLAGf3997bf15 [2025-03-09 01:39:06,141 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:39:06,142 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c [2025-03-09 01:39:06,156 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32a43f32a/46ed8e5ba516433887775161be9f22f8/FLAGf3997bf15 [2025-03-09 01:39:06,504 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32a43f32a/46ed8e5ba516433887775161be9f22f8 [2025-03-09 01:39:06,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:39:06,507 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:39:06,508 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:39:06,508 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:39:06,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:39:06,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:39:06" (1/1) ... [2025-03-09 01:39:06,512 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aee2867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:39:06, skipping insertion in model container [2025-03-09 01:39:06,512 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:39:06" (1/1) ... [2025-03-09 01:39:06,531 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:39:06,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:39:06,682 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:39:06,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:39:06,742 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:39:06,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:39:06 WrapperNode [2025-03-09 01:39:06,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:39:06,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:39:06,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:39:06,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:39:06,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:39:06" (1/1) ... [2025-03-09 01:39:06,759 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:39:06" (1/1) ... [2025-03-09 01:39:06,779 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 164 [2025-03-09 01:39:06,782 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:39:06,783 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:39:06,783 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:39:06,783 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:39:06,789 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:39:06" (1/1) ... [2025-03-09 01:39:06,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:39:06" (1/1) ... [2025-03-09 01:39:06,791 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:39:06" (1/1) ... [2025-03-09 01:39:06,811 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 01:39:06,813 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:39:06" (1/1) ... [2025-03-09 01:39:06,814 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:39:06" (1/1) ... [2025-03-09 01:39:06,817 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:39:06" (1/1) ... [2025-03-09 01:39:06,818 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:39:06" (1/1) ... [2025-03-09 01:39:06,818 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:39:06" (1/1) ... [2025-03-09 01:39:06,819 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:39:06" (1/1) ... [2025-03-09 01:39:06,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:39:06,825 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:39:06,825 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:39:06,825 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:39:06,826 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:39:06" (1/1) ... [2025-03-09 01:39:06,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:39:06,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:39:06,856 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:39:06,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:39:06,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:39:06,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:39:06,878 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-03-09 01:39:06,879 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-03-09 01:39:06,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:39:06,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:39:06,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 01:39:06,879 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 01:39:06,930 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:39:06,932 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:39:07,232 INFO L? ?]: Removed 76 outVars from TransFormulas that were not future-live. [2025-03-09 01:39:07,233 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:39:07,253 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:39:07,253 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:39:07,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:39:07 BoogieIcfgContainer [2025-03-09 01:39:07,254 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:39:07,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:39:07,256 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:39:07,259 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:39:07,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:39:06" (1/3) ... [2025-03-09 01:39:07,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36858c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:39:07, skipping insertion in model container [2025-03-09 01:39:07,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:39:06" (2/3) ... [2025-03-09 01:39:07,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36858c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:39:07, skipping insertion in model container [2025-03-09 01:39:07,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:39:07" (3/3) ... [2025-03-09 01:39:07,262 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_5a.c.cil.c [2025-03-09 01:39:07,274 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:39:07,276 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_5a.c.cil.c that has 3 procedures, 105 locations, 1 initial locations, 2 loop locations, and 16 error locations. [2025-03-09 01:39:07,317 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:39:07,327 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;@6de0ac22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:39:07,328 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-09 01:39:07,332 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 81 states have (on average 1.6049382716049383) internal successors, (130), 98 states have internal predecessors, (130), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 01:39:07,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 01:39:07,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:07,337 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:07,338 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:39:07,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:07,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1147488222, now seen corresponding path program 1 times [2025-03-09 01:39:07,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:07,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293097463] [2025-03-09 01:39:07,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:07,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:07,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:39:07,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:39:07,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:07,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:07,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:39:07,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:07,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293097463] [2025-03-09 01:39:07,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293097463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:07,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:39:07,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:39:07,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512305123] [2025-03-09 01:39:07,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:07,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:39:07,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:07,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:39:07,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:39:07,556 INFO L87 Difference]: Start difference. First operand has 105 states, 81 states have (on average 1.6049382716049383) internal successors, (130), 98 states have internal predecessors, (130), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:39:07,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:07,684 INFO L93 Difference]: Finished difference Result 251 states and 356 transitions. [2025-03-09 01:39:07,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:39:07,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 01:39:07,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:07,694 INFO L225 Difference]: With dead ends: 251 [2025-03-09 01:39:07,694 INFO L226 Difference]: Without dead ends: 123 [2025-03-09 01:39:07,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:39:07,701 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 80 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:07,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 328 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:39:07,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-09 01:39:07,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2025-03-09 01:39:07,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 95 states have (on average 1.4842105263157894) internal successors, (141), 106 states have internal predecessors, (141), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 01:39:07,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 149 transitions. [2025-03-09 01:39:07,743 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 149 transitions. Word has length 8 [2025-03-09 01:39:07,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:07,744 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 149 transitions. [2025-03-09 01:39:07,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:39:07,744 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 149 transitions. [2025-03-09 01:39:07,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 01:39:07,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:07,745 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:07,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:39:07,746 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:39:07,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:07,747 INFO L85 PathProgramCache]: Analyzing trace with hash -2124804516, now seen corresponding path program 1 times [2025-03-09 01:39:07,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:07,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567226093] [2025-03-09 01:39:07,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:07,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:07,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:39:07,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:39:07,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:07,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:07,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:39:07,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:07,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567226093] [2025-03-09 01:39:07,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567226093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:07,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:39:07,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:39:07,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525095553] [2025-03-09 01:39:07,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:07,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:39:07,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:07,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:39:07,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:39:07,826 INFO L87 Difference]: Start difference. First operand 113 states and 149 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:39:07,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:07,867 INFO L93 Difference]: Finished difference Result 113 states and 149 transitions. [2025-03-09 01:39:07,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:39:07,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-09 01:39:07,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:07,868 INFO L225 Difference]: With dead ends: 113 [2025-03-09 01:39:07,868 INFO L226 Difference]: Without dead ends: 112 [2025-03-09 01:39:07,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:39:07,869 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 1 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:07,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 149 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:39:07,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-09 01:39:07,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-09 01:39:07,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.4631578947368422) internal successors, (139), 105 states have internal predecessors, (139), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 01:39:07,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 147 transitions. [2025-03-09 01:39:07,880 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 147 transitions. Word has length 12 [2025-03-09 01:39:07,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:07,880 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 147 transitions. [2025-03-09 01:39:07,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:39:07,880 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 147 transitions. [2025-03-09 01:39:07,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 01:39:07,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:07,880 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:07,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:39:07,880 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:39:07,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:07,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1444430564, now seen corresponding path program 1 times [2025-03-09 01:39:07,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:07,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860413322] [2025-03-09 01:39:07,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:07,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:07,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:39:07,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:39:07,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:07,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:07,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:39:07,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:07,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860413322] [2025-03-09 01:39:07,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860413322] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:39:07,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340639545] [2025-03-09 01:39:07,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:07,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:39:07,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:39:07,950 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:39:07,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:39:07,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:39:07,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:39:07,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:07,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:07,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:39:07,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:39:08,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:39:08,028 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:39:08,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340639545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:08,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:39:08,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-09 01:39:08,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912516484] [2025-03-09 01:39:08,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:08,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:39:08,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:08,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:39:08,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:39:08,029 INFO L87 Difference]: Start difference. First operand 112 states and 147 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:39:08,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:08,084 INFO L93 Difference]: Finished difference Result 124 states and 166 transitions. [2025-03-09 01:39:08,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:39:08,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-09 01:39:08,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:08,085 INFO L225 Difference]: With dead ends: 124 [2025-03-09 01:39:08,087 INFO L226 Difference]: Without dead ends: 123 [2025-03-09 01:39:08,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:39:08,088 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 13 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:08,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 145 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:39:08,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-09 01:39:08,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2025-03-09 01:39:08,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 96 states have (on average 1.4583333333333333) internal successors, (140), 106 states have internal predecessors, (140), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 01:39:08,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 148 transitions. [2025-03-09 01:39:08,100 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 148 transitions. Word has length 13 [2025-03-09 01:39:08,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:08,100 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 148 transitions. [2025-03-09 01:39:08,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:39:08,100 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 148 transitions. [2025-03-09 01:39:08,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 01:39:08,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:08,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:08,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:39:08,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:39:08,305 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:39:08,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:08,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1444415572, now seen corresponding path program 1 times [2025-03-09 01:39:08,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:08,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15569019] [2025-03-09 01:39:08,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:08,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:08,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:39:08,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:39:08,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:08,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:08,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:39:08,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:08,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15569019] [2025-03-09 01:39:08,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15569019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:08,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:39:08,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:39:08,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777968505] [2025-03-09 01:39:08,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:08,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:39:08,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:08,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:39:08,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:39:08,350 INFO L87 Difference]: Start difference. First operand 113 states and 148 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:39:08,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:08,396 INFO L93 Difference]: Finished difference Result 236 states and 316 transitions. [2025-03-09 01:39:08,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:39:08,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-09 01:39:08,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:08,397 INFO L225 Difference]: With dead ends: 236 [2025-03-09 01:39:08,397 INFO L226 Difference]: Without dead ends: 126 [2025-03-09 01:39:08,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:39:08,398 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 11 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:08,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 152 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:39:08,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-09 01:39:08,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 116. [2025-03-09 01:39:08,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.4444444444444444) internal successors, (143), 109 states have internal predecessors, (143), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 01:39:08,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 151 transitions. [2025-03-09 01:39:08,409 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 151 transitions. Word has length 13 [2025-03-09 01:39:08,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:08,409 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 151 transitions. [2025-03-09 01:39:08,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:39:08,409 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 151 transitions. [2025-03-09 01:39:08,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 01:39:08,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:08,410 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:08,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:39:08,410 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:39:08,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:08,410 INFO L85 PathProgramCache]: Analyzing trace with hash 936574913, now seen corresponding path program 1 times [2025-03-09 01:39:08,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:08,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434839176] [2025-03-09 01:39:08,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:08,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:08,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:39:08,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:39:08,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:08,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:08,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:39:08,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:08,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434839176] [2025-03-09 01:39:08,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434839176] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:39:08,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100245661] [2025-03-09 01:39:08,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:08,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:39:08,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:39:08,481 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:39:08,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:39:08,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:39:08,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:39:08,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:08,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:08,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:39:08,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:39:08,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:39:08,529 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:39:08,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100245661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:08,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:39:08,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-09 01:39:08,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103113511] [2025-03-09 01:39:08,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:08,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:39:08,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:08,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:39:08,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:39:08,531 INFO L87 Difference]: Start difference. First operand 116 states and 151 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:39:08,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:08,606 INFO L93 Difference]: Finished difference Result 147 states and 198 transitions. [2025-03-09 01:39:08,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:39:08,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-09 01:39:08,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:08,607 INFO L225 Difference]: With dead ends: 147 [2025-03-09 01:39:08,607 INFO L226 Difference]: Without dead ends: 145 [2025-03-09 01:39:08,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:39:08,608 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 24 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:08,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 219 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:39:08,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-09 01:39:08,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 123. [2025-03-09 01:39:08,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 106 states have (on average 1.4150943396226414) internal successors, (150), 116 states have internal predecessors, (150), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 01:39:08,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 158 transitions. [2025-03-09 01:39:08,621 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 158 transitions. Word has length 13 [2025-03-09 01:39:08,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:08,621 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 158 transitions. [2025-03-09 01:39:08,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:39:08,622 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 158 transitions. [2025-03-09 01:39:08,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-09 01:39:08,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:08,622 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:08,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:39:08,822 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-09 01:39:08,823 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:39:08,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:08,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1030948769, now seen corresponding path program 1 times [2025-03-09 01:39:08,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:08,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629024044] [2025-03-09 01:39:08,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:08,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:08,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:39:08,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:39:08,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:08,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:08,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:39:08,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:08,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629024044] [2025-03-09 01:39:08,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629024044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:08,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:39:08,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:39:08,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140878629] [2025-03-09 01:39:08,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:08,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:39:08,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:08,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:39:08,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:39:08,853 INFO L87 Difference]: Start difference. First operand 123 states and 158 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:39:08,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:08,881 INFO L93 Difference]: Finished difference Result 123 states and 158 transitions. [2025-03-09 01:39:08,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:39:08,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-09 01:39:08,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:08,881 INFO L225 Difference]: With dead ends: 123 [2025-03-09 01:39:08,882 INFO L226 Difference]: Without dead ends: 122 [2025-03-09 01:39:08,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:39:08,882 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:08,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:39:08,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-09 01:39:08,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2025-03-09 01:39:08,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 113 states have internal predecessors, (146), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 01:39:08,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 154 transitions. [2025-03-09 01:39:08,887 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 154 transitions. Word has length 14 [2025-03-09 01:39:08,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:08,888 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 154 transitions. [2025-03-09 01:39:08,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:39:08,888 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 154 transitions. [2025-03-09 01:39:08,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 01:39:08,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:08,888 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:08,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:39:08,888 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:39:08,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:08,889 INFO L85 PathProgramCache]: Analyzing trace with hash -804249617, now seen corresponding path program 1 times [2025-03-09 01:39:08,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:08,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302038138] [2025-03-09 01:39:08,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:08,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:08,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:39:08,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:39:08,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:08,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:08,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:39:08,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:08,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302038138] [2025-03-09 01:39:08,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302038138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:08,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:39:08,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:39:08,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642889706] [2025-03-09 01:39:08,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:08,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:39:08,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:08,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:39:08,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:39:08,947 INFO L87 Difference]: Start difference. First operand 120 states and 154 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:39:09,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:09,061 INFO L93 Difference]: Finished difference Result 138 states and 175 transitions. [2025-03-09 01:39:09,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:39:09,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-09 01:39:09,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:09,063 INFO L225 Difference]: With dead ends: 138 [2025-03-09 01:39:09,063 INFO L226 Difference]: Without dead ends: 137 [2025-03-09 01:39:09,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:39:09,064 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 92 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:09,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 279 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:39:09,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-09 01:39:09,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 125. [2025-03-09 01:39:09,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 109 states have (on average 1.3944954128440368) internal successors, (152), 118 states have internal predecessors, (152), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 01:39:09,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 160 transitions. [2025-03-09 01:39:09,074 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 160 transitions. Word has length 15 [2025-03-09 01:39:09,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:09,074 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 160 transitions. [2025-03-09 01:39:09,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:39:09,074 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 160 transitions. [2025-03-09 01:39:09,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 01:39:09,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:09,074 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:09,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:39:09,075 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:39:09,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:09,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1894422301, now seen corresponding path program 1 times [2025-03-09 01:39:09,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:09,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374287602] [2025-03-09 01:39:09,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:09,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:09,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:39:09,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:39:09,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:09,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:09,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:39:09,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:09,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374287602] [2025-03-09 01:39:09,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374287602] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:39:09,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859363603] [2025-03-09 01:39:09,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:09,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:39:09,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:39:09,133 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:39:09,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:39:09,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:39:09,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:39:09,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:09,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:09,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:39:09,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:39:09,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:39:09,193 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:39:09,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859363603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:09,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:39:09,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-09 01:39:09,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001515016] [2025-03-09 01:39:09,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:09,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:39:09,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:09,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:39:09,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:39:09,194 INFO L87 Difference]: Start difference. First operand 125 states and 160 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:39:09,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:09,235 INFO L93 Difference]: Finished difference Result 137 states and 177 transitions. [2025-03-09 01:39:09,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:39:09,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-09 01:39:09,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:09,236 INFO L225 Difference]: With dead ends: 137 [2025-03-09 01:39:09,236 INFO L226 Difference]: Without dead ends: 136 [2025-03-09 01:39:09,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:39:09,237 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 8 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:09,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 159 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:39:09,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-09 01:39:09,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 125. [2025-03-09 01:39:09,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 109 states have (on average 1.385321100917431) internal successors, (151), 118 states have internal predecessors, (151), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 01:39:09,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 159 transitions. [2025-03-09 01:39:09,241 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 159 transitions. Word has length 15 [2025-03-09 01:39:09,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:09,242 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 159 transitions. [2025-03-09 01:39:09,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:39:09,242 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 159 transitions. [2025-03-09 01:39:09,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 01:39:09,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:09,242 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:09,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:39:09,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:39:09,443 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:39:09,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:09,443 INFO L85 PathProgramCache]: Analyzing trace with hash 841606612, now seen corresponding path program 1 times [2025-03-09 01:39:09,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:09,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079279598] [2025-03-09 01:39:09,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:09,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:09,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:39:09,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:39:09,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:09,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:09,483 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:39:09,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:09,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079279598] [2025-03-09 01:39:09,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079279598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:09,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:39:09,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:39:09,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548859766] [2025-03-09 01:39:09,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:09,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:39:09,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:09,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:39:09,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:39:09,485 INFO L87 Difference]: Start difference. First operand 125 states and 159 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 01:39:09,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:09,552 INFO L93 Difference]: Finished difference Result 187 states and 241 transitions. [2025-03-09 01:39:09,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:39:09,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-03-09 01:39:09,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:09,555 INFO L225 Difference]: With dead ends: 187 [2025-03-09 01:39:09,555 INFO L226 Difference]: Without dead ends: 185 [2025-03-09 01:39:09,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:39:09,556 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 112 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:09,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 227 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:39:09,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-09 01:39:09,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 158. [2025-03-09 01:39:09,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 141 states have (on average 1.4042553191489362) internal successors, (198), 150 states have internal predecessors, (198), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 01:39:09,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 206 transitions. [2025-03-09 01:39:09,567 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 206 transitions. Word has length 23 [2025-03-09 01:39:09,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:09,567 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 206 transitions. [2025-03-09 01:39:09,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 01:39:09,567 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 206 transitions. [2025-03-09 01:39:09,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 01:39:09,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:09,567 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:09,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:39:09,568 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:39:09,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:09,568 INFO L85 PathProgramCache]: Analyzing trace with hash 841646395, now seen corresponding path program 1 times [2025-03-09 01:39:09,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:09,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124017111] [2025-03-09 01:39:09,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:09,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:09,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:39:09,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:39:09,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:09,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:09,618 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:39:09,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:09,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124017111] [2025-03-09 01:39:09,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124017111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:09,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:39:09,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:39:09,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829582772] [2025-03-09 01:39:09,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:09,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:39:09,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:09,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:39:09,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:39:09,620 INFO L87 Difference]: Start difference. First operand 158 states and 206 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 01:39:09,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:09,690 INFO L93 Difference]: Finished difference Result 183 states and 237 transitions. [2025-03-09 01:39:09,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:39:09,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-03-09 01:39:09,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:09,693 INFO L225 Difference]: With dead ends: 183 [2025-03-09 01:39:09,693 INFO L226 Difference]: Without dead ends: 181 [2025-03-09 01:39:09,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:39:09,693 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 106 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:09,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 231 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:39:09,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-09 01:39:09,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 151. [2025-03-09 01:39:09,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 134 states have (on average 1.3955223880597014) internal successors, (187), 143 states have internal predecessors, (187), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 01:39:09,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 195 transitions. [2025-03-09 01:39:09,699 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 195 transitions. Word has length 23 [2025-03-09 01:39:09,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:09,699 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 195 transitions. [2025-03-09 01:39:09,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 01:39:09,699 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 195 transitions. [2025-03-09 01:39:09,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 01:39:09,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:09,700 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:09,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:39:09,700 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:39:09,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:09,700 INFO L85 PathProgramCache]: Analyzing trace with hash -720412716, now seen corresponding path program 1 times [2025-03-09 01:39:09,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:09,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684476548] [2025-03-09 01:39:09,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:09,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:09,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 01:39:09,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:39:09,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:09,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:09,756 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:39:09,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:09,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684476548] [2025-03-09 01:39:09,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684476548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:09,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:39:09,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:39:09,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312639851] [2025-03-09 01:39:09,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:09,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:39:09,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:09,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:39:09,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:39:09,758 INFO L87 Difference]: Start difference. First operand 151 states and 195 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:39:09,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:09,825 INFO L93 Difference]: Finished difference Result 168 states and 218 transitions. [2025-03-09 01:39:09,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:39:09,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2025-03-09 01:39:09,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:09,826 INFO L225 Difference]: With dead ends: 168 [2025-03-09 01:39:09,826 INFO L226 Difference]: Without dead ends: 166 [2025-03-09 01:39:09,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:39:09,826 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 111 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:09,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 220 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:39:09,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-09 01:39:09,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 141. [2025-03-09 01:39:09,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 126 states have (on average 1.3888888888888888) internal successors, (175), 133 states have internal predecessors, (175), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 01:39:09,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 183 transitions. [2025-03-09 01:39:09,832 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 183 transitions. Word has length 30 [2025-03-09 01:39:09,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:09,832 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 183 transitions. [2025-03-09 01:39:09,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:39:09,832 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 183 transitions. [2025-03-09 01:39:09,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 01:39:09,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:09,833 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:09,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:39:09,833 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:39:09,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:09,833 INFO L85 PathProgramCache]: Analyzing trace with hash -720372933, now seen corresponding path program 1 times [2025-03-09 01:39:09,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:09,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24190306] [2025-03-09 01:39:09,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:09,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:09,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 01:39:09,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 01:39:09,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:09,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:09,888 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:39:09,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:09,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24190306] [2025-03-09 01:39:09,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24190306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:09,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:39:09,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:39:09,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678815431] [2025-03-09 01:39:09,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:09,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:39:09,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:09,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:39:09,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:39:09,889 INFO L87 Difference]: Start difference. First operand 141 states and 183 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:39:09,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:09,961 INFO L93 Difference]: Finished difference Result 164 states and 214 transitions. [2025-03-09 01:39:09,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:39:09,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2025-03-09 01:39:09,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:09,962 INFO L225 Difference]: With dead ends: 164 [2025-03-09 01:39:09,962 INFO L226 Difference]: Without dead ends: 162 [2025-03-09 01:39:09,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:39:09,963 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 105 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:09,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 222 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:39:09,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-09 01:39:09,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 132. [2025-03-09 01:39:09,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 119 states have (on average 1.3781512605042017) internal successors, (164), 124 states have internal predecessors, (164), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 01:39:09,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 172 transitions. [2025-03-09 01:39:09,970 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 172 transitions. Word has length 30 [2025-03-09 01:39:09,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:09,970 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 172 transitions. [2025-03-09 01:39:09,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:39:09,970 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 172 transitions. [2025-03-09 01:39:09,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-09 01:39:09,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:09,971 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:09,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:39:09,971 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:39:09,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:09,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1470078900, now seen corresponding path program 1 times [2025-03-09 01:39:09,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:09,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45819630] [2025-03-09 01:39:09,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:09,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:09,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-09 01:39:09,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-09 01:39:09,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:09,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:10,060 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 01:39:10,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:10,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45819630] [2025-03-09 01:39:10,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45819630] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:39:10,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178277255] [2025-03-09 01:39:10,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:10,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:39:10,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:39:10,063 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:39:10,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:39:10,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-09 01:39:10,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-09 01:39:10,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:10,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:10,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:39:10,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:39:10,134 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:39:10,134 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:39:10,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178277255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:10,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:39:10,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-09 01:39:10,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085228021] [2025-03-09 01:39:10,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:10,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:39:10,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:10,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:39:10,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:39:10,135 INFO L87 Difference]: Start difference. First operand 132 states and 172 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 01:39:10,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:10,199 INFO L93 Difference]: Finished difference Result 300 states and 387 transitions. [2025-03-09 01:39:10,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:39:10,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2025-03-09 01:39:10,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:10,201 INFO L225 Difference]: With dead ends: 300 [2025-03-09 01:39:10,201 INFO L226 Difference]: Without dead ends: 171 [2025-03-09 01:39:10,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:39:10,203 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 16 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:10,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 191 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:39:10,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-09 01:39:10,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 137. [2025-03-09 01:39:10,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 123 states have (on average 1.3658536585365855) internal successors, (168), 128 states have internal predecessors, (168), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 01:39:10,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 176 transitions. [2025-03-09 01:39:10,212 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 176 transitions. Word has length 43 [2025-03-09 01:39:10,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:10,213 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 176 transitions. [2025-03-09 01:39:10,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 01:39:10,214 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 176 transitions. [2025-03-09 01:39:10,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-09 01:39:10,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:10,216 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:10,222 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-09 01:39:10,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:39:10,417 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:39:10,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:10,417 INFO L85 PathProgramCache]: Analyzing trace with hash -471564805, now seen corresponding path program 1 times [2025-03-09 01:39:10,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:10,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201327947] [2025-03-09 01:39:10,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:10,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:10,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 01:39:10,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 01:39:10,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:10,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:10,511 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 01:39:10,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:10,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201327947] [2025-03-09 01:39:10,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201327947] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:39:10,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772381678] [2025-03-09 01:39:10,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:10,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:39:10,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:39:10,513 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:39:10,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:39:10,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 01:39:10,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 01:39:10,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:10,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:10,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:39:10,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:39:10,585 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:39:10,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:39:10,675 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 01:39:10,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772381678] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:39:10,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:39:10,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-09 01:39:10,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163279550] [2025-03-09 01:39:10,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:39:10,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:39:10,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:10,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:39:10,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:39:10,678 INFO L87 Difference]: Start difference. First operand 137 states and 176 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-09 01:39:10,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:10,814 INFO L93 Difference]: Finished difference Result 430 states and 559 transitions. [2025-03-09 01:39:10,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:39:10,815 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 49 [2025-03-09 01:39:10,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:10,817 INFO L225 Difference]: With dead ends: 430 [2025-03-09 01:39:10,817 INFO L226 Difference]: Without dead ends: 333 [2025-03-09 01:39:10,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:39:10,818 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 156 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:10,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 270 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:39:10,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-09 01:39:10,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 149. [2025-03-09 01:39:10,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 135 states have (on average 1.3555555555555556) internal successors, (183), 140 states have internal predecessors, (183), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 01:39:10,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 191 transitions. [2025-03-09 01:39:10,829 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 191 transitions. Word has length 49 [2025-03-09 01:39:10,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:10,829 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 191 transitions. [2025-03-09 01:39:10,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-09 01:39:10,829 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 191 transitions. [2025-03-09 01:39:10,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 01:39:10,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:10,830 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:10,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:39:11,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-09 01:39:11,032 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:39:11,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:11,032 INFO L85 PathProgramCache]: Analyzing trace with hash 326024728, now seen corresponding path program 1 times [2025-03-09 01:39:11,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:11,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150375126] [2025-03-09 01:39:11,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:11,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:11,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 01:39:11,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 01:39:11,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:11,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:11,123 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 01:39:11,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:11,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150375126] [2025-03-09 01:39:11,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150375126] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:39:11,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920041927] [2025-03-09 01:39:11,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:11,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:39:11,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:39:11,125 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:39:11,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:39:11,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 01:39:11,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 01:39:11,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:11,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:11,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:39:11,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:39:11,204 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:39:11,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:39:11,281 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 01:39:11,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920041927] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:39:11,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:39:11,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-09 01:39:11,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490734012] [2025-03-09 01:39:11,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:39:11,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:39:11,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:11,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:39:11,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:39:11,282 INFO L87 Difference]: Start difference. First operand 149 states and 191 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-09 01:39:11,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:11,420 INFO L93 Difference]: Finished difference Result 440 states and 581 transitions. [2025-03-09 01:39:11,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:39:11,421 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 50 [2025-03-09 01:39:11,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:11,422 INFO L225 Difference]: With dead ends: 440 [2025-03-09 01:39:11,422 INFO L226 Difference]: Without dead ends: 343 [2025-03-09 01:39:11,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:39:11,423 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 137 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:11,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 346 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:39:11,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-03-09 01:39:11,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 161. [2025-03-09 01:39:11,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 147 states have (on average 1.346938775510204) internal successors, (198), 152 states have internal predecessors, (198), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 01:39:11,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 206 transitions. [2025-03-09 01:39:11,432 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 206 transitions. Word has length 50 [2025-03-09 01:39:11,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:11,433 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 206 transitions. [2025-03-09 01:39:11,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-09 01:39:11,433 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 206 transitions. [2025-03-09 01:39:11,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-09 01:39:11,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:11,433 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:11,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 01:39:11,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-09 01:39:11,634 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:39:11,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:11,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1835266133, now seen corresponding path program 1 times [2025-03-09 01:39:11,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:11,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829228083] [2025-03-09 01:39:11,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:11,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:11,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 01:39:11,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 01:39:11,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:11,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:11,664 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 01:39:11,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:11,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829228083] [2025-03-09 01:39:11,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829228083] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:39:11,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101867400] [2025-03-09 01:39:11,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:11,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:39:11,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:39:11,666 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:39:11,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:39:11,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 01:39:11,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 01:39:11,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:11,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:11,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 01:39:11,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:39:11,722 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-09 01:39:11,722 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:39:11,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101867400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:11,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:39:11,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2025-03-09 01:39:11,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978112221] [2025-03-09 01:39:11,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:11,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:39:11,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:11,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:39:11,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:39:11,724 INFO L87 Difference]: Start difference. First operand 161 states and 206 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 01:39:11,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:11,758 INFO L93 Difference]: Finished difference Result 284 states and 363 transitions. [2025-03-09 01:39:11,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:39:11,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2025-03-09 01:39:11,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:11,760 INFO L225 Difference]: With dead ends: 284 [2025-03-09 01:39:11,760 INFO L226 Difference]: Without dead ends: 178 [2025-03-09 01:39:11,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:39:11,760 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 144 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-09 01:39:11,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 144 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:39:11,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-09 01:39:11,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2025-03-09 01:39:11,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 152 states have (on average 1.3289473684210527) internal successors, (202), 157 states have internal predecessors, (202), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 01:39:11,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 210 transitions. [2025-03-09 01:39:11,768 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 210 transitions. Word has length 52 [2025-03-09 01:39:11,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:11,768 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 210 transitions. [2025-03-09 01:39:11,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 01:39:11,768 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 210 transitions. [2025-03-09 01:39:11,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-09 01:39:11,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:11,769 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:11,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 01:39:11,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:39:11,969 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:39:11,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:11,970 INFO L85 PathProgramCache]: Analyzing trace with hash 2104632662, now seen corresponding path program 1 times [2025-03-09 01:39:11,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:11,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15803734] [2025-03-09 01:39:11,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:11,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:11,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-09 01:39:11,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 01:39:11,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:11,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:12,081 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 01:39:12,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:12,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15803734] [2025-03-09 01:39:12,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15803734] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:39:12,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836085310] [2025-03-09 01:39:12,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:12,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:39:12,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:39:12,083 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:39:12,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:39:12,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-09 01:39:12,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 01:39:12,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:12,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:12,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 01:39:12,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:39:12,186 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 01:39:12,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:39:12,278 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 01:39:12,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836085310] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:39:12,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:39:12,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 17 [2025-03-09 01:39:12,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124883486] [2025-03-09 01:39:12,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:39:12,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 01:39:12,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:12,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 01:39:12,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:39:12,279 INFO L87 Difference]: Start difference. First operand 166 states and 210 transitions. Second operand has 17 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 15 states have internal predecessors, (67), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-09 01:39:12,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:12,513 INFO L93 Difference]: Finished difference Result 347 states and 436 transitions. [2025-03-09 01:39:12,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 01:39:12,514 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 15 states have internal predecessors, (67), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 53 [2025-03-09 01:39:12,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:12,515 INFO L225 Difference]: With dead ends: 347 [2025-03-09 01:39:12,515 INFO L226 Difference]: Without dead ends: 194 [2025-03-09 01:39:12,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2025-03-09 01:39:12,516 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 43 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:12,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 779 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:39:12,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-09 01:39:12,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 138. [2025-03-09 01:39:12,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 124 states have (on average 1.314516129032258) internal successors, (163), 129 states have internal predecessors, (163), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 01:39:12,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 171 transitions. [2025-03-09 01:39:12,524 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 171 transitions. Word has length 53 [2025-03-09 01:39:12,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:12,524 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 171 transitions. [2025-03-09 01:39:12,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 15 states have internal predecessors, (67), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-09 01:39:12,524 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 171 transitions. [2025-03-09 01:39:12,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-09 01:39:12,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:12,525 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:12,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 01:39:12,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 01:39:12,725 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:39:12,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:12,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1591868606, now seen corresponding path program 1 times [2025-03-09 01:39:12,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:12,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006965780] [2025-03-09 01:39:12,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:12,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:12,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 01:39:12,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 01:39:12,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:12,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:12,801 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 01:39:12,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:12,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006965780] [2025-03-09 01:39:12,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006965780] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:39:12,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191197789] [2025-03-09 01:39:12,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:12,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:39:12,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:39:12,803 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:39:12,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 01:39:12,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 01:39:12,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 01:39:12,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:12,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:12,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:39:12,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:39:12,897 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-09 01:39:12,897 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:39:12,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191197789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:12,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:39:12,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-09 01:39:12,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338651789] [2025-03-09 01:39:12,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:12,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:39:12,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:12,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:39:12,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:39:12,898 INFO L87 Difference]: Start difference. First operand 138 states and 171 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 01:39:12,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:12,943 INFO L93 Difference]: Finished difference Result 257 states and 319 transitions. [2025-03-09 01:39:12,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:39:12,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2025-03-09 01:39:12,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:12,945 INFO L225 Difference]: With dead ends: 257 [2025-03-09 01:39:12,945 INFO L226 Difference]: Without dead ends: 152 [2025-03-09 01:39:12,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:39:12,945 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 7 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:12,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 146 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:39:12,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-09 01:39:12,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 134. [2025-03-09 01:39:12,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 120 states have (on average 1.3) internal successors, (156), 125 states have internal predecessors, (156), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 01:39:12,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 164 transitions. [2025-03-09 01:39:12,956 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 164 transitions. Word has length 58 [2025-03-09 01:39:12,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:12,956 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 164 transitions. [2025-03-09 01:39:12,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 01:39:12,957 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 164 transitions. [2025-03-09 01:39:12,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-09 01:39:12,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:12,957 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:12,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 01:39:13,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 01:39:13,158 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:39:13,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:13,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1874211755, now seen corresponding path program 1 times [2025-03-09 01:39:13,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:13,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908970296] [2025-03-09 01:39:13,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:13,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:13,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 01:39:13,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 01:39:13,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:13,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:13,302 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 01:39:13,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:13,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908970296] [2025-03-09 01:39:13,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908970296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:13,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:39:13,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:39:13,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737513148] [2025-03-09 01:39:13,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:13,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:39:13,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:13,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:39:13,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:39:13,304 INFO L87 Difference]: Start difference. First operand 134 states and 164 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 01:39:13,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:13,363 INFO L93 Difference]: Finished difference Result 179 states and 214 transitions. [2025-03-09 01:39:13,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:39:13,363 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 59 [2025-03-09 01:39:13,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:13,364 INFO L225 Difference]: With dead ends: 179 [2025-03-09 01:39:13,364 INFO L226 Difference]: Without dead ends: 137 [2025-03-09 01:39:13,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:39:13,364 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 4 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:13,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 431 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:39:13,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-09 01:39:13,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2025-03-09 01:39:13,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 120 states have (on average 1.2833333333333334) internal successors, (154), 125 states have internal predecessors, (154), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 01:39:13,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 162 transitions. [2025-03-09 01:39:13,377 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 162 transitions. Word has length 59 [2025-03-09 01:39:13,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:13,377 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 162 transitions. [2025-03-09 01:39:13,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 01:39:13,377 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 162 transitions. [2025-03-09 01:39:13,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-09 01:39:13,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:13,378 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:13,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 01:39:13,378 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:39:13,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:13,378 INFO L85 PathProgramCache]: Analyzing trace with hash -372009009, now seen corresponding path program 2 times [2025-03-09 01:39:13,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:13,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24677134] [2025-03-09 01:39:13,379 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:39:13,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:13,386 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-03-09 01:39:13,395 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 62 statements. [2025-03-09 01:39:13,395 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:39:13,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:13,464 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-09 01:39:13,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:13,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24677134] [2025-03-09 01:39:13,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24677134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:13,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:39:13,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:39:13,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175168631] [2025-03-09 01:39:13,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:13,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:39:13,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:13,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:39:13,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:39:13,465 INFO L87 Difference]: Start difference. First operand 134 states and 162 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 01:39:13,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:13,512 INFO L93 Difference]: Finished difference Result 176 states and 208 transitions. [2025-03-09 01:39:13,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:39:13,512 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 62 [2025-03-09 01:39:13,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:13,513 INFO L225 Difference]: With dead ends: 176 [2025-03-09 01:39:13,513 INFO L226 Difference]: Without dead ends: 145 [2025-03-09 01:39:13,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:39:13,513 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 4 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:13,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 369 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:39:13,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-09 01:39:13,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 139. [2025-03-09 01:39:13,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 124 states have (on average 1.2741935483870968) internal successors, (158), 129 states have internal predecessors, (158), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-09 01:39:13,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 167 transitions. [2025-03-09 01:39:13,526 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 167 transitions. Word has length 62 [2025-03-09 01:39:13,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:13,526 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 167 transitions. [2025-03-09 01:39:13,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 01:39:13,526 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 167 transitions. [2025-03-09 01:39:13,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-09 01:39:13,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:13,526 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:13,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 01:39:13,527 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:39:13,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:13,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1967596018, now seen corresponding path program 1 times [2025-03-09 01:39:13,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:13,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318869057] [2025-03-09 01:39:13,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:13,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:13,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-09 01:39:13,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-09 01:39:13,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:13,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:13,660 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-09 01:39:13,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:13,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318869057] [2025-03-09 01:39:13,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318869057] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:39:13,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853404284] [2025-03-09 01:39:13,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:13,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:39:13,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:39:13,662 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:39:13,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 01:39:13,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-09 01:39:13,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-09 01:39:13,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:13,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:13,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 01:39:13,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:39:13,756 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 01:39:13,756 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:39:13,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853404284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:13,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:39:13,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 10 [2025-03-09 01:39:13,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703053963] [2025-03-09 01:39:13,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:13,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:39:13,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:13,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:39:13,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:39:13,757 INFO L87 Difference]: Start difference. First operand 139 states and 167 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 01:39:13,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:13,825 INFO L93 Difference]: Finished difference Result 187 states and 222 transitions. [2025-03-09 01:39:13,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:39:13,825 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 64 [2025-03-09 01:39:13,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:13,826 INFO L225 Difference]: With dead ends: 187 [2025-03-09 01:39:13,826 INFO L226 Difference]: Without dead ends: 158 [2025-03-09 01:39:13,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:39:13,826 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 11 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:13,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 419 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:39:13,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-09 01:39:13,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 150. [2025-03-09 01:39:13,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 133 states have (on average 1.263157894736842) internal successors, (168), 138 states have internal predecessors, (168), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-09 01:39:13,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 181 transitions. [2025-03-09 01:39:13,835 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 181 transitions. Word has length 64 [2025-03-09 01:39:13,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:13,835 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 181 transitions. [2025-03-09 01:39:13,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 01:39:13,835 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 181 transitions. [2025-03-09 01:39:13,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-09 01:39:13,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:13,836 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:13,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 01:39:14,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-09 01:39:14,040 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:39:14,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:14,040 INFO L85 PathProgramCache]: Analyzing trace with hash 170644659, now seen corresponding path program 1 times [2025-03-09 01:39:14,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:14,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041278919] [2025-03-09 01:39:14,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:14,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:14,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-09 01:39:14,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-09 01:39:14,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:14,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:14,128 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 01:39:14,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:14,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041278919] [2025-03-09 01:39:14,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041278919] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:39:14,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471331509] [2025-03-09 01:39:14,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:14,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:39:14,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:39:14,130 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:39:14,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 01:39:14,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-09 01:39:14,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-09 01:39:14,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:14,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:14,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-09 01:39:14,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:39:14,280 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 01:39:14,280 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:39:14,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471331509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:14,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:39:14,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2025-03-09 01:39:14,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227039053] [2025-03-09 01:39:14,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:14,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:39:14,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:14,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:39:14,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:39:14,281 INFO L87 Difference]: Start difference. First operand 150 states and 181 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 01:39:14,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:14,374 INFO L93 Difference]: Finished difference Result 184 states and 218 transitions. [2025-03-09 01:39:14,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:39:14,375 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 64 [2025-03-09 01:39:14,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:14,375 INFO L225 Difference]: With dead ends: 184 [2025-03-09 01:39:14,375 INFO L226 Difference]: Without dead ends: 167 [2025-03-09 01:39:14,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:39:14,379 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 14 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:14,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 543 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:39:14,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-09 01:39:14,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 160. [2025-03-09 01:39:14,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 143 states have (on average 1.2517482517482517) internal successors, (179), 148 states have internal predecessors, (179), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-09 01:39:14,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 192 transitions. [2025-03-09 01:39:14,391 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 192 transitions. Word has length 64 [2025-03-09 01:39:14,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:14,391 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 192 transitions. [2025-03-09 01:39:14,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 01:39:14,391 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 192 transitions. [2025-03-09 01:39:14,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-09 01:39:14,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:14,392 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:14,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 01:39:14,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-09 01:39:14,592 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:39:14,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:14,593 INFO L85 PathProgramCache]: Analyzing trace with hash 785593396, now seen corresponding path program 1 times [2025-03-09 01:39:14,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:14,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38729215] [2025-03-09 01:39:14,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:14,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:14,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 01:39:14,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 01:39:14,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:14,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:14,974 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-09 01:39:14,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:14,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38729215] [2025-03-09 01:39:14,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38729215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:14,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:39:14,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:39:14,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857033616] [2025-03-09 01:39:14,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:14,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:39:14,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:14,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:39:14,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:39:14,975 INFO L87 Difference]: Start difference. First operand 160 states and 192 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 01:39:15,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:15,112 INFO L93 Difference]: Finished difference Result 180 states and 217 transitions. [2025-03-09 01:39:15,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:39:15,112 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 66 [2025-03-09 01:39:15,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:15,113 INFO L225 Difference]: With dead ends: 180 [2025-03-09 01:39:15,113 INFO L226 Difference]: Without dead ends: 179 [2025-03-09 01:39:15,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:39:15,113 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 18 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:15,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 580 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:39:15,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-09 01:39:15,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2025-03-09 01:39:15,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 161 states have (on average 1.2484472049689441) internal successors, (201), 166 states have internal predecessors, (201), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-09 01:39:15,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 214 transitions. [2025-03-09 01:39:15,124 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 214 transitions. Word has length 66 [2025-03-09 01:39:15,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:15,124 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 214 transitions. [2025-03-09 01:39:15,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 01:39:15,124 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 214 transitions. [2025-03-09 01:39:15,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-09 01:39:15,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:15,125 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:15,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 01:39:15,125 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:39:15,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:15,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1416408429, now seen corresponding path program 1 times [2025-03-09 01:39:15,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:15,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068772059] [2025-03-09 01:39:15,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:15,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:15,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-09 01:39:15,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-09 01:39:15,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:15,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:15,462 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-09 01:39:15,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:15,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068772059] [2025-03-09 01:39:15,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068772059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:15,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:39:15,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:39:15,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462561273] [2025-03-09 01:39:15,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:15,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:39:15,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:15,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:39:15,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:39:15,463 INFO L87 Difference]: Start difference. First operand 178 states and 214 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 01:39:15,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:15,568 INFO L93 Difference]: Finished difference Result 178 states and 214 transitions. [2025-03-09 01:39:15,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:39:15,569 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 67 [2025-03-09 01:39:15,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:15,569 INFO L225 Difference]: With dead ends: 178 [2025-03-09 01:39:15,569 INFO L226 Difference]: Without dead ends: 177 [2025-03-09 01:39:15,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:39:15,570 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 10 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:15,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 465 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:39:15,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-09 01:39:15,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2025-03-09 01:39:15,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 161 states have (on average 1.2422360248447204) internal successors, (200), 165 states have internal predecessors, (200), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-09 01:39:15,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 213 transitions. [2025-03-09 01:39:15,580 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 213 transitions. Word has length 67 [2025-03-09 01:39:15,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:15,581 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 213 transitions. [2025-03-09 01:39:15,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 01:39:15,581 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 213 transitions. [2025-03-09 01:39:15,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-09 01:39:15,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:15,581 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:15,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-09 01:39:15,582 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:39:15,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:15,583 INFO L85 PathProgramCache]: Analyzing trace with hash -958988270, now seen corresponding path program 1 times [2025-03-09 01:39:15,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:15,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462847915] [2025-03-09 01:39:15,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:15,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:15,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-09 01:39:15,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 01:39:15,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:15,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:15,628 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-09 01:39:15,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:15,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462847915] [2025-03-09 01:39:15,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462847915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:15,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:39:15,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:39:15,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689749662] [2025-03-09 01:39:15,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:15,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:39:15,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:15,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:39:15,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:39:15,629 INFO L87 Difference]: Start difference. First operand 177 states and 213 transitions. Second operand has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 01:39:15,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:15,666 INFO L93 Difference]: Finished difference Result 177 states and 213 transitions. [2025-03-09 01:39:15,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:39:15,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 68 [2025-03-09 01:39:15,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:15,667 INFO L225 Difference]: With dead ends: 177 [2025-03-09 01:39:15,667 INFO L226 Difference]: Without dead ends: 175 [2025-03-09 01:39:15,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:39:15,667 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 19 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:15,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 182 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:39:15,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-09 01:39:15,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-03-09 01:39:15,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 161 states have (on average 1.2298136645962734) internal successors, (198), 163 states have internal predecessors, (198), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-09 01:39:15,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 211 transitions. [2025-03-09 01:39:15,677 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 211 transitions. Word has length 68 [2025-03-09 01:39:15,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:15,677 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 211 transitions. [2025-03-09 01:39:15,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 01:39:15,677 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 211 transitions. [2025-03-09 01:39:15,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-09 01:39:15,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:15,678 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:15,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-09 01:39:15,678 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:39:15,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:15,678 INFO L85 PathProgramCache]: Analyzing trace with hash 336134769, now seen corresponding path program 1 times [2025-03-09 01:39:15,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:15,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223453286] [2025-03-09 01:39:15,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:15,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:15,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 01:39:15,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 01:39:15,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:15,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:15,776 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 01:39:15,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:15,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223453286] [2025-03-09 01:39:15,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223453286] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:39:15,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465910637] [2025-03-09 01:39:15,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:15,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:39:15,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:39:15,778 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:39:15,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 01:39:15,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 01:39:15,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 01:39:15,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:15,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:15,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-09 01:39:15,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:39:15,960 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 01:39:15,960 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:39:15,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465910637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:15,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:39:15,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 15 [2025-03-09 01:39:15,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50410161] [2025-03-09 01:39:15,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:15,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:39:15,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:15,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:39:15,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-09 01:39:15,961 INFO L87 Difference]: Start difference. First operand 175 states and 211 transitions. Second operand has 12 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 01:39:16,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:16,097 INFO L93 Difference]: Finished difference Result 188 states and 226 transitions. [2025-03-09 01:39:16,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:39:16,097 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 69 [2025-03-09 01:39:16,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:16,098 INFO L225 Difference]: With dead ends: 188 [2025-03-09 01:39:16,098 INFO L226 Difference]: Without dead ends: 157 [2025-03-09 01:39:16,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-09 01:39:16,099 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 30 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:16,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 492 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:39:16,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-09 01:39:16,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 152. [2025-03-09 01:39:16,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 139 states have (on average 1.2446043165467626) internal successors, (173), 141 states have internal predecessors, (173), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-09 01:39:16,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 185 transitions. [2025-03-09 01:39:16,107 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 185 transitions. Word has length 69 [2025-03-09 01:39:16,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:16,107 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 185 transitions. [2025-03-09 01:39:16,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 01:39:16,108 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 185 transitions. [2025-03-09 01:39:16,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-09 01:39:16,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:16,108 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:16,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-09 01:39:16,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-09 01:39:16,309 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:39:16,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:16,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1784665527, now seen corresponding path program 1 times [2025-03-09 01:39:16,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:16,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927048632] [2025-03-09 01:39:16,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:16,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:16,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 01:39:16,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 01:39:16,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:16,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:16,387 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-09 01:39:16,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:16,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927048632] [2025-03-09 01:39:16,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927048632] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:39:16,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287512835] [2025-03-09 01:39:16,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:16,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:39:16,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:39:16,389 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:39:16,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 01:39:16,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 01:39:16,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 01:39:16,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:16,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:16,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:39:16,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:39:16,475 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-09 01:39:16,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:39:16,602 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-09 01:39:16,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287512835] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:39:16,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:39:16,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 8] total 16 [2025-03-09 01:39:16,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27509918] [2025-03-09 01:39:16,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:39:16,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:39:16,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:16,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:39:16,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:39:16,604 INFO L87 Difference]: Start difference. First operand 152 states and 185 transitions. Second operand has 16 states, 16 states have (on average 4.75) internal successors, (76), 14 states have internal predecessors, (76), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-09 01:39:16,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:16,906 INFO L93 Difference]: Finished difference Result 344 states and 416 transitions. [2025-03-09 01:39:16,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 01:39:16,906 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 14 states have internal predecessors, (76), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 69 [2025-03-09 01:39:16,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:16,908 INFO L225 Difference]: With dead ends: 344 [2025-03-09 01:39:16,908 INFO L226 Difference]: Without dead ends: 222 [2025-03-09 01:39:16,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:39:16,909 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 60 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:16,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 547 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:39:16,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-09 01:39:16,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 158. [2025-03-09 01:39:16,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 145 states have (on average 1.2413793103448276) internal successors, (180), 146 states have internal predecessors, (180), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-09 01:39:16,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 192 transitions. [2025-03-09 01:39:16,919 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 192 transitions. Word has length 69 [2025-03-09 01:39:16,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:16,919 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 192 transitions. [2025-03-09 01:39:16,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 14 states have internal predecessors, (76), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-09 01:39:16,919 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 192 transitions. [2025-03-09 01:39:16,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-09 01:39:16,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:16,920 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:16,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-09 01:39:17,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-09 01:39:17,121 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:39:17,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:17,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1529515826, now seen corresponding path program 1 times [2025-03-09 01:39:17,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:17,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611197483] [2025-03-09 01:39:17,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:17,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:17,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-09 01:39:17,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-09 01:39:17,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:17,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:17,370 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-09 01:39:17,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:17,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611197483] [2025-03-09 01:39:17,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611197483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:17,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:39:17,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:39:17,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537936689] [2025-03-09 01:39:17,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:17,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:39:17,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:17,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:39:17,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:39:17,372 INFO L87 Difference]: Start difference. First operand 158 states and 192 transitions. Second operand has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 01:39:17,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:17,408 INFO L93 Difference]: Finished difference Result 158 states and 192 transitions. [2025-03-09 01:39:17,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:39:17,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 73 [2025-03-09 01:39:17,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:17,409 INFO L225 Difference]: With dead ends: 158 [2025-03-09 01:39:17,409 INFO L226 Difference]: Without dead ends: 157 [2025-03-09 01:39:17,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:39:17,410 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 25 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:17,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 175 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:39:17,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-09 01:39:17,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 139. [2025-03-09 01:39:17,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 127 states have (on average 1.236220472440945) internal successors, (157), 127 states have internal predecessors, (157), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-09 01:39:17,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 169 transitions. [2025-03-09 01:39:17,421 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 169 transitions. Word has length 73 [2025-03-09 01:39:17,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:17,422 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 169 transitions. [2025-03-09 01:39:17,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 01:39:17,422 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 169 transitions. [2025-03-09 01:39:17,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-09 01:39:17,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:39:17,422 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:17,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-09 01:39:17,423 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-09 01:39:17,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:39:17,423 INFO L85 PathProgramCache]: Analyzing trace with hash 497999539, now seen corresponding path program 1 times [2025-03-09 01:39:17,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:39:17,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270438581] [2025-03-09 01:39:17,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:39:17,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:39:17,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-09 01:39:17,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-09 01:39:17,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:39:17,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:39:17,702 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-09 01:39:17,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:39:17,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270438581] [2025-03-09 01:39:17,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270438581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:39:17,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:39:17,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:39:17,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090333801] [2025-03-09 01:39:17,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:39:17,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:39:17,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:39:17,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:39:17,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:39:17,703 INFO L87 Difference]: Start difference. First operand 139 states and 169 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 01:39:17,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:39:17,738 INFO L93 Difference]: Finished difference Result 139 states and 169 transitions. [2025-03-09 01:39:17,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:39:17,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 76 [2025-03-09 01:39:17,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:39:17,739 INFO L225 Difference]: With dead ends: 139 [2025-03-09 01:39:17,739 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 01:39:17,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:39:17,740 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 17 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:39:17,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 225 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:39:17,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 01:39:17,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 01:39:17,740 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-09 01:39:17,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 01:39:17,740 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2025-03-09 01:39:17,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:39:17,740 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 01:39:17,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 01:39:17,741 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 01:39:17,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 01:39:17,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2025-03-09 01:39:17,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-03-09 01:39:17,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-03-09 01:39:17,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2025-03-09 01:39:17,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-03-09 01:39:17,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-03-09 01:39:17,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-03-09 01:39:17,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-03-09 01:39:17,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-03-09 01:39:17,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-03-09 01:39:17,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-03-09 01:39:17,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-03-09 01:39:17,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-03-09 01:39:17,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-03-09 01:39:17,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-03-09 01:39:17,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-03-09 01:39:17,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-09 01:39:17,746 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:39:17,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 01:39:27,714 WARN L286 SmtUtils]: Spent 9.37s on a formula simplification. DAG size of input: 82 DAG size of output: 102 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-09 01:39:48,984 WARN L286 SmtUtils]: Spent 10.34s on a formula simplification. DAG size of input: 83 DAG size of output: 106 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-09 01:39:51,223 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:39:51,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:39:51 BoogieIcfgContainer [2025-03-09 01:39:51,236 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:39:51,239 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:39:51,239 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:39:51,239 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:39:51,240 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:39:07" (3/4) ... [2025-03-09 01:39:51,241 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 01:39:51,245 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure base2flt [2025-03-09 01:39:51,246 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-09 01:39:51,249 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-09 01:39:51,250 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-09 01:39:51,250 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 01:39:51,250 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 01:39:51,268 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\old(e) <= 127) && ((0 < \old(m)) || (\old(e) != 0))) && (0 <= ((long long) 128 + \old(e)))) && (e <= \old(e))) && ((((m == \old(m)) && (e == 0)) || (\old(e) != 0)) || ((((((m % 2) == 0) && (((long long) e + 1) <= 0)) && ((m / 2) <= 4294967295)) && (0 <= (m / 2))) && (0 <= (2147483649 + e))))) && (m <= 33554431)) [2025-03-09 01:39:51,268 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 < \old(m)) || (\old(e) != 0)) && (0 <= ((long long) 128 + \old(e)))) && (\old(e) <= e)) && (e <= 127)) && (\old(m) != 1)) [2025-03-09 01:39:51,285 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 < \old(m)) || (\old(e) != 0)) && (0 <= ((long long) 128 + \old(e)))) && (\old(e) <= e)) && (e <= 127)) && (\old(m) != 1)) [2025-03-09 01:39:51,285 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\old(e) <= 127) && ((0 < \old(m)) || (\old(e) != 0))) && (0 <= ((long long) 128 + \old(e)))) && (e <= \old(e))) && ((((m == \old(m)) && (e == 0)) || (\old(e) != 0)) || ((((((m % 2) == 0) && (((long long) e + 1) <= 0)) && ((m / 2) <= 4294967295)) && (0 <= (m / 2))) && (0 <= (2147483649 + e))))) && (m <= 33554431)) [2025-03-09 01:39:51,313 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:39:51,314 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:39:51,314 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:39:51,314 INFO L158 Benchmark]: Toolchain (without parser) took 44807.21ms. Allocated memory was 142.6MB in the beginning and 931.1MB in the end (delta: 788.5MB). Free memory was 111.3MB in the beginning and 380.1MB in the end (delta: -268.8MB). Peak memory consumption was 514.9MB. Max. memory is 16.1GB. [2025-03-09 01:39:51,314 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:39:51,315 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.61ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 98.0MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:39:51,315 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.11ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 96.1MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:39:51,315 INFO L158 Benchmark]: Boogie Preprocessor took 37.67ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 95.2MB in the end (delta: 950.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:39:51,315 INFO L158 Benchmark]: IcfgBuilder took 428.76ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 70.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-09 01:39:51,316 INFO L158 Benchmark]: TraceAbstraction took 43980.93ms. Allocated memory was 142.6MB in the beginning and 931.1MB in the end (delta: 788.5MB). Free memory was 69.0MB in the beginning and 388.4MB in the end (delta: -319.3MB). Peak memory consumption was 513.1MB. Max. memory is 16.1GB. [2025-03-09 01:39:51,316 INFO L158 Benchmark]: Witness Printer took 74.64ms. Allocated memory is still 931.1MB. Free memory was 388.4MB in the beginning and 380.1MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:39:51,317 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.16ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.61ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 98.0MB in the end (delta: 13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.11ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 96.1MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.67ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 95.2MB in the end (delta: 950.8kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 428.76ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 70.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 43980.93ms. Allocated memory was 142.6MB in the beginning and 931.1MB in the end (delta: 788.5MB). Free memory was 69.0MB in the beginning and 388.4MB in the end (delta: -319.3MB). Peak memory consumption was 513.1MB. Max. memory is 16.1GB. * Witness Printer took 74.64ms. Allocated memory is still 931.1MB. Free memory was 388.4MB in the beginning and 380.1MB in the end (delta: 8.3MB). There was no memory consumed. 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: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 201]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 201]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 178]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 178]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 177]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 177]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 175]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 175]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 172]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 172]: 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 3 procedures, 105 locations, 145 edges, 16 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 29, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1253 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1240 mSDsluCounter, 8783 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6669 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3037 IncrementalHoareTripleChecker+Invalid, 3134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 2114 mSDtfsCounter, 3037 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 994 GetRequests, 811 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=23, InterpolantAutomatonStates: 192, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 29 MinimizatonAttempts, 787 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1863 NumberOfCodeBlocks, 1826 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 2038 ConstructedInterpolants, 0 QuantifiedInterpolants, 3877 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1849 ConjunctsInSsa, 145 ConjunctsInUnsatCore, 46 InterpolantComputations, 25 PerfectInterpolantSequences, 1011/1140 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: 37]: Location Invariant Derived location invariant: ((((((\old(e) <= 127) && ((0 < \old(m)) || (\old(e) != 0))) && (0 <= ((long long) 128 + \old(e)))) && (e <= \old(e))) && ((((m == \old(m)) && (e == 0)) || (\old(e) != 0)) || ((((((m % 2) == 0) && (((long long) e + 1) <= 0)) && ((m / 2) <= 4294967295)) && (0 <= (m / 2))) && (0 <= (2147483649 + e))))) && (m <= 33554431)) - InvariantResult [Line: 57]: Location Invariant Derived location invariant: ((((((0 < \old(m)) || (\old(e) != 0)) && (0 <= ((long long) 128 + \old(e)))) && (\old(e) <= e)) && (e <= 127)) && (\old(m) != 1)) RESULT: Ultimate proved your program to be correct! [2025-03-09 01:39:51,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE