./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_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-?-8fc3dc6-m [2025-03-17 14:41:52,860 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:41:52,912 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 14:41:52,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:41:52,919 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:41:52,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:41:52,941 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:41:52,941 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:41:52,941 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:41:52,941 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:41:52,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:41:52,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:41:52,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:41:52,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:41:52,942 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:41:52,942 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:41:52,942 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:41:52,942 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:41:52,942 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:41:52,942 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:41:52,942 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:41:52,942 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:41:52,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:41:52,942 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:41:52,942 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:41:52,942 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:41:52,942 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:41:52,944 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:41:52,944 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:41:52,944 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:41:52,944 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:41:52,944 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:41:52,944 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:41:52,944 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:41:52,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:41:52,944 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:41:52,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:41:52,944 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:41:52,944 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:41:52,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:41:52,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:41:52,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:41:52,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:41:52,945 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:41:52,945 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:41:52,945 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-17 14:41:53,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:41:53,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:41:53,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:41:53,188 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:41:53,188 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:41:53,190 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-17 14:41:54,363 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1cfe2e18/7ef61f5eb67940fdaf8eb292ea05ca96/FLAGa0a796efc [2025-03-17 14:41:54,560 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:41:54,561 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c [2025-03-17 14:41:54,567 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1cfe2e18/7ef61f5eb67940fdaf8eb292ea05ca96/FLAGa0a796efc [2025-03-17 14:41:54,577 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1cfe2e18/7ef61f5eb67940fdaf8eb292ea05ca96 [2025-03-17 14:41:54,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:41:54,580 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:41:54,581 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:41:54,581 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:41:54,583 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:41:54,584 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:41:54" (1/1) ... [2025-03-17 14:41:54,584 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23842c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:54, skipping insertion in model container [2025-03-17 14:41:54,584 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:41:54" (1/1) ... [2025-03-17 14:41:54,602 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:41:54,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:41:54,756 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:41:54,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:41:54,807 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:41:54,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:54 WrapperNode [2025-03-17 14:41:54,808 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:41:54,808 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:41:54,808 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:41:54,808 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:41:54,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:54" (1/1) ... [2025-03-17 14:41:54,819 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:54" (1/1) ... [2025-03-17 14:41:54,841 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 164 [2025-03-17 14:41:54,844 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:41:54,845 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:41:54,845 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:41:54,845 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:41:54,851 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:54" (1/1) ... [2025-03-17 14:41:54,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:54" (1/1) ... [2025-03-17 14:41:54,853 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:54" (1/1) ... [2025-03-17 14:41:54,872 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 14:41:54,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:54" (1/1) ... [2025-03-17 14:41:54,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:54" (1/1) ... [2025-03-17 14:41:54,875 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:54" (1/1) ... [2025-03-17 14:41:54,876 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:54" (1/1) ... [2025-03-17 14:41:54,877 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:54" (1/1) ... [2025-03-17 14:41:54,877 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:54" (1/1) ... [2025-03-17 14:41:54,879 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:41:54,879 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:41:54,879 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:41:54,879 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:41:54,880 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:54" (1/1) ... [2025-03-17 14:41:54,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:41:54,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:54,905 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:41:54,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:41:54,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:41:54,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:41:54,922 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-03-17 14:41:54,922 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-03-17 14:41:54,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:41:54,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:41:54,923 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 14:41:54,923 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 14:41:54,976 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:41:54,978 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:41:55,287 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2025-03-17 14:41:55,287 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:41:55,304 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:41:55,306 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:41:55,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:41:55 BoogieIcfgContainer [2025-03-17 14:41:55,307 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:41:55,308 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:41:55,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:41:55,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:41:55,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:41:54" (1/3) ... [2025-03-17 14:41:55,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9ab428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:41:55, skipping insertion in model container [2025-03-17 14:41:55,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:54" (2/3) ... [2025-03-17 14:41:55,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9ab428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:41:55, skipping insertion in model container [2025-03-17 14:41:55,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:41:55" (3/3) ... [2025-03-17 14:41:55,314 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_5a.c.cil.c [2025-03-17 14:41:55,324 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:41:55,327 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_5a.c.cil.c that has 3 procedures, 100 locations, 1 initial locations, 2 loop locations, and 16 error locations. [2025-03-17 14:41:55,369 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:41:55,377 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;@11743275, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:41:55,377 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-17 14:41:55,381 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 76 states have (on average 1.644736842105263) internal successors, (125), 93 states have internal predecessors, (125), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 14:41:55,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 14:41:55,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:55,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:55,386 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:55,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:55,390 INFO L85 PathProgramCache]: Analyzing trace with hash 966622936, now seen corresponding path program 1 times [2025-03-17 14:41:55,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:55,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450562450] [2025-03-17 14:41:55,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:55,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:55,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:41:55,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:41:55,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:55,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:55,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:41:55,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:55,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450562450] [2025-03-17 14:41:55,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450562450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:55,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:55,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:41:55,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076790624] [2025-03-17 14:41:55,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:55,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:41:55,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:55,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:41:55,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:41:55,576 INFO L87 Difference]: Start difference. First operand has 100 states, 76 states have (on average 1.644736842105263) internal successors, (125), 93 states have internal predecessors, (125), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:55,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:55,719 INFO L93 Difference]: Finished difference Result 243 states and 348 transitions. [2025-03-17 14:41:55,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:41:55,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 14:41:55,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:55,726 INFO L225 Difference]: With dead ends: 243 [2025-03-17 14:41:55,727 INFO L226 Difference]: Without dead ends: 122 [2025-03-17 14:41:55,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:41:55,731 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 80 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:55,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 316 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:55,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-17 14:41:55,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 112. [2025-03-17 14:41:55,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 94 states have (on average 1.4893617021276595) internal successors, (140), 105 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-17 14:41:55,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 148 transitions. [2025-03-17 14:41:55,769 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 148 transitions. Word has length 7 [2025-03-17 14:41:55,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:55,770 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 148 transitions. [2025-03-17 14:41:55,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:55,770 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 148 transitions. [2025-03-17 14:41:55,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 14:41:55,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:55,773 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:55,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:41:55,773 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:55,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:55,774 INFO L85 PathProgramCache]: Analyzing trace with hash 512657938, now seen corresponding path program 1 times [2025-03-17 14:41:55,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:55,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178263496] [2025-03-17 14:41:55,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:55,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:55,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:41:55,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:41:55,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:55,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:55,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:41:55,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:55,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178263496] [2025-03-17 14:41:55,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178263496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:55,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:55,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:41:55,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445340409] [2025-03-17 14:41:55,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:55,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:55,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:55,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:55,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:55,808 INFO L87 Difference]: Start difference. First operand 112 states and 148 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:55,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:55,842 INFO L93 Difference]: Finished difference Result 112 states and 148 transitions. [2025-03-17 14:41:55,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:55,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 14:41:55,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:55,845 INFO L225 Difference]: With dead ends: 112 [2025-03-17 14:41:55,845 INFO L226 Difference]: Without dead ends: 111 [2025-03-17 14:41:55,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:55,846 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 1 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 147 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-17 14:41:55,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 147 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:55,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-17 14:41:55,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-17 14:41:55,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 94 states have (on average 1.4680851063829787) internal successors, (138), 104 states have internal predecessors, (138), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 14:41:55,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 146 transitions. [2025-03-17 14:41:55,861 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 146 transitions. Word has length 11 [2025-03-17 14:41:55,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:55,862 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 146 transitions. [2025-03-17 14:41:55,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:55,862 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 146 transitions. [2025-03-17 14:41:55,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 14:41:55,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:55,862 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:55,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:41:55,863 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:55,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:55,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1287473114, now seen corresponding path program 1 times [2025-03-17 14:41:55,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:55,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205506571] [2025-03-17 14:41:55,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:55,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:55,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:41:55,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:41:55,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:55,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:55,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:41:55,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:55,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205506571] [2025-03-17 14:41:55,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205506571] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:55,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021188335] [2025-03-17 14:41:55,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:55,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:55,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:55,970 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:41:55,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:41:56,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:41:56,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:41:56,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:56,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:56,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:41:56,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:56,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:41:56,051 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:41:56,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021188335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:56,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:41:56,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-17 14:41:56,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022902498] [2025-03-17 14:41:56,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:56,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:56,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:56,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:56,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:41:56,054 INFO L87 Difference]: Start difference. First operand 111 states and 146 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:56,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:56,115 INFO L93 Difference]: Finished difference Result 123 states and 165 transitions. [2025-03-17 14:41:56,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:56,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-17 14:41:56,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:56,117 INFO L225 Difference]: With dead ends: 123 [2025-03-17 14:41:56,117 INFO L226 Difference]: Without dead ends: 122 [2025-03-17 14:41:56,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:41:56,118 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 13 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 143 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-17 14:41:56,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 143 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:56,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-17 14:41:56,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 112. [2025-03-17 14:41:56,125 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-17 14:41:56,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 147 transitions. [2025-03-17 14:41:56,126 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 147 transitions. Word has length 12 [2025-03-17 14:41:56,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:56,126 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 147 transitions. [2025-03-17 14:41:56,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:56,126 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 147 transitions. [2025-03-17 14:41:56,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 14:41:56,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:56,129 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:56,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 14:41:56,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:56,329 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:56,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:56,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1287458122, now seen corresponding path program 1 times [2025-03-17 14:41:56,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:56,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143136470] [2025-03-17 14:41:56,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:56,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:56,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:41:56,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:41:56,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:56,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:56,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:41:56,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:56,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143136470] [2025-03-17 14:41:56,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143136470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:56,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:56,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:41:56,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536962218] [2025-03-17 14:41:56,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:56,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:56,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:56,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:56,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:56,368 INFO L87 Difference]: Start difference. First operand 112 states and 147 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:56,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:56,404 INFO L93 Difference]: Finished difference Result 235 states and 315 transitions. [2025-03-17 14:41:56,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:56,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-17 14:41:56,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:56,406 INFO L225 Difference]: With dead ends: 235 [2025-03-17 14:41:56,406 INFO L226 Difference]: Without dead ends: 125 [2025-03-17 14:41:56,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:56,407 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 11 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:56,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 150 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:56,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-17 14:41:56,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 115. [2025-03-17 14:41:56,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 108 states have internal predecessors, (142), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 14:41:56,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 150 transitions. [2025-03-17 14:41:56,419 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 150 transitions. Word has length 12 [2025-03-17 14:41:56,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:56,419 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 150 transitions. [2025-03-17 14:41:56,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:56,419 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 150 transitions. [2025-03-17 14:41:56,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 14:41:56,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:56,419 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:56,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:41:56,420 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:56,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:56,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1093532363, now seen corresponding path program 1 times [2025-03-17 14:41:56,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:56,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835741239] [2025-03-17 14:41:56,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:56,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:56,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:41:56,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:41:56,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:56,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:56,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:41:56,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:56,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835741239] [2025-03-17 14:41:56,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835741239] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:56,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015658584] [2025-03-17 14:41:56,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:56,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:56,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:56,468 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:41:56,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:41:56,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:41:56,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:41:56,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:56,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:56,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:41:56,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:56,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:41:56,516 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:41:56,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015658584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:56,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:41:56,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-17 14:41:56,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868979725] [2025-03-17 14:41:56,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:56,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:41:56,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:56,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:41:56,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:41:56,517 INFO L87 Difference]: Start difference. First operand 115 states and 150 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:56,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:56,577 INFO L93 Difference]: Finished difference Result 146 states and 197 transitions. [2025-03-17 14:41:56,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:41:56,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-17 14:41:56,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:56,578 INFO L225 Difference]: With dead ends: 146 [2025-03-17 14:41:56,578 INFO L226 Difference]: Without dead ends: 144 [2025-03-17 14:41:56,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:41:56,578 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 27 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:56,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 154 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:56,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-17 14:41:56,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 122. [2025-03-17 14:41:56,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 105 states have (on average 1.4190476190476191) internal successors, (149), 115 states have internal predecessors, (149), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 14:41:56,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 157 transitions. [2025-03-17 14:41:56,592 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 157 transitions. Word has length 12 [2025-03-17 14:41:56,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:56,592 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 157 transitions. [2025-03-17 14:41:56,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:56,592 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 157 transitions. [2025-03-17 14:41:56,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 14:41:56,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:56,592 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:56,599 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-17 14:41:56,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:56,793 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:56,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:56,793 INFO L85 PathProgramCache]: Analyzing trace with hash -460235115, now seen corresponding path program 1 times [2025-03-17 14:41:56,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:56,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11595835] [2025-03-17 14:41:56,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:56,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:56,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:41:56,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:41:56,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:56,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:56,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:41:56,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:56,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11595835] [2025-03-17 14:41:56,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11595835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:56,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:56,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:41:56,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710436060] [2025-03-17 14:41:56,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:56,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:56,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:56,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:56,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:56,818 INFO L87 Difference]: Start difference. First operand 122 states and 157 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:56,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:56,847 INFO L93 Difference]: Finished difference Result 122 states and 157 transitions. [2025-03-17 14:41:56,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:56,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-17 14:41:56,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:56,848 INFO L225 Difference]: With dead ends: 122 [2025-03-17 14:41:56,848 INFO L226 Difference]: Without dead ends: 121 [2025-03-17 14:41:56,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:56,849 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 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-17 14:41:56,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:56,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-17 14:41:56,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2025-03-17 14:41:56,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.4077669902912622) internal successors, (145), 112 states have internal predecessors, (145), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 14:41:56,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 153 transitions. [2025-03-17 14:41:56,856 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 153 transitions. Word has length 13 [2025-03-17 14:41:56,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:56,856 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 153 transitions. [2025-03-17 14:41:56,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:56,856 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 153 transitions. [2025-03-17 14:41:56,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 14:41:56,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:56,857 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:56,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:41:56,857 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:56,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:56,858 INFO L85 PathProgramCache]: Analyzing trace with hash -291995527, now seen corresponding path program 1 times [2025-03-17 14:41:56,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:56,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970201636] [2025-03-17 14:41:56,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:56,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:56,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:41:56,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:41:56,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:56,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:56,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:41:56,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:56,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970201636] [2025-03-17 14:41:56,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970201636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:56,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:56,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:41:56,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332645200] [2025-03-17 14:41:56,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:56,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:41:56,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:56,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:41:56,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:41:56,906 INFO L87 Difference]: Start difference. First operand 119 states and 153 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:56,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:56,979 INFO L93 Difference]: Finished difference Result 137 states and 174 transitions. [2025-03-17 14:41:56,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:41:56,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-17 14:41:56,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:56,980 INFO L225 Difference]: With dead ends: 137 [2025-03-17 14:41:56,981 INFO L226 Difference]: Without dead ends: 136 [2025-03-17 14:41:56,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:41:56,985 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 92 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 275 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-17 14:41:56,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 275 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:56,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-17 14:41:56,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 124. [2025-03-17 14:41:56,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 108 states have (on average 1.3981481481481481) internal successors, (151), 117 states have internal predecessors, (151), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 14:41:56,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 159 transitions. [2025-03-17 14:41:56,995 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 159 transitions. Word has length 14 [2025-03-17 14:41:56,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:56,995 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 159 transitions. [2025-03-17 14:41:56,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:56,996 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 159 transitions. [2025-03-17 14:41:56,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 14:41:56,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:56,996 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:56,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:41:56,996 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:56,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:56,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1382168211, now seen corresponding path program 1 times [2025-03-17 14:41:56,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:56,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133307799] [2025-03-17 14:41:56,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:56,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:57,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:41:57,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:41:57,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:57,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:57,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:41:57,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:57,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133307799] [2025-03-17 14:41:57,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133307799] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:57,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785607931] [2025-03-17 14:41:57,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:57,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:57,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:57,059 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:41:57,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:41:57,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:41:57,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:41:57,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:57,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:57,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:41:57,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:57,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:41:57,123 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:41:57,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785607931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:57,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:41:57,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-17 14:41:57,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018917943] [2025-03-17 14:41:57,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:57,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:41:57,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:57,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:41:57,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:41:57,124 INFO L87 Difference]: Start difference. First operand 124 states and 159 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:57,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:57,170 INFO L93 Difference]: Finished difference Result 136 states and 176 transitions. [2025-03-17 14:41:57,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:41:57,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-17 14:41:57,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:57,171 INFO L225 Difference]: With dead ends: 136 [2025-03-17 14:41:57,171 INFO L226 Difference]: Without dead ends: 135 [2025-03-17 14:41:57,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:41:57,171 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 8 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:57,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 221 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:57,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-17 14:41:57,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2025-03-17 14:41:57,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 108 states have (on average 1.3888888888888888) internal successors, (150), 117 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-17 14:41:57,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 158 transitions. [2025-03-17 14:41:57,176 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 158 transitions. Word has length 14 [2025-03-17 14:41:57,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:57,176 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 158 transitions. [2025-03-17 14:41:57,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:57,177 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 158 transitions. [2025-03-17 14:41:57,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 14:41:57,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:57,177 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:57,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 14:41:57,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:57,382 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:57,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:57,382 INFO L85 PathProgramCache]: Analyzing trace with hash 754590, now seen corresponding path program 1 times [2025-03-17 14:41:57,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:57,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358582379] [2025-03-17 14:41:57,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:57,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:57,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:41:57,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:41:57,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:57,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:57,447 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 14:41:57,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:57,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358582379] [2025-03-17 14:41:57,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358582379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:57,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:57,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:41:57,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964624788] [2025-03-17 14:41:57,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:57,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:41:57,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:57,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:41:57,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:41:57,449 INFO L87 Difference]: Start difference. First operand 124 states and 158 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:41:57,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:57,514 INFO L93 Difference]: Finished difference Result 186 states and 240 transitions. [2025-03-17 14:41:57,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:41:57,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-17 14:41:57,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:57,516 INFO L225 Difference]: With dead ends: 186 [2025-03-17 14:41:57,516 INFO L226 Difference]: Without dead ends: 184 [2025-03-17 14:41:57,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:41:57,517 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 112 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:57,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 223 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:57,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-17 14:41:57,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 157. [2025-03-17 14:41:57,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 140 states have (on average 1.4071428571428573) internal successors, (197), 149 states have internal predecessors, (197), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 14:41:57,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 205 transitions. [2025-03-17 14:41:57,526 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 205 transitions. Word has length 22 [2025-03-17 14:41:57,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:57,526 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 205 transitions. [2025-03-17 14:41:57,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:41:57,527 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 205 transitions. [2025-03-17 14:41:57,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 14:41:57,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:57,530 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:57,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:41:57,531 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:57,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:57,531 INFO L85 PathProgramCache]: Analyzing trace with hash 794373, now seen corresponding path program 1 times [2025-03-17 14:41:57,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:57,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518379243] [2025-03-17 14:41:57,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:57,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:57,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:41:57,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:41:57,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:57,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:57,578 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 14:41:57,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:57,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518379243] [2025-03-17 14:41:57,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518379243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:57,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:57,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:41:57,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016890983] [2025-03-17 14:41:57,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:57,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:41:57,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:57,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:41:57,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:41:57,581 INFO L87 Difference]: Start difference. First operand 157 states and 205 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:41:57,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:57,667 INFO L93 Difference]: Finished difference Result 182 states and 236 transitions. [2025-03-17 14:41:57,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:41:57,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-17 14:41:57,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:57,671 INFO L225 Difference]: With dead ends: 182 [2025-03-17 14:41:57,671 INFO L226 Difference]: Without dead ends: 180 [2025-03-17 14:41:57,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:41:57,672 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 106 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 227 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-17 14:41:57,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 227 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:57,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-17 14:41:57,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 150. [2025-03-17 14:41:57,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 133 states have (on average 1.3984962406015038) internal successors, (186), 142 states have internal predecessors, (186), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 14:41:57,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 194 transitions. [2025-03-17 14:41:57,683 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 194 transitions. Word has length 22 [2025-03-17 14:41:57,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:57,683 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 194 transitions. [2025-03-17 14:41:57,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:41:57,683 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 194 transitions. [2025-03-17 14:41:57,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 14:41:57,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:57,685 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:57,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:41:57,686 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:57,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:57,686 INFO L85 PathProgramCache]: Analyzing trace with hash -930009216, now seen corresponding path program 1 times [2025-03-17 14:41:57,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:57,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416785988] [2025-03-17 14:41:57,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:57,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:57,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 14:41:57,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:41:57,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:57,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:57,738 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 14:41:57,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:57,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416785988] [2025-03-17 14:41:57,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416785988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:57,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:57,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:41:57,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154130691] [2025-03-17 14:41:57,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:57,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:41:57,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:57,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:41:57,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:41:57,739 INFO L87 Difference]: Start difference. First operand 150 states and 194 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 14:41:57,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:57,810 INFO L93 Difference]: Finished difference Result 167 states and 217 transitions. [2025-03-17 14:41:57,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:41:57,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2025-03-17 14:41:57,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:57,811 INFO L225 Difference]: With dead ends: 167 [2025-03-17 14:41:57,811 INFO L226 Difference]: Without dead ends: 165 [2025-03-17 14:41:57,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:41:57,812 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 111 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 216 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-17 14:41:57,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 216 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:57,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-17 14:41:57,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 140. [2025-03-17 14:41:57,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 125 states have (on average 1.392) internal successors, (174), 132 states have internal predecessors, (174), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 14:41:57,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 182 transitions. [2025-03-17 14:41:57,819 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 182 transitions. Word has length 29 [2025-03-17 14:41:57,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:57,820 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 182 transitions. [2025-03-17 14:41:57,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 14:41:57,820 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 182 transitions. [2025-03-17 14:41:57,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 14:41:57,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:57,820 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:57,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:41:57,821 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:57,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:57,821 INFO L85 PathProgramCache]: Analyzing trace with hash -929969433, now seen corresponding path program 1 times [2025-03-17 14:41:57,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:57,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513731341] [2025-03-17 14:41:57,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:57,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:57,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 14:41:57,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:41:57,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:57,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:57,869 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 14:41:57,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:57,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513731341] [2025-03-17 14:41:57,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513731341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:57,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:57,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:41:57,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903105929] [2025-03-17 14:41:57,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:57,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:41:57,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:57,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:41:57,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:41:57,871 INFO L87 Difference]: Start difference. First operand 140 states and 182 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 14:41:57,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:57,933 INFO L93 Difference]: Finished difference Result 163 states and 213 transitions. [2025-03-17 14:41:57,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:41:57,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2025-03-17 14:41:57,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:57,934 INFO L225 Difference]: With dead ends: 163 [2025-03-17 14:41:57,934 INFO L226 Difference]: Without dead ends: 161 [2025-03-17 14:41:57,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:41:57,935 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 105 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 218 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.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:57,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 218 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:57,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-17 14:41:57,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 131. [2025-03-17 14:41:57,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 118 states have (on average 1.38135593220339) internal successors, (163), 123 states have internal predecessors, (163), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 14:41:57,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 171 transitions. [2025-03-17 14:41:57,942 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 171 transitions. Word has length 29 [2025-03-17 14:41:57,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:57,943 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 171 transitions. [2025-03-17 14:41:57,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 14:41:57,943 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 171 transitions. [2025-03-17 14:41:57,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 14:41:57,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:57,943 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:57,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:41:57,943 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:57,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:57,944 INFO L85 PathProgramCache]: Analyzing trace with hash 797596737, now seen corresponding path program 1 times [2025-03-17 14:41:57,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:57,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049503203] [2025-03-17 14:41:57,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:57,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:57,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 14:41:57,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 14:41:57,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:57,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:58,033 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 14:41:58,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:58,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049503203] [2025-03-17 14:41:58,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049503203] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:58,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681739782] [2025-03-17 14:41:58,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:58,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:58,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:58,035 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:41:58,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:41:58,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 14:41:58,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 14:41:58,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:58,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:58,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:41:58,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:58,128 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:41:58,128 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:41:58,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681739782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:58,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:41:58,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-17 14:41:58,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536660936] [2025-03-17 14:41:58,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:58,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:41:58,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:58,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:41:58,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:41:58,129 INFO L87 Difference]: Start difference. First operand 131 states and 171 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:41:58,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:58,193 INFO L93 Difference]: Finished difference Result 299 states and 386 transitions. [2025-03-17 14:41:58,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:41:58,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2025-03-17 14:41:58,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:58,195 INFO L225 Difference]: With dead ends: 299 [2025-03-17 14:41:58,195 INFO L226 Difference]: Without dead ends: 170 [2025-03-17 14:41:58,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:41:58,195 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 16 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 188 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-17 14:41:58,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 188 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:58,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-17 14:41:58,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 136. [2025-03-17 14:41:58,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 122 states have (on average 1.3688524590163935) internal successors, (167), 127 states have internal predecessors, (167), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 14:41:58,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 175 transitions. [2025-03-17 14:41:58,203 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 175 transitions. Word has length 42 [2025-03-17 14:41:58,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:58,204 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 175 transitions. [2025-03-17 14:41:58,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:41:58,204 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 175 transitions. [2025-03-17 14:41:58,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 14:41:58,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:58,204 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:58,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 14:41:58,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:58,405 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:58,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:58,406 INFO L85 PathProgramCache]: Analyzing trace with hash -525165688, now seen corresponding path program 1 times [2025-03-17 14:41:58,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:58,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697735007] [2025-03-17 14:41:58,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:58,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:58,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 14:41:58,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 14:41:58,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:58,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:58,483 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 14:41:58,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:58,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697735007] [2025-03-17 14:41:58,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697735007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:58,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499875550] [2025-03-17 14:41:58,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:58,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:58,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:58,486 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:41:58,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:41:58,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 14:41:58,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 14:41:58,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:58,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:58,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:41:58,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:58,569 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:41:58,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:41:58,663 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 14:41:58,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499875550] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:41:58,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:41:58,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-17 14:41:58,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882002789] [2025-03-17 14:41:58,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:41:58,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:41:58,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:58,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:41:58,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:41:58,665 INFO L87 Difference]: Start difference. First operand 136 states and 175 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 14:41:58,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:58,803 INFO L93 Difference]: Finished difference Result 429 states and 558 transitions. [2025-03-17 14:41:58,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:41:58,803 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 48 [2025-03-17 14:41:58,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:58,804 INFO L225 Difference]: With dead ends: 429 [2025-03-17 14:41:58,805 INFO L226 Difference]: Without dead ends: 332 [2025-03-17 14:41:58,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 91 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-17 14:41:58,806 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 133 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:58,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 309 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:58,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-17 14:41:58,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 148. [2025-03-17 14:41:58,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 134 states have (on average 1.3582089552238805) internal successors, (182), 139 states have internal predecessors, (182), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 14:41:58,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 190 transitions. [2025-03-17 14:41:58,816 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 190 transitions. Word has length 48 [2025-03-17 14:41:58,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:58,817 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 190 transitions. [2025-03-17 14:41:58,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 14:41:58,817 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 190 transitions. [2025-03-17 14:41:58,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 14:41:58,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:58,818 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:58,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 14:41:59,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-17 14:41:59,019 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:59,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:59,019 INFO L85 PathProgramCache]: Analyzing trace with hash -604254723, now seen corresponding path program 1 times [2025-03-17 14:41:59,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:59,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201798753] [2025-03-17 14:41:59,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:59,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:59,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 14:41:59,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 14:41:59,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:59,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:59,103 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 14:41:59,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:59,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201798753] [2025-03-17 14:41:59,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201798753] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:59,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457354660] [2025-03-17 14:41:59,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:59,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:59,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:59,105 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:41:59,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:41:59,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 14:41:59,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 14:41:59,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:59,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:59,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:41:59,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:59,196 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:41:59,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:41:59,261 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 14:41:59,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457354660] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:41:59,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:41:59,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-17 14:41:59,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931162657] [2025-03-17 14:41:59,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:41:59,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:41:59,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:59,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:41:59,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:41:59,263 INFO L87 Difference]: Start difference. First operand 148 states and 190 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 14:41:59,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:59,392 INFO L93 Difference]: Finished difference Result 439 states and 580 transitions. [2025-03-17 14:41:59,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:41:59,393 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 49 [2025-03-17 14:41:59,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:59,394 INFO L225 Difference]: With dead ends: 439 [2025-03-17 14:41:59,394 INFO L226 Difference]: Without dead ends: 342 [2025-03-17 14:41:59,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:41:59,395 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 173 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:59,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 305 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:59,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-03-17 14:41:59,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 160. [2025-03-17 14:41:59,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 146 states have (on average 1.3493150684931507) internal successors, (197), 151 states have internal predecessors, (197), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 14:41:59,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 205 transitions. [2025-03-17 14:41:59,404 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 205 transitions. Word has length 49 [2025-03-17 14:41:59,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:59,405 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 205 transitions. [2025-03-17 14:41:59,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 14:41:59,405 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 205 transitions. [2025-03-17 14:41:59,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 14:41:59,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:59,405 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:59,411 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-17 14:41:59,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 14:41:59,610 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:59,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:59,610 INFO L85 PathProgramCache]: Analyzing trace with hash -552323952, now seen corresponding path program 1 times [2025-03-17 14:41:59,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:59,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834911852] [2025-03-17 14:41:59,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:59,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:59,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 14:41:59,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 14:41:59,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:59,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:59,643 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 14:41:59,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:59,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834911852] [2025-03-17 14:41:59,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834911852] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:59,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704416357] [2025-03-17 14:41:59,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:59,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:59,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:59,645 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:41:59,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 14:41:59,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 14:41:59,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 14:41:59,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:59,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:59,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 14:41:59,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:59,704 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-17 14:41:59,705 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:41:59,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704416357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:59,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:41:59,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2025-03-17 14:41:59,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398028187] [2025-03-17 14:41:59,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:59,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:59,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:59,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:59,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:59,706 INFO L87 Difference]: Start difference. First operand 160 states and 205 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:41:59,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:59,739 INFO L93 Difference]: Finished difference Result 283 states and 362 transitions. [2025-03-17 14:41:59,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:59,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 51 [2025-03-17 14:41:59,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:59,740 INFO L225 Difference]: With dead ends: 283 [2025-03-17 14:41:59,740 INFO L226 Difference]: Without dead ends: 177 [2025-03-17 14:41:59,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:59,741 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:59,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 142 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:59,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-17 14:41:59,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 165. [2025-03-17 14:41:59,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 151 states have (on average 1.3311258278145695) internal successors, (201), 156 states have internal predecessors, (201), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 14:41:59,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 209 transitions. [2025-03-17 14:41:59,750 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 209 transitions. Word has length 51 [2025-03-17 14:41:59,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:59,750 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 209 transitions. [2025-03-17 14:41:59,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:41:59,750 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 209 transitions. [2025-03-17 14:41:59,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 14:41:59,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:59,751 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:59,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 14:41:59,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:59,955 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:41:59,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:59,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1644122204, now seen corresponding path program 1 times [2025-03-17 14:41:59,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:59,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463553956] [2025-03-17 14:41:59,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:59,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:59,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 14:41:59,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 14:41:59,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:59,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:42:00,051 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 14:42:00,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:42:00,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463553956] [2025-03-17 14:42:00,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463553956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:42:00,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538494691] [2025-03-17 14:42:00,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:42:00,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:42:00,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:42:00,053 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:42:00,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 14:42:00,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 14:42:00,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 14:42:00,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:42:00,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:42:00,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 14:42:00,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:42:00,154 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 14:42:00,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:42:00,252 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 14:42:00,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538494691] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:42:00,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:42:00,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 17 [2025-03-17 14:42:00,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900725295] [2025-03-17 14:42:00,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:42:00,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 14:42:00,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:42:00,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 14:42:00,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-03-17 14:42:00,254 INFO L87 Difference]: Start difference. First operand 165 states and 209 transitions. Second operand has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 15 states have internal predecessors, (66), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-17 14:42:00,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:42:00,507 INFO L93 Difference]: Finished difference Result 346 states and 435 transitions. [2025-03-17 14:42:00,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 14:42:00,508 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 15 states have internal predecessors, (66), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 52 [2025-03-17 14:42:00,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:42:00,509 INFO L225 Difference]: With dead ends: 346 [2025-03-17 14:42:00,509 INFO L226 Difference]: Without dead ends: 193 [2025-03-17 14:42:00,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2025-03-17 14:42:00,510 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 43 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:42:00,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 830 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:42:00,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-17 14:42:00,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 137. [2025-03-17 14:42:00,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 123 states have (on average 1.3170731707317074) internal successors, (162), 128 states have internal predecessors, (162), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 14:42:00,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 170 transitions. [2025-03-17 14:42:00,519 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 170 transitions. Word has length 52 [2025-03-17 14:42:00,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:42:00,519 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 170 transitions. [2025-03-17 14:42:00,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 15 states have internal predecessors, (66), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-17 14:42:00,520 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 170 transitions. [2025-03-17 14:42:00,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 14:42:00,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:42:00,520 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:42:00,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 14:42:00,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 14:42:00,724 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:42:00,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:42:00,724 INFO L85 PathProgramCache]: Analyzing trace with hash -806541317, now seen corresponding path program 1 times [2025-03-17 14:42:00,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:42:00,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067880139] [2025-03-17 14:42:00,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:42:00,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:42:00,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 14:42:00,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 14:42:00,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:42:00,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:42:00,799 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 14:42:00,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:42:00,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067880139] [2025-03-17 14:42:00,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067880139] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:42:00,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961526197] [2025-03-17 14:42:00,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:42:00,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:42:00,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:42:00,801 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:42:00,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 14:42:00,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 14:42:00,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 14:42:00,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:42:00,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:42:00,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:42:00,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:42:00,907 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-17 14:42:00,907 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:42:00,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961526197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:42:00,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:42:00,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-17 14:42:00,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082936760] [2025-03-17 14:42:00,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:42:00,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:42:00,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:42:00,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:42:00,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:42:00,908 INFO L87 Difference]: Start difference. First operand 137 states and 170 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:42:00,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:42:00,948 INFO L93 Difference]: Finished difference Result 256 states and 318 transitions. [2025-03-17 14:42:00,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:42:00,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2025-03-17 14:42:00,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:42:00,949 INFO L225 Difference]: With dead ends: 256 [2025-03-17 14:42:00,949 INFO L226 Difference]: Without dead ends: 151 [2025-03-17 14:42:00,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:42:00,950 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 7 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 144 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-17 14:42:00,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 144 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:42:00,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-17 14:42:00,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 133. [2025-03-17 14:42:00,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 119 states have (on average 1.3025210084033614) internal successors, (155), 124 states have internal predecessors, (155), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 14:42:00,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 163 transitions. [2025-03-17 14:42:00,958 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 163 transitions. Word has length 57 [2025-03-17 14:42:00,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:42:00,958 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 163 transitions. [2025-03-17 14:42:00,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:42:00,958 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 163 transitions. [2025-03-17 14:42:00,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-17 14:42:00,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:42:00,959 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:42:00,965 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-17 14:42:01,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 14:42:01,159 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:42:01,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:42:01,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1299680157, now seen corresponding path program 1 times [2025-03-17 14:42:01,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:42:01,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114244478] [2025-03-17 14:42:01,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:42:01,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:42:01,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 14:42:01,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 14:42:01,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:42:01,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:42:01,268 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 14:42:01,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:42:01,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114244478] [2025-03-17 14:42:01,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114244478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:42:01,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:42:01,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 14:42:01,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512649725] [2025-03-17 14:42:01,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:42:01,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:42:01,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:42:01,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:42:01,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:42:01,270 INFO L87 Difference]: Start difference. First operand 133 states and 163 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:42:01,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:42:01,322 INFO L93 Difference]: Finished difference Result 178 states and 213 transitions. [2025-03-17 14:42:01,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:42:01,323 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 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 58 [2025-03-17 14:42:01,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:42:01,324 INFO L225 Difference]: With dead ends: 178 [2025-03-17 14:42:01,324 INFO L226 Difference]: Without dead ends: 136 [2025-03-17 14:42:01,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:42:01,324 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 4 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 425 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-17 14:42:01,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 425 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:42:01,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-17 14:42:01,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2025-03-17 14:42:01,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 119 states have (on average 1.2857142857142858) internal successors, (153), 124 states have internal predecessors, (153), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 14:42:01,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 161 transitions. [2025-03-17 14:42:01,333 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 161 transitions. Word has length 58 [2025-03-17 14:42:01,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:42:01,334 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 161 transitions. [2025-03-17 14:42:01,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:42:01,334 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 161 transitions. [2025-03-17 14:42:01,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 14:42:01,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:42:01,335 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] [2025-03-17 14:42:01,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 14:42:01,335 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:42:01,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:42:01,335 INFO L85 PathProgramCache]: Analyzing trace with hash -204209255, now seen corresponding path program 2 times [2025-03-17 14:42:01,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:42:01,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954254485] [2025-03-17 14:42:01,335 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:42:01,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:42:01,341 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-03-17 14:42:01,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 61 statements. [2025-03-17 14:42:01,350 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:42:01,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:42:01,416 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-17 14:42:01,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:42:01,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954254485] [2025-03-17 14:42:01,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954254485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:42:01,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:42:01,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:42:01,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727920552] [2025-03-17 14:42:01,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:42:01,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:42:01,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:42:01,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:42:01,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:42:01,418 INFO L87 Difference]: Start difference. First operand 133 states and 161 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:42:01,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:42:01,458 INFO L93 Difference]: Finished difference Result 175 states and 207 transitions. [2025-03-17 14:42:01,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:42:01,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 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 61 [2025-03-17 14:42:01,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:42:01,459 INFO L225 Difference]: With dead ends: 175 [2025-03-17 14:42:01,459 INFO L226 Difference]: Without dead ends: 144 [2025-03-17 14:42:01,459 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-17 14:42:01,459 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 4 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 364 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-17 14:42:01,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 364 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:42:01,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-17 14:42:01,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2025-03-17 14:42:01,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 123 states have (on average 1.2764227642276422) internal successors, (157), 128 states have internal predecessors, (157), 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-17 14:42:01,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 166 transitions. [2025-03-17 14:42:01,468 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 166 transitions. Word has length 61 [2025-03-17 14:42:01,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:42:01,468 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 166 transitions. [2025-03-17 14:42:01,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:42:01,468 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2025-03-17 14:42:01,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-17 14:42:01,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:42:01,468 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:42:01,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 14:42:01,468 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:42:01,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:42:01,469 INFO L85 PathProgramCache]: Analyzing trace with hash 14402236, now seen corresponding path program 1 times [2025-03-17 14:42:01,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:42:01,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202469370] [2025-03-17 14:42:01,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:42:01,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:42:01,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 14:42:01,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 14:42:01,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:42:01,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:42:01,546 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 14:42:01,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:42:01,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202469370] [2025-03-17 14:42:01,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202469370] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:42:01,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030670390] [2025-03-17 14:42:01,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:42:01,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:42:01,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:42:01,552 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:42:01,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 14:42:01,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 14:42:01,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 14:42:01,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:42:01,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:42:01,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 14:42:01,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:42:01,671 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-17 14:42:01,671 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:42:01,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030670390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:42:01,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:42:01,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2025-03-17 14:42:01,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710696873] [2025-03-17 14:42:01,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:42:01,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:42:01,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:42:01,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:42:01,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:42:01,673 INFO L87 Difference]: Start difference. First operand 138 states and 166 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:42:01,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:42:01,757 INFO L93 Difference]: Finished difference Result 186 states and 221 transitions. [2025-03-17 14:42:01,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:42:01,758 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 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 63 [2025-03-17 14:42:01,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:42:01,759 INFO L225 Difference]: With dead ends: 186 [2025-03-17 14:42:01,759 INFO L226 Difference]: Without dead ends: 157 [2025-03-17 14:42:01,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:42:01,760 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 10 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:42:01,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 545 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:42:01,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-17 14:42:01,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 149. [2025-03-17 14:42:01,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 132 states have (on average 1.2651515151515151) internal successors, (167), 137 states have internal predecessors, (167), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-17 14:42:01,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 180 transitions. [2025-03-17 14:42:01,770 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 180 transitions. Word has length 63 [2025-03-17 14:42:01,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:42:01,770 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 180 transitions. [2025-03-17 14:42:01,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:42:01,771 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 180 transitions. [2025-03-17 14:42:01,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-17 14:42:01,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:42:01,775 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:42:01,781 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-17 14:42:01,979 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-17 14:42:01,979 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:42:01,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:42:01,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1782549123, now seen corresponding path program 1 times [2025-03-17 14:42:01,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:42:01,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685402990] [2025-03-17 14:42:01,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:42:01,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:42:01,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 14:42:02,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 14:42:02,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:42:02,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:42:02,372 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-17 14:42:02,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:42:02,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685402990] [2025-03-17 14:42:02,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685402990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:42:02,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:42:02,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 14:42:02,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713164790] [2025-03-17 14:42:02,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:42:02,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:42:02,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:42:02,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:42:02,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:42:02,374 INFO L87 Difference]: Start difference. First operand 149 states and 180 transitions. Second operand has 11 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:42:02,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:42:02,508 INFO L93 Difference]: Finished difference Result 169 states and 205 transitions. [2025-03-17 14:42:02,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:42:02,509 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 63 [2025-03-17 14:42:02,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:42:02,510 INFO L225 Difference]: With dead ends: 169 [2025-03-17 14:42:02,510 INFO L226 Difference]: Without dead ends: 168 [2025-03-17 14:42:02,510 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-17 14:42:02,511 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 20 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 563 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-17 14:42:02,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 563 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:42:02,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-17 14:42:02,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2025-03-17 14:42:02,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 150 states have (on average 1.26) internal successors, (189), 155 states have internal predecessors, (189), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-17 14:42:02,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 202 transitions. [2025-03-17 14:42:02,522 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 202 transitions. Word has length 63 [2025-03-17 14:42:02,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:42:02,522 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 202 transitions. [2025-03-17 14:42:02,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:42:02,522 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 202 transitions. [2025-03-17 14:42:02,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-17 14:42:02,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:42:02,524 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:42:02,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 14:42:02,524 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:42:02,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:42:02,525 INFO L85 PathProgramCache]: Analyzing trace with hash 575552102, now seen corresponding path program 1 times [2025-03-17 14:42:02,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:42:02,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812646615] [2025-03-17 14:42:02,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:42:02,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:42:02,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 14:42:02,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 14:42:02,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:42:02,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:42:02,718 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-17 14:42:02,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:42:02,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812646615] [2025-03-17 14:42:02,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812646615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:42:02,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:42:02,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:42:02,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648424530] [2025-03-17 14:42:02,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:42:02,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:42:02,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:42:02,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:42:02,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:42:02,720 INFO L87 Difference]: Start difference. First operand 167 states and 202 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-17 14:42:02,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:42:02,767 INFO L93 Difference]: Finished difference Result 167 states and 202 transitions. [2025-03-17 14:42:02,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:42:02,767 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 64 [2025-03-17 14:42:02,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:42:02,768 INFO L225 Difference]: With dead ends: 167 [2025-03-17 14:42:02,768 INFO L226 Difference]: Without dead ends: 164 [2025-03-17 14:42:02,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:42:02,769 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 32 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 177 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-17 14:42:02,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 177 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:42:02,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-17 14:42:02,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-03-17 14:42:02,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 149 states have (on average 1.2483221476510067) internal successors, (186), 152 states have internal predecessors, (186), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-17 14:42:02,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 199 transitions. [2025-03-17 14:42:02,782 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 199 transitions. Word has length 64 [2025-03-17 14:42:02,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:42:02,782 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 199 transitions. [2025-03-17 14:42:02,782 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-17 14:42:02,782 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 199 transitions. [2025-03-17 14:42:02,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 14:42:02,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:42:02,783 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:42:02,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 14:42:02,783 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:42:02,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:42:02,783 INFO L85 PathProgramCache]: Analyzing trace with hash 662246043, now seen corresponding path program 1 times [2025-03-17 14:42:02,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:42:02,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749468631] [2025-03-17 14:42:02,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:42:02,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:42:02,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 14:42:02,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 14:42:02,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:42:02,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:42:02,823 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-17 14:42:02,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:42:02,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749468631] [2025-03-17 14:42:02,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749468631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:42:02,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:42:02,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:42:02,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457904417] [2025-03-17 14:42:02,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:42:02,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:42:02,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:42:02,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:42:02,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:42:02,825 INFO L87 Difference]: Start difference. First operand 164 states and 199 transitions. Second operand has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:42:02,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:42:02,860 INFO L93 Difference]: Finished difference Result 164 states and 199 transitions. [2025-03-17 14:42:02,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:42:02,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 65 [2025-03-17 14:42:02,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:42:02,861 INFO L225 Difference]: With dead ends: 164 [2025-03-17 14:42:02,862 INFO L226 Difference]: Without dead ends: 157 [2025-03-17 14:42:02,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:42:02,862 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 18 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:42:02,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 179 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:42:02,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-17 14:42:02,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-03-17 14:42:02,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 144 states have (on average 1.2430555555555556) internal successors, (179), 145 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-17 14:42:02,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 192 transitions. [2025-03-17 14:42:02,871 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 192 transitions. Word has length 65 [2025-03-17 14:42:02,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:42:02,871 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 192 transitions. [2025-03-17 14:42:02,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:42:02,871 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 192 transitions. [2025-03-17 14:42:02,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-17 14:42:02,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:42:02,872 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:42:02,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 14:42:02,872 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:42:02,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:42:02,872 INFO L85 PathProgramCache]: Analyzing trace with hash -945209084, now seen corresponding path program 1 times [2025-03-17 14:42:02,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:42:02,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060069324] [2025-03-17 14:42:02,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:42:02,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:42:02,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 14:42:02,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 14:42:02,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:42:02,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:42:02,959 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 14:42:02,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:42:02,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060069324] [2025-03-17 14:42:02,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060069324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:42:02,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057700362] [2025-03-17 14:42:02,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:42:02,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:42:02,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:42:02,962 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:42:02,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 14:42:02,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 14:42:03,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 14:42:03,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:42:03,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:42:03,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 14:42:03,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:42:03,123 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-17 14:42:03,123 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:42:03,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057700362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:42:03,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:42:03,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2025-03-17 14:42:03,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695454692] [2025-03-17 14:42:03,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:42:03,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:42:03,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:42:03,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:42:03,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:42:03,124 INFO L87 Difference]: Start difference. First operand 157 states and 192 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:42:03,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:42:03,225 INFO L93 Difference]: Finished difference Result 180 states and 218 transitions. [2025-03-17 14:42:03,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:42:03,225 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 66 [2025-03-17 14:42:03,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:42:03,226 INFO L225 Difference]: With dead ends: 180 [2025-03-17 14:42:03,226 INFO L226 Difference]: Without dead ends: 168 [2025-03-17 14:42:03,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:42:03,226 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 11 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:42:03,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 513 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:42:03,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-17 14:42:03,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 161. [2025-03-17 14:42:03,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 148 states have (on average 1.2364864864864864) internal successors, (183), 149 states have internal predecessors, (183), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-17 14:42:03,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 196 transitions. [2025-03-17 14:42:03,239 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 196 transitions. Word has length 66 [2025-03-17 14:42:03,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:42:03,239 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 196 transitions. [2025-03-17 14:42:03,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:42:03,239 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 196 transitions. [2025-03-17 14:42:03,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 14:42:03,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:42:03,240 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:42:03,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-17 14:42:03,440 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,SelfDestructingSolverStorable24 [2025-03-17 14:42:03,441 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:42:03,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:42:03,441 INFO L85 PathProgramCache]: Analyzing trace with hash 349415567, now seen corresponding path program 1 times [2025-03-17 14:42:03,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:42:03,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963523937] [2025-03-17 14:42:03,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:42:03,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:42:03,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 14:42:03,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 14:42:03,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:42:03,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:42:03,517 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 14:42:03,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:42:03,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963523937] [2025-03-17 14:42:03,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963523937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:42:03,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726728275] [2025-03-17 14:42:03,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:42:03,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:42:03,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:42:03,520 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:42:03,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 14:42:03,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 14:42:03,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 14:42:03,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:42:03,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:42:03,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 14:42:03,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:42:03,700 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-17 14:42:03,700 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:42:03,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726728275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:42:03,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:42:03,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2025-03-17 14:42:03,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636323989] [2025-03-17 14:42:03,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:42:03,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:42:03,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:42:03,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:42:03,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-17 14:42:03,701 INFO L87 Difference]: Start difference. First operand 161 states and 196 transitions. Second operand has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:42:03,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:42:03,830 INFO L93 Difference]: Finished difference Result 180 states and 217 transitions. [2025-03-17 14:42:03,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 14:42:03,831 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 68 [2025-03-17 14:42:03,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:42:03,832 INFO L225 Difference]: With dead ends: 180 [2025-03-17 14:42:03,832 INFO L226 Difference]: Without dead ends: 174 [2025-03-17 14:42:03,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-03-17 14:42:03,832 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 16 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:42:03,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 385 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:42:03,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-17 14:42:03,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 167. [2025-03-17 14:42:03,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 154 states have (on average 1.2272727272727273) internal successors, (189), 155 states have internal predecessors, (189), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-17 14:42:03,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 202 transitions. [2025-03-17 14:42:03,842 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 202 transitions. Word has length 68 [2025-03-17 14:42:03,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:42:03,842 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 202 transitions. [2025-03-17 14:42:03,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:42:03,842 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 202 transitions. [2025-03-17 14:42:03,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 14:42:03,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:42:03,843 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] [2025-03-17 14:42:03,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-17 14:42:04,043 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-17 14:42:04,044 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:42:04,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:42:04,044 INFO L85 PathProgramCache]: Analyzing trace with hash -693256840, now seen corresponding path program 1 times [2025-03-17 14:42:04,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:42:04,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625930922] [2025-03-17 14:42:04,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:42:04,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:42:04,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 14:42:04,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 14:42:04,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:42:04,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:42:04,117 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-17 14:42:04,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:42:04,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625930922] [2025-03-17 14:42:04,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625930922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:42:04,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641017240] [2025-03-17 14:42:04,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:42:04,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:42:04,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:42:04,119 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:42:04,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 14:42:04,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 14:42:04,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 14:42:04,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:42:04,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:42:04,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 14:42:04,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:42:04,207 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 14:42:04,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:42:04,346 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-17 14:42:04,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641017240] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:42:04,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:42:04,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 8] total 16 [2025-03-17 14:42:04,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729591691] [2025-03-17 14:42:04,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:42:04,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:42:04,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:42:04,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:42:04,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:42:04,347 INFO L87 Difference]: Start difference. First operand 167 states and 202 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 14 states have internal predecessors, (75), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-17 14:42:04,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:42:04,613 INFO L93 Difference]: Finished difference Result 375 states and 452 transitions. [2025-03-17 14:42:04,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 14:42:04,614 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 14 states have internal predecessors, (75), 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 68 [2025-03-17 14:42:04,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:42:04,615 INFO L225 Difference]: With dead ends: 375 [2025-03-17 14:42:04,615 INFO L226 Difference]: Without dead ends: 237 [2025-03-17 14:42:04,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 126 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-17 14:42:04,616 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 60 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:42:04,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 487 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:42:04,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-17 14:42:04,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 173. [2025-03-17 14:42:04,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 160 states have (on average 1.225) internal successors, (196), 160 states have internal predecessors, (196), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-17 14:42:04,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 209 transitions. [2025-03-17 14:42:04,635 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 209 transitions. Word has length 68 [2025-03-17 14:42:04,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:42:04,636 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 209 transitions. [2025-03-17 14:42:04,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 14 states have internal predecessors, (75), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-17 14:42:04,636 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 209 transitions. [2025-03-17 14:42:04,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-17 14:42:04,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:42:04,637 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] [2025-03-17 14:42:04,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-17 14:42:04,838 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-17 14:42:04,838 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:42:04,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:42:04,839 INFO L85 PathProgramCache]: Analyzing trace with hash 428297459, now seen corresponding path program 1 times [2025-03-17 14:42:04,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:42:04,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327104704] [2025-03-17 14:42:04,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:42:04,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:42:04,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-17 14:42:04,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-17 14:42:04,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:42:04,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:42:05,009 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-17 14:42:05,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:42:05,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327104704] [2025-03-17 14:42:05,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327104704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:42:05,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:42:05,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:42:05,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287678607] [2025-03-17 14:42:05,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:42:05,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:42:05,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:42:05,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:42:05,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:42:05,011 INFO L87 Difference]: Start difference. First operand 173 states and 209 transitions. Second operand has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:42:05,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:42:05,041 INFO L93 Difference]: Finished difference Result 173 states and 209 transitions. [2025-03-17 14:42:05,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:42:05,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 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 72 [2025-03-17 14:42:05,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:42:05,042 INFO L225 Difference]: With dead ends: 173 [2025-03-17 14:42:05,042 INFO L226 Difference]: Without dead ends: 172 [2025-03-17 14:42:05,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:42:05,043 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 25 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 172 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-17 14:42:05,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 172 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:42:05,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-17 14:42:05,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 154. [2025-03-17 14:42:05,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 142 states have (on average 1.2183098591549295) 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, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-17 14:42:05,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 186 transitions. [2025-03-17 14:42:05,067 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 186 transitions. Word has length 72 [2025-03-17 14:42:05,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:42:05,068 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 186 transitions. [2025-03-17 14:42:05,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:42:05,068 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 186 transitions. [2025-03-17 14:42:05,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-17 14:42:05,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:42:05,068 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:42:05,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 14:42:05,069 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:42:05,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:42:05,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1341010421, now seen corresponding path program 1 times [2025-03-17 14:42:05,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:42:05,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798074981] [2025-03-17 14:42:05,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:42:05,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:42:05,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 14:42:05,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 14:42:05,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:42:05,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:42:05,184 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 14:42:05,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:42:05,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798074981] [2025-03-17 14:42:05,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798074981] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:42:05,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121513578] [2025-03-17 14:42:05,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:42:05,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:42:05,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:42:05,186 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:42:05,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 14:42:05,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 14:42:05,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 14:42:05,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:42:05,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:42:05,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 14:42:05,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:42:05,402 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-17 14:42:05,403 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:42:05,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121513578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:42:05,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:42:05,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 17 [2025-03-17 14:42:05,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690953019] [2025-03-17 14:42:05,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:42:05,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:42:05,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:42:05,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:42:05,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-03-17 14:42:05,404 INFO L87 Difference]: Start difference. First operand 154 states and 186 transitions. Second operand has 12 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:42:05,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:42:05,528 INFO L93 Difference]: Finished difference Result 162 states and 193 transitions. [2025-03-17 14:42:05,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:42:05,528 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 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 74 [2025-03-17 14:42:05,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:42:05,529 INFO L225 Difference]: With dead ends: 162 [2025-03-17 14:42:05,529 INFO L226 Difference]: Without dead ends: 138 [2025-03-17 14:42:05,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-03-17 14:42:05,530 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 7 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:42:05,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 518 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:42:05,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-17 14:42:05,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-03-17 14:42:05,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 126 states have (on average 1.2380952380952381) internal successors, (156), 126 states have internal predecessors, (156), 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-17 14:42:05,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 168 transitions. [2025-03-17 14:42:05,539 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 168 transitions. Word has length 74 [2025-03-17 14:42:05,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:42:05,539 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 168 transitions. [2025-03-17 14:42:05,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 14:42:05,540 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 168 transitions. [2025-03-17 14:42:05,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 14:42:05,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:42:05,541 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:42:05,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-17 14:42:05,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:42:05,742 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:42:05,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:42:05,742 INFO L85 PathProgramCache]: Analyzing trace with hash -938168882, now seen corresponding path program 1 times [2025-03-17 14:42:05,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:42:05,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582964437] [2025-03-17 14:42:05,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:42:05,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:42:05,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 14:42:05,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 14:42:05,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:42:05,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:42:05,878 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-17 14:42:05,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:42:05,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582964437] [2025-03-17 14:42:05,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582964437] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:42:05,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57026128] [2025-03-17 14:42:05,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:42:05,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:42:05,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:42:05,881 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:42:05,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-17 14:42:05,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 14:42:05,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 14:42:05,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:42:05,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:42:05,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 14:42:05,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:42:05,987 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-17 14:42:05,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:42:06,061 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-17 14:42:06,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57026128] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:42:06,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:42:06,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2025-03-17 14:42:06,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138178854] [2025-03-17 14:42:06,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:42:06,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 14:42:06,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:42:06,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 14:42:06,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-03-17 14:42:06,063 INFO L87 Difference]: Start difference. First operand 138 states and 168 transitions. Second operand has 15 states, 15 states have (on average 5.4) internal successors, (81), 13 states have internal predecessors, (81), 4 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 14:42:06,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:42:06,311 INFO L93 Difference]: Finished difference Result 316 states and 382 transitions. [2025-03-17 14:42:06,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 14:42:06,311 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 13 states have internal predecessors, (81), 4 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) Word has length 75 [2025-03-17 14:42:06,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:42:06,312 INFO L225 Difference]: With dead ends: 316 [2025-03-17 14:42:06,312 INFO L226 Difference]: Without dead ends: 207 [2025-03-17 14:42:06,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2025-03-17 14:42:06,313 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 71 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:42:06,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 554 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:42:06,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-17 14:42:06,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 136. [2025-03-17 14:42:06,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 124 states have (on average 1.217741935483871) internal successors, (151), 125 states have internal predecessors, (151), 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-17 14:42:06,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 163 transitions. [2025-03-17 14:42:06,322 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 163 transitions. Word has length 75 [2025-03-17 14:42:06,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:42:06,322 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 163 transitions. [2025-03-17 14:42:06,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 13 states have internal predecessors, (81), 4 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 14:42:06,322 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 163 transitions. [2025-03-17 14:42:06,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-17 14:42:06,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:42:06,323 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:42:06,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-17 14:42:06,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:42:06,523 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:42:06,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:42:06,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1201989818, now seen corresponding path program 1 times [2025-03-17 14:42:06,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:42:06,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336666798] [2025-03-17 14:42:06,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:42:06,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:42:06,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 14:42:06,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 14:42:06,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:42:06,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:42:06,618 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-17 14:42:06,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:42:06,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336666798] [2025-03-17 14:42:06,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336666798] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:42:06,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355919826] [2025-03-17 14:42:06,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:42:06,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:42:06,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:42:06,622 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:42:06,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-17 14:42:06,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 14:42:06,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 14:42:06,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:42:06,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:42:06,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 14:42:06,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:42:06,731 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 26 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 14:42:06,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:42:06,869 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-17 14:42:06,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355919826] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:42:06,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:42:06,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-03-17 14:42:06,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122902740] [2025-03-17 14:42:06,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:42:06,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 14:42:06,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:42:06,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 14:42:06,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2025-03-17 14:42:06,871 INFO L87 Difference]: Start difference. First operand 136 states and 163 transitions. Second operand has 20 states, 20 states have (on average 6.1) internal successors, (122), 20 states have internal predecessors, (122), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 14:42:07,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:42:07,067 INFO L93 Difference]: Finished difference Result 613 states and 752 transitions. [2025-03-17 14:42:07,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 14:42:07,067 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.1) internal successors, (122), 20 states have internal predecessors, (122), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2025-03-17 14:42:07,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:42:07,069 INFO L225 Difference]: With dead ends: 613 [2025-03-17 14:42:07,069 INFO L226 Difference]: Without dead ends: 513 [2025-03-17 14:42:07,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=267, Unknown=0, NotChecked=0, Total=420 [2025-03-17 14:42:07,070 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 290 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 14:42:07,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 295 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 14:42:07,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-03-17 14:42:07,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 160. [2025-03-17 14:42:07,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 148 states have (on average 1.222972972972973) internal successors, (181), 149 states have internal predecessors, (181), 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-17 14:42:07,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 193 transitions. [2025-03-17 14:42:07,086 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 193 transitions. Word has length 78 [2025-03-17 14:42:07,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:42:07,086 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 193 transitions. [2025-03-17 14:42:07,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.1) internal successors, (122), 20 states have internal predecessors, (122), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 14:42:07,087 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 193 transitions. [2025-03-17 14:42:07,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-17 14:42:07,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:42:07,087 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:42:07,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-17 14:42:07,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:42:07,291 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-03-17 14:42:07,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:42:07,291 INFO L85 PathProgramCache]: Analyzing trace with hash -490948975, now seen corresponding path program 1 times [2025-03-17 14:42:07,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:42:07,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763512239] [2025-03-17 14:42:07,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:42:07,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:42:07,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 14:42:07,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 14:42:07,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:42:07,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:42:07,548 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-17 14:42:07,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:42:07,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763512239] [2025-03-17 14:42:07,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763512239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:42:07,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:42:07,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:42:07,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949414803] [2025-03-17 14:42:07,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:42:07,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:42:07,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:42:07,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:42:07,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:42:07,552 INFO L87 Difference]: Start difference. First operand 160 states and 193 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:42:07,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:42:07,600 INFO L93 Difference]: Finished difference Result 160 states and 193 transitions. [2025-03-17 14:42:07,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:42:07,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 81 [2025-03-17 14:42:07,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:42:07,601 INFO L225 Difference]: With dead ends: 160 [2025-03-17 14:42:07,601 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 14:42:07,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:42:07,601 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 20 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:42:07,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 217 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:42:07,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 14:42:07,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 14:42:07,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:42:07,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 14:42:07,604 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2025-03-17 14:42:07,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:42:07,604 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 14:42:07,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 14:42:07,604 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 14:42:07,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 14:42:07,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2025-03-17 14:42:07,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-03-17 14:42:07,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-03-17 14:42:07,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2025-03-17 14:42:07,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-03-17 14:42:07,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-03-17 14:42:07,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-03-17 14:42:07,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-03-17 14:42:07,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-03-17 14:42:07,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-03-17 14:42:07,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-03-17 14:42:07,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-03-17 14:42:07,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-03-17 14:42:07,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-03-17 14:42:07,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-03-17 14:42:07,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-03-17 14:42:07,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 14:42:07,610 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, 1, 1, 1] [2025-03-17 14:42:07,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 14:42:44,633 WARN L286 SmtUtils]: Spent 36.88s on a formula simplification. DAG size of input: 115 DAG size of output: 194 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-17 14:43:20,701 WARN L286 SmtUtils]: Spent 36.07s on a formula simplification. DAG size of input: 115 DAG size of output: 194 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)