./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:23:30,839 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:23:30,899 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 01:23:30,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:23:30,905 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:23:30,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:23:30,929 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:23:30,930 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:23:30,930 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:23:30,930 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:23:30,930 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:23:30,930 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:23:30,931 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:23:30,931 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:23:30,931 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:23:30,931 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:23:30,931 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:23:30,931 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:23:30,931 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:23:30,931 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:23:30,931 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:23:30,931 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:23:30,931 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:23:30,931 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:23:30,931 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:23:30,931 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:23:30,931 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:23:30,931 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:23:30,931 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:23:30,931 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:23:30,931 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:23:30,932 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:23:30,932 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:23:30,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:23:30,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:23:30,932 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:23:30,932 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:23:30,932 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:23:30,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:23:30,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:23:30,932 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:23:30,932 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:23:30,932 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:23:30,932 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:23:30,932 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:23:30,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:23:30,932 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:23:30,932 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:23:30,935 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:23:30,935 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:23:30,935 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-jdk21/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 -> 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f [2025-01-10 01:23:31,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:23:31,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:23:31,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:23:31,150 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:23:31,151 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:23:31,151 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2025-01-10 01:23:32,293 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ecebc68ca/bc492b04ffc4499b928368b67b567b86/FLAGfc0900712 [2025-01-10 01:23:32,572 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:23:32,573 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2025-01-10 01:23:32,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ecebc68ca/bc492b04ffc4499b928368b67b567b86/FLAGfc0900712 [2025-01-10 01:23:32,594 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ecebc68ca/bc492b04ffc4499b928368b67b567b86 [2025-01-10 01:23:32,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:23:32,597 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:23:32,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:23:32,599 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:23:32,602 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:23:32,604 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:23:32" (1/1) ... [2025-01-10 01:23:32,604 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691d64f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:32, skipping insertion in model container [2025-01-10 01:23:32,605 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:23:32" (1/1) ... [2025-01-10 01:23:32,623 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:23:32,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:23:32,780 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:23:32,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:23:32,826 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:23:32,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:32 WrapperNode [2025-01-10 01:23:32,827 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:23:32,828 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:23:32,828 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:23:32,828 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:23:32,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:32" (1/1) ... [2025-01-10 01:23:32,840 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:32" (1/1) ... [2025-01-10 01:23:32,860 INFO L138 Inliner]: procedures = 17, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 206 [2025-01-10 01:23:32,860 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:23:32,861 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:23:32,861 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:23:32,861 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:23:32,867 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:32" (1/1) ... [2025-01-10 01:23:32,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:32" (1/1) ... [2025-01-10 01:23:32,869 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:32" (1/1) ... [2025-01-10 01:23:32,880 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-01-10 01:23:32,880 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:32" (1/1) ... [2025-01-10 01:23:32,880 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:32" (1/1) ... [2025-01-10 01:23:32,884 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:32" (1/1) ... [2025-01-10 01:23:32,885 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:32" (1/1) ... [2025-01-10 01:23:32,891 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:32" (1/1) ... [2025-01-10 01:23:32,895 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:32" (1/1) ... [2025-01-10 01:23:32,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:32" (1/1) ... [2025-01-10 01:23:32,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:23:32,900 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:23:32,900 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:23:32,900 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:23:32,901 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:32" (1/1) ... [2025-01-10 01:23:32,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:23:32,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:32,930 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:23:32,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:23:32,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:23:32,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:23:32,952 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-01-10 01:23:32,952 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-01-10 01:23:32,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:23:32,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:23:32,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 01:23:32,952 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 01:23:33,012 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:23:33,014 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:23:33,431 INFO L? ?]: Removed 87 outVars from TransFormulas that were not future-live. [2025-01-10 01:23:33,431 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:23:33,439 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:23:33,439 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 01:23:33,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:23:33 BoogieIcfgContainer [2025-01-10 01:23:33,440 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:23:33,441 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:23:33,441 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:23:33,445 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:23:33,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:23:32" (1/3) ... [2025-01-10 01:23:33,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475a96f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:23:33, skipping insertion in model container [2025-01-10 01:23:33,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:23:32" (2/3) ... [2025-01-10 01:23:33,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@475a96f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:23:33, skipping insertion in model container [2025-01-10 01:23:33,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:23:33" (3/3) ... [2025-01-10 01:23:33,447 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2025-01-10 01:23:33,457 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:23:33,460 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_1-3a.c.cil.c that has 3 procedures, 125 locations, 1 initial locations, 2 loop locations, and 16 error locations. [2025-01-10 01:23:33,499 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:23:33,507 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;@3a97f824, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:23:33,507 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-01-10 01:23:33,510 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 97 states have (on average 1.6288659793814433) internal successors, (158), 115 states have internal predecessors, (158), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 01:23:33,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:23:33,515 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:33,515 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:33,516 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:33,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:33,519 INFO L85 PathProgramCache]: Analyzing trace with hash 765602863, now seen corresponding path program 1 times [2025-01-10 01:23:33,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:33,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577399433] [2025-01-10 01:23:33,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:33,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:33,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:23:33,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:23:33,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:33,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:33,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:33,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:33,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577399433] [2025-01-10 01:23:33,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577399433] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:33,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:33,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:23:33,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89678378] [2025-01-10 01:23:33,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:33,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:23:33,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:33,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:23:33,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:23:33,723 INFO L87 Difference]: Start difference. First operand has 125 states, 97 states have (on average 1.6288659793814433) internal successors, (158), 115 states have internal predecessors, (158), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:33,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:33,853 INFO L93 Difference]: Finished difference Result 291 states and 431 transitions. [2025-01-10 01:23:33,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:23:33,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 01:23:33,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:33,863 INFO L225 Difference]: With dead ends: 291 [2025-01-10 01:23:33,864 INFO L226 Difference]: Without dead ends: 137 [2025-01-10 01:23:33,867 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-01-10 01:23:33,869 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 80 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:33,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 456 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:33,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-01-10 01:23:33,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 127. [2025-01-10 01:23:33,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 106 states have (on average 1.490566037735849) internal successors, (158), 117 states have internal predecessors, (158), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:23:33,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 170 transitions. [2025-01-10 01:23:33,909 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 170 transitions. Word has length 8 [2025-01-10 01:23:33,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:33,909 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 170 transitions. [2025-01-10 01:23:33,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:33,910 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 170 transitions. [2025-01-10 01:23:33,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 01:23:33,911 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:33,911 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:33,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:23:33,912 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:33,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:33,929 INFO L85 PathProgramCache]: Analyzing trace with hash -77956044, now seen corresponding path program 1 times [2025-01-10 01:23:33,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:33,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389124294] [2025-01-10 01:23:33,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:33,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:33,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:23:33,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:23:33,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:33,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:33,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:23:33,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:33,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389124294] [2025-01-10 01:23:33,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389124294] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:33,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:33,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:23:33,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934840213] [2025-01-10 01:23:33,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:33,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:23:33,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:33,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:23:33,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:33,975 INFO L87 Difference]: Start difference. First operand 127 states and 170 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:34,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:34,023 INFO L93 Difference]: Finished difference Result 127 states and 170 transitions. [2025-01-10 01:23:34,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:23:34,026 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-01-10 01:23:34,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:34,028 INFO L225 Difference]: With dead ends: 127 [2025-01-10 01:23:34,028 INFO L226 Difference]: Without dead ends: 126 [2025-01-10 01:23:34,028 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-01-10 01:23:34,028 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:34,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 198 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:34,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-01-10 01:23:34,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-01-10 01:23:34,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 106 states have (on average 1.471698113207547) internal successors, (156), 116 states have internal predecessors, (156), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:23:34,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 168 transitions. [2025-01-10 01:23:34,036 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 168 transitions. Word has length 12 [2025-01-10 01:23:34,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:34,036 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 168 transitions. [2025-01-10 01:23:34,036 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-01-10 01:23:34,036 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 168 transitions. [2025-01-10 01:23:34,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 01:23:34,037 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:34,037 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:34,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:23:34,037 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:34,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:34,038 INFO L85 PathProgramCache]: Analyzing trace with hash -365349224, now seen corresponding path program 1 times [2025-01-10 01:23:34,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:34,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328255862] [2025-01-10 01:23:34,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:34,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:34,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:23:34,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:23:34,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:34,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:34,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:34,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:34,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328255862] [2025-01-10 01:23:34,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328255862] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:34,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549464446] [2025-01-10 01:23:34,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:34,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:34,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:34,117 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:34,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:23:34,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:23:34,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:23:34,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:34,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:34,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:23:34,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:34,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:34,189 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:23:34,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549464446] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:34,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:23:34,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-10 01:23:34,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817039131] [2025-01-10 01:23:34,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:34,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:23:34,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:34,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:23:34,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:23:34,191 INFO L87 Difference]: Start difference. First operand 126 states and 168 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:34,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:34,285 INFO L93 Difference]: Finished difference Result 161 states and 224 transitions. [2025-01-10 01:23:34,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:23:34,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-10 01:23:34,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:34,287 INFO L225 Difference]: With dead ends: 161 [2025-01-10 01:23:34,287 INFO L226 Difference]: Without dead ends: 159 [2025-01-10 01:23:34,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:23:34,288 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 25 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 300 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.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:34,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 300 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:34,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-01-10 01:23:34,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2025-01-10 01:23:34,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 114 states have (on average 1.456140350877193) internal successors, (166), 124 states have internal predecessors, (166), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:23:34,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 178 transitions. [2025-01-10 01:23:34,304 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 178 transitions. Word has length 13 [2025-01-10 01:23:34,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:34,304 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 178 transitions. [2025-01-10 01:23:34,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:34,304 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 178 transitions. [2025-01-10 01:23:34,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 01:23:34,304 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:34,304 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:34,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 01:23:34,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:34,509 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:34,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:34,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1878329983, now seen corresponding path program 1 times [2025-01-10 01:23:34,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:34,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037768119] [2025-01-10 01:23:34,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:34,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:34,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:23:34,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:23:34,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:34,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:34,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:34,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:34,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037768119] [2025-01-10 01:23:34,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037768119] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:34,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373058649] [2025-01-10 01:23:34,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:34,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:34,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:34,565 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:34,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:23:34,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:23:34,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:23:34,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:34,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:34,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:23:34,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:34,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:34,607 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:23:34,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373058649] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:34,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:23:34,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 01:23:34,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687791575] [2025-01-10 01:23:34,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:34,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:23:34,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:34,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:23:34,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:23:34,612 INFO L87 Difference]: Start difference. First operand 134 states and 178 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:34,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:34,645 INFO L93 Difference]: Finished difference Result 139 states and 185 transitions. [2025-01-10 01:23:34,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:23:34,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-10 01:23:34,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:34,646 INFO L225 Difference]: With dead ends: 139 [2025-01-10 01:23:34,646 INFO L226 Difference]: Without dead ends: 138 [2025-01-10 01:23:34,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:23:34,647 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 13 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:34,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 195 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:34,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-01-10 01:23:34,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2025-01-10 01:23:34,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4521739130434783) internal successors, (167), 125 states have internal predecessors, (167), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:23:34,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 179 transitions. [2025-01-10 01:23:34,655 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 179 transitions. Word has length 13 [2025-01-10 01:23:34,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:34,656 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 179 transitions. [2025-01-10 01:23:34,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:34,656 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 179 transitions. [2025-01-10 01:23:34,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 01:23:34,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:34,659 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:34,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:23:34,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:34,863 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:34,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:34,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1559076025, now seen corresponding path program 1 times [2025-01-10 01:23:34,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:34,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924916963] [2025-01-10 01:23:34,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:34,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:34,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:23:34,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:23:34,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:34,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:34,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:23:34,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:34,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924916963] [2025-01-10 01:23:34,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924916963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:34,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:34,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:23:34,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4069489] [2025-01-10 01:23:34,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:34,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:23:34,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:34,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:23:34,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:34,901 INFO L87 Difference]: Start difference. First operand 135 states and 179 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:34,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:34,928 INFO L93 Difference]: Finished difference Result 135 states and 179 transitions. [2025-01-10 01:23:34,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:23:34,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-10 01:23:34,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:34,929 INFO L225 Difference]: With dead ends: 135 [2025-01-10 01:23:34,929 INFO L226 Difference]: Without dead ends: 134 [2025-01-10 01:23:34,929 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-01-10 01:23:34,930 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:34,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 197 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:34,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-01-10 01:23:34,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2025-01-10 01:23:34,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 113 states have (on average 1.4424778761061947) internal successors, (163), 122 states have internal predecessors, (163), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:23:34,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 175 transitions. [2025-01-10 01:23:34,943 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 175 transitions. Word has length 14 [2025-01-10 01:23:34,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:34,943 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 175 transitions. [2025-01-10 01:23:34,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:34,943 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 175 transitions. [2025-01-10 01:23:34,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 01:23:34,943 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:34,943 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:34,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:23:34,944 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:34,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:34,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1898226272, now seen corresponding path program 1 times [2025-01-10 01:23:34,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:34,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223313438] [2025-01-10 01:23:34,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:34,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:34,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:23:34,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:23:34,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:34,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:34,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:34,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:34,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223313438] [2025-01-10 01:23:34,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223313438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:34,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:34,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:23:34,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318104555] [2025-01-10 01:23:34,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:34,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:23:34,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:34,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:23:34,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:34,977 INFO L87 Difference]: Start difference. First operand 132 states and 175 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:35,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:35,009 INFO L93 Difference]: Finished difference Result 253 states and 335 transitions. [2025-01-10 01:23:35,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:23:35,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-10 01:23:35,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:35,010 INFO L225 Difference]: With dead ends: 253 [2025-01-10 01:23:35,010 INFO L226 Difference]: Without dead ends: 144 [2025-01-10 01:23:35,011 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-01-10 01:23:35,011 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 10 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:35,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 196 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:35,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-01-10 01:23:35,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 134. [2025-01-10 01:23:35,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 115 states have (on average 1.4173913043478261) internal successors, (163), 124 states have internal predecessors, (163), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:23:35,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 175 transitions. [2025-01-10 01:23:35,021 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 175 transitions. Word has length 14 [2025-01-10 01:23:35,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:35,021 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 175 transitions. [2025-01-10 01:23:35,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:35,021 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 175 transitions. [2025-01-10 01:23:35,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 01:23:35,021 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:35,022 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:35,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:23:35,022 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:35,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:35,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1182907989, now seen corresponding path program 1 times [2025-01-10 01:23:35,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:35,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678969794] [2025-01-10 01:23:35,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:35,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:35,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:23:35,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:23:35,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:35,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:35,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:35,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:35,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678969794] [2025-01-10 01:23:35,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678969794] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:35,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:35,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:23:35,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844549303] [2025-01-10 01:23:35,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:35,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:23:35,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:35,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:23:35,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:23:35,087 INFO L87 Difference]: Start difference. First operand 134 states and 175 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:23:35,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:35,173 INFO L93 Difference]: Finished difference Result 196 states and 258 transitions. [2025-01-10 01:23:35,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:23:35,174 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-01-10 01:23:35,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:35,178 INFO L225 Difference]: With dead ends: 196 [2025-01-10 01:23:35,178 INFO L226 Difference]: Without dead ends: 194 [2025-01-10 01:23:35,178 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-01-10 01:23:35,179 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 125 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:35,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 310 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:35,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-01-10 01:23:35,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 163. [2025-01-10 01:23:35,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 143 states have (on average 1.4335664335664335) internal successors, (205), 152 states have internal predecessors, (205), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:23:35,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 217 transitions. [2025-01-10 01:23:35,194 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 217 transitions. Word has length 16 [2025-01-10 01:23:35,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:35,194 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 217 transitions. [2025-01-10 01:23:35,195 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:23:35,195 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 217 transitions. [2025-01-10 01:23:35,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 01:23:35,195 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:35,195 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:35,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:23:35,196 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:35,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:35,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1183645011, now seen corresponding path program 1 times [2025-01-10 01:23:35,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:35,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139337347] [2025-01-10 01:23:35,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:35,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:35,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:23:35,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:23:35,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:35,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:35,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:35,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:35,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139337347] [2025-01-10 01:23:35,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139337347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:35,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:35,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:23:35,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710602061] [2025-01-10 01:23:35,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:35,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:23:35,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:35,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:23:35,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:23:35,242 INFO L87 Difference]: Start difference. First operand 163 states and 217 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:23:35,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:35,307 INFO L93 Difference]: Finished difference Result 189 states and 249 transitions. [2025-01-10 01:23:35,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:23:35,307 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-01-10 01:23:35,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:35,308 INFO L225 Difference]: With dead ends: 189 [2025-01-10 01:23:35,308 INFO L226 Difference]: Without dead ends: 187 [2025-01-10 01:23:35,308 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-01-10 01:23:35,309 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 125 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:35,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 314 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:35,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-01-10 01:23:35,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 170. [2025-01-10 01:23:35,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 150 states have (on average 1.4133333333333333) internal successors, (212), 159 states have internal predecessors, (212), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:23:35,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 224 transitions. [2025-01-10 01:23:35,320 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 224 transitions. Word has length 16 [2025-01-10 01:23:35,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:35,321 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 224 transitions. [2025-01-10 01:23:35,321 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 01:23:35,321 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 224 transitions. [2025-01-10 01:23:35,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 01:23:35,322 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:35,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:35,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:23:35,323 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:35,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:35,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1088879428, now seen corresponding path program 1 times [2025-01-10 01:23:35,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:35,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967138856] [2025-01-10 01:23:35,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:35,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:35,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:23:35,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:23:35,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:35,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:35,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:35,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:35,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967138856] [2025-01-10 01:23:35,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967138856] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:35,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386508536] [2025-01-10 01:23:35,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:35,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:35,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:35,377 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:35,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:23:35,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:23:35,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:23:35,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:35,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:35,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 01:23:35,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:35,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:23:35,427 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:23:35,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386508536] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:35,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:23:35,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-10 01:23:35,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696051897] [2025-01-10 01:23:35,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:35,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:23:35,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:35,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:23:35,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:23:35,428 INFO L87 Difference]: Start difference. First operand 170 states and 224 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:35,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:35,469 INFO L93 Difference]: Finished difference Result 186 states and 248 transitions. [2025-01-10 01:23:35,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:23:35,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-10 01:23:35,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:35,471 INFO L225 Difference]: With dead ends: 186 [2025-01-10 01:23:35,471 INFO L226 Difference]: Without dead ends: 185 [2025-01-10 01:23:35,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:23:35,471 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 8 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:35,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 298 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:35,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-01-10 01:23:35,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 165. [2025-01-10 01:23:35,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 145 states have (on average 1.4068965517241379) internal successors, (204), 154 states have internal predecessors, (204), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:23:35,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 216 transitions. [2025-01-10 01:23:35,478 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 216 transitions. Word has length 15 [2025-01-10 01:23:35,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:35,478 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 216 transitions. [2025-01-10 01:23:35,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:23:35,478 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 216 transitions. [2025-01-10 01:23:35,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 01:23:35,479 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:35,479 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:35,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:23:35,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:35,683 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:35,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:35,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1193640708, now seen corresponding path program 1 times [2025-01-10 01:23:35,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:35,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935566652] [2025-01-10 01:23:35,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:35,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:35,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:23:35,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:23:35,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:35,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:35,720 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:23:35,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:35,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935566652] [2025-01-10 01:23:35,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935566652] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:35,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:35,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:23:35,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648730800] [2025-01-10 01:23:35,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:35,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:23:35,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:35,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:23:35,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:23:35,721 INFO L87 Difference]: Start difference. First operand 165 states and 216 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:23:35,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:35,785 INFO L93 Difference]: Finished difference Result 183 states and 240 transitions. [2025-01-10 01:23:35,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:23:35,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-01-10 01:23:35,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:35,786 INFO L225 Difference]: With dead ends: 183 [2025-01-10 01:23:35,786 INFO L226 Difference]: Without dead ends: 181 [2025-01-10 01:23:35,787 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-01-10 01:23:35,787 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 124 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:35,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 303 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:35,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-01-10 01:23:35,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 156. [2025-01-10 01:23:35,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 138 states have (on average 1.3985507246376812) internal successors, (193), 145 states have internal predecessors, (193), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:23:35,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 205 transitions. [2025-01-10 01:23:35,795 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 205 transitions. Word has length 23 [2025-01-10 01:23:35,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:35,795 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 205 transitions. [2025-01-10 01:23:35,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:23:35,795 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 205 transitions. [2025-01-10 01:23:35,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 01:23:35,796 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:35,796 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:35,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:23:35,796 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:35,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:35,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1192903686, now seen corresponding path program 1 times [2025-01-10 01:23:35,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:35,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842171793] [2025-01-10 01:23:35,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:35,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:35,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:23:35,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:23:35,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:35,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:35,826 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:23:35,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:35,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842171793] [2025-01-10 01:23:35,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842171793] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:35,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:35,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:23:35,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366197601] [2025-01-10 01:23:35,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:35,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:23:35,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:35,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:23:35,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:23:35,828 INFO L87 Difference]: Start difference. First operand 156 states and 205 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:23:35,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:35,897 INFO L93 Difference]: Finished difference Result 174 states and 229 transitions. [2025-01-10 01:23:35,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:23:35,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-01-10 01:23:35,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:35,898 INFO L225 Difference]: With dead ends: 174 [2025-01-10 01:23:35,898 INFO L226 Difference]: Without dead ends: 172 [2025-01-10 01:23:35,898 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-01-10 01:23:35,899 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 123 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:35,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 305 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:35,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-01-10 01:23:35,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 146. [2025-01-10 01:23:35,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 130 states have (on average 1.3923076923076922) internal successors, (181), 135 states have internal predecessors, (181), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:23:35,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 193 transitions. [2025-01-10 01:23:35,908 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 193 transitions. Word has length 23 [2025-01-10 01:23:35,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:35,909 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 193 transitions. [2025-01-10 01:23:35,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:23:35,909 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 193 transitions. [2025-01-10 01:23:35,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-10 01:23:35,910 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:35,910 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:35,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:23:35,910 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:35,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:35,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1273016311, now seen corresponding path program 1 times [2025-01-10 01:23:35,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:35,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531625631] [2025-01-10 01:23:35,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:35,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:35,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 01:23:35,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 01:23:35,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:35,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:36,053 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:23:36,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:36,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531625631] [2025-01-10 01:23:36,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531625631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:36,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:36,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:23:36,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141865579] [2025-01-10 01:23:36,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:36,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:23:36,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:36,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:23:36,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:23:36,054 INFO L87 Difference]: Start difference. First operand 146 states and 193 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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-01-10 01:23:36,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:36,108 INFO L93 Difference]: Finished difference Result 210 states and 270 transitions. [2025-01-10 01:23:36,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:23:36,110 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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 42 [2025-01-10 01:23:36,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:36,111 INFO L225 Difference]: With dead ends: 210 [2025-01-10 01:23:36,111 INFO L226 Difference]: Without dead ends: 152 [2025-01-10 01:23:36,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:23:36,112 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 9 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:36,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 582 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:36,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-01-10 01:23:36,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 146. [2025-01-10 01:23:36,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 130 states have (on average 1.376923076923077) internal successors, (179), 135 states have internal predecessors, (179), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:23:36,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 191 transitions. [2025-01-10 01:23:36,122 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 191 transitions. Word has length 42 [2025-01-10 01:23:36,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:36,122 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 191 transitions. [2025-01-10 01:23:36,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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-01-10 01:23:36,123 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 191 transitions. [2025-01-10 01:23:36,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-10 01:23:36,123 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:36,123 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:36,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:23:36,123 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:36,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:36,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1098195001, now seen corresponding path program 1 times [2025-01-10 01:23:36,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:36,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499098512] [2025-01-10 01:23:36,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:36,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:36,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 01:23:36,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 01:23:36,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:36,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:36,252 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:23:36,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:36,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499098512] [2025-01-10 01:23:36,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499098512] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:36,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278152874] [2025-01-10 01:23:36,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:36,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:36,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:36,255 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:36,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:23:36,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 01:23:36,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 01:23:36,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:36,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:36,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:23:36,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:36,325 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:23:36,325 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:23:36,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278152874] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:36,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:23:36,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-01-10 01:23:36,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735260541] [2025-01-10 01:23:36,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:36,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:23:36,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:36,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:23:36,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:23:36,327 INFO L87 Difference]: Start difference. First operand 146 states and 191 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-01-10 01:23:36,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:36,362 INFO L93 Difference]: Finished difference Result 146 states and 191 transitions. [2025-01-10 01:23:36,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:23:36,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 45 [2025-01-10 01:23:36,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:36,364 INFO L225 Difference]: With dead ends: 146 [2025-01-10 01:23:36,364 INFO L226 Difference]: Without dead ends: 145 [2025-01-10 01:23:36,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:23:36,364 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:36,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 372 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:36,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-01-10 01:23:36,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2025-01-10 01:23:36,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 130 states have (on average 1.3692307692307693) internal successors, (178), 134 states have internal predecessors, (178), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 01:23:36,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 190 transitions. [2025-01-10 01:23:36,371 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 190 transitions. Word has length 45 [2025-01-10 01:23:36,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:36,371 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 190 transitions. [2025-01-10 01:23:36,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-01-10 01:23:36,371 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 190 transitions. [2025-01-10 01:23:36,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-10 01:23:36,372 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:36,372 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:36,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 01:23:36,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-10 01:23:36,573 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:36,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:36,573 INFO L85 PathProgramCache]: Analyzing trace with hash -315693134, now seen corresponding path program 1 times [2025-01-10 01:23:36,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:36,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64963463] [2025-01-10 01:23:36,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:36,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:36,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-10 01:23:36,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-10 01:23:36,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:36,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:36,652 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:23:36,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:36,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64963463] [2025-01-10 01:23:36,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64963463] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:36,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410145515] [2025-01-10 01:23:36,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:36,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:36,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:36,655 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:36,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:23:36,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-10 01:23:36,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-10 01:23:36,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:36,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:36,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 01:23:36,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:36,737 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:23:36,738 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:23:36,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410145515] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:36,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:23:36,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-01-10 01:23:36,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493603677] [2025-01-10 01:23:36,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:36,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:23:36,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:36,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:23:36,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:23:36,739 INFO L87 Difference]: Start difference. First operand 145 states and 190 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:23:36,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:36,771 INFO L93 Difference]: Finished difference Result 243 states and 309 transitions. [2025-01-10 01:23:36,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:23:36,771 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2025-01-10 01:23:36,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:36,772 INFO L225 Difference]: With dead ends: 243 [2025-01-10 01:23:36,772 INFO L226 Difference]: Without dead ends: 200 [2025-01-10 01:23:36,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:23:36,773 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 50 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:36,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 504 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:36,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-01-10 01:23:36,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 153. [2025-01-10 01:23:36,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 137 states have (on average 1.364963503649635) internal successors, (187), 141 states have internal predecessors, (187), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-01-10 01:23:36,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 200 transitions. [2025-01-10 01:23:36,781 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 200 transitions. Word has length 46 [2025-01-10 01:23:36,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:36,781 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 200 transitions. [2025-01-10 01:23:36,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:23:36,781 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 200 transitions. [2025-01-10 01:23:36,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 01:23:36,781 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:36,782 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:36,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 01:23:36,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-10 01:23:36,986 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:36,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:36,986 INFO L85 PathProgramCache]: Analyzing trace with hash 500182424, now seen corresponding path program 1 times [2025-01-10 01:23:36,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:36,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607558138] [2025-01-10 01:23:36,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:36,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:36,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 01:23:36,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 01:23:37,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:37,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:37,135 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:23:37,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:37,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607558138] [2025-01-10 01:23:37,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607558138] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:37,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664910506] [2025-01-10 01:23:37,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:37,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:37,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:37,140 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:37,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:23:37,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 01:23:37,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 01:23:37,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:37,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:37,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-10 01:23:37,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:37,329 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:23:37,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:23:37,459 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:23:37,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664910506] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:37,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:23:37,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 12] total 17 [2025-01-10 01:23:37,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986000331] [2025-01-10 01:23:37,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:37,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:23:37,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:37,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:23:37,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:23:37,461 INFO L87 Difference]: Start difference. First operand 153 states and 200 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:23:37,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:37,528 INFO L93 Difference]: Finished difference Result 239 states and 304 transitions. [2025-01-10 01:23:37,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:23:37,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2025-01-10 01:23:37,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:37,529 INFO L225 Difference]: With dead ends: 239 [2025-01-10 01:23:37,529 INFO L226 Difference]: Without dead ends: 198 [2025-01-10 01:23:37,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:23:37,530 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 83 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:37,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 335 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:37,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-01-10 01:23:37,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 161. [2025-01-10 01:23:37,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 145 states have (on average 1.3586206896551725) internal successors, (197), 149 states have internal predecessors, (197), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-01-10 01:23:37,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 210 transitions. [2025-01-10 01:23:37,537 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 210 transitions. Word has length 48 [2025-01-10 01:23:37,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:37,538 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 210 transitions. [2025-01-10 01:23:37,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:23:37,538 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 210 transitions. [2025-01-10 01:23:37,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 01:23:37,538 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:37,538 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:37,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 01:23:37,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 01:23:37,739 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:37,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:37,740 INFO L85 PathProgramCache]: Analyzing trace with hash 2088530326, now seen corresponding path program 1 times [2025-01-10 01:23:37,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:37,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419115462] [2025-01-10 01:23:37,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:37,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:37,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 01:23:37,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 01:23:37,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:37,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:37,890 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:23:37,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:37,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419115462] [2025-01-10 01:23:37,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419115462] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:37,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310996565] [2025-01-10 01:23:37,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:37,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:37,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:37,894 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:37,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 01:23:37,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 01:23:37,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 01:23:37,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:37,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:37,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:23:37,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:37,974 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:23:37,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:23:38,056 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:23:38,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310996565] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:23:38,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:23:38,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2025-01-10 01:23:38,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691496] [2025-01-10 01:23:38,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:23:38,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:23:38,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:38,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:23:38,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:23:38,058 INFO L87 Difference]: Start difference. First operand 161 states and 210 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 11 states have internal predecessors, (56), 5 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (11), 8 states have call predecessors, (11), 5 states have call successors, (11) [2025-01-10 01:23:38,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:38,248 INFO L93 Difference]: Finished difference Result 315 states and 415 transitions. [2025-01-10 01:23:38,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 01:23:38,249 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 11 states have internal predecessors, (56), 5 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (11), 8 states have call predecessors, (11), 5 states have call successors, (11) Word has length 48 [2025-01-10 01:23:38,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:38,250 INFO L225 Difference]: With dead ends: 315 [2025-01-10 01:23:38,250 INFO L226 Difference]: Without dead ends: 256 [2025-01-10 01:23:38,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:23:38,251 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 103 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:38,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1053 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:38,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-01-10 01:23:38,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 191. [2025-01-10 01:23:38,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 169 states have (on average 1.3254437869822486) internal successors, (224), 171 states have internal predecessors, (224), 10 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (17), 15 states have call predecessors, (17), 10 states have call successors, (17) [2025-01-10 01:23:38,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 251 transitions. [2025-01-10 01:23:38,263 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 251 transitions. Word has length 48 [2025-01-10 01:23:38,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:38,264 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 251 transitions. [2025-01-10 01:23:38,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 11 states have internal predecessors, (56), 5 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (11), 8 states have call predecessors, (11), 5 states have call successors, (11) [2025-01-10 01:23:38,264 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 251 transitions. [2025-01-10 01:23:38,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 01:23:38,265 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:38,265 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:38,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 01:23:38,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:38,469 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:38,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:38,469 INFO L85 PathProgramCache]: Analyzing trace with hash -186818222, now seen corresponding path program 1 times [2025-01-10 01:23:38,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:38,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843009041] [2025-01-10 01:23:38,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:38,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:38,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 01:23:38,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 01:23:38,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:38,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:38,610 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:23:38,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:38,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843009041] [2025-01-10 01:23:38,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843009041] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:23:38,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545090091] [2025-01-10 01:23:38,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:38,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:23:38,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:23:38,614 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:23:38,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 01:23:38,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 01:23:38,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 01:23:38,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:38,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:38,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 01:23:38,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:23:38,774 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:23:38,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:23:38,976 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:23:38,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545090091] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:23:38,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:23:38,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 23 [2025-01-10 01:23:38,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648827070] [2025-01-10 01:23:38,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:23:38,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 01:23:38,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:38,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 01:23:38,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2025-01-10 01:23:38,979 INFO L87 Difference]: Start difference. First operand 191 states and 251 transitions. Second operand has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 18 states have internal predecessors, (70), 5 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (11), 10 states have call predecessors, (11), 5 states have call successors, (11) [2025-01-10 01:23:39,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:39,235 INFO L93 Difference]: Finished difference Result 273 states and 348 transitions. [2025-01-10 01:23:39,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-10 01:23:39,236 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 18 states have internal predecessors, (70), 5 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (11), 10 states have call predecessors, (11), 5 states have call successors, (11) Word has length 50 [2025-01-10 01:23:39,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:39,237 INFO L225 Difference]: With dead ends: 273 [2025-01-10 01:23:39,237 INFO L226 Difference]: Without dead ends: 192 [2025-01-10 01:23:39,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2025-01-10 01:23:39,238 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 35 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:39,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1298 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:39,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-01-10 01:23:39,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 179. [2025-01-10 01:23:39,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 160 states have (on average 1.31875) internal successors, (211), 163 states have internal predecessors, (211), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (11), 11 states have call predecessors, (11), 8 states have call successors, (11) [2025-01-10 01:23:39,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 230 transitions. [2025-01-10 01:23:39,248 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 230 transitions. Word has length 50 [2025-01-10 01:23:39,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:39,249 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 230 transitions. [2025-01-10 01:23:39,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 18 states have internal predecessors, (70), 5 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (11), 10 states have call predecessors, (11), 5 states have call successors, (11) [2025-01-10 01:23:39,249 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 230 transitions. [2025-01-10 01:23:39,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-10 01:23:39,249 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:39,250 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:39,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 01:23:39,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 01:23:39,451 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:39,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:39,451 INFO L85 PathProgramCache]: Analyzing trace with hash 2124162228, now seen corresponding path program 1 times [2025-01-10 01:23:39,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:39,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003032290] [2025-01-10 01:23:39,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:39,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:39,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-10 01:23:39,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-10 01:23:39,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:39,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:39,775 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:23:39,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:39,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003032290] [2025-01-10 01:23:39,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003032290] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:39,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:39,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 01:23:39,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060278971] [2025-01-10 01:23:39,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:39,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:23:39,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:39,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:23:39,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:23:39,777 INFO L87 Difference]: Start difference. First operand 179 states and 230 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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-01-10 01:23:39,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:39,883 INFO L93 Difference]: Finished difference Result 242 states and 311 transitions. [2025-01-10 01:23:39,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:23:39,884 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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 53 [2025-01-10 01:23:39,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:39,885 INFO L225 Difference]: With dead ends: 242 [2025-01-10 01:23:39,885 INFO L226 Difference]: Without dead ends: 237 [2025-01-10 01:23:39,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:23:39,886 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 159 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:39,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 619 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:39,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-01-10 01:23:39,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 180. [2025-01-10 01:23:39,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 162 states have (on average 1.3024691358024691) internal successors, (211), 163 states have internal predecessors, (211), 9 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) [2025-01-10 01:23:39,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 232 transitions. [2025-01-10 01:23:39,897 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 232 transitions. Word has length 53 [2025-01-10 01:23:39,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:39,897 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 232 transitions. [2025-01-10 01:23:39,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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-01-10 01:23:39,898 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 232 transitions. [2025-01-10 01:23:39,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-10 01:23:39,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:39,898 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:39,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 01:23:39,899 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:39,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:39,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1349373221, now seen corresponding path program 1 times [2025-01-10 01:23:39,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:39,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576931138] [2025-01-10 01:23:39,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:39,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:39,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-10 01:23:39,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-10 01:23:39,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:39,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:39,955 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:23:39,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:39,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576931138] [2025-01-10 01:23:39,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576931138] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:39,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:39,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:23:39,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669353597] [2025-01-10 01:23:39,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:39,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:23:39,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:39,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:23:39,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:23:39,958 INFO L87 Difference]: Start difference. First operand 180 states and 232 transitions. Second operand has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 01:23:39,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:39,975 INFO L93 Difference]: Finished difference Result 180 states and 232 transitions. [2025-01-10 01:23:39,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:23:39,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 65 [2025-01-10 01:23:39,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:39,976 INFO L225 Difference]: With dead ends: 180 [2025-01-10 01:23:39,976 INFO L226 Difference]: Without dead ends: 175 [2025-01-10 01:23:39,977 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-01-10 01:23:39,977 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 16 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:39,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 158 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:23:39,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-01-10 01:23:39,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-01-10 01:23:39,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 160 states have (on average 1.2875) internal successors, (206), 159 states have internal predecessors, (206), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (11), 11 states have call predecessors, (11), 8 states have call successors, (11) [2025-01-10 01:23:39,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 225 transitions. [2025-01-10 01:23:39,985 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 225 transitions. Word has length 65 [2025-01-10 01:23:39,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:39,985 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 225 transitions. [2025-01-10 01:23:39,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 01:23:39,985 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 225 transitions. [2025-01-10 01:23:39,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-10 01:23:39,986 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:39,987 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:39,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:23:39,987 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:39,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:39,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1166626929, now seen corresponding path program 1 times [2025-01-10 01:23:39,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:39,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35617888] [2025-01-10 01:23:39,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:39,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:39,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-10 01:23:39,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-10 01:23:39,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:39,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:40,115 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-10 01:23:40,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:40,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35617888] [2025-01-10 01:23:40,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35617888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:40,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:40,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 01:23:40,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271486682] [2025-01-10 01:23:40,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:40,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:23:40,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:40,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:23:40,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:23:40,117 INFO L87 Difference]: Start difference. First operand 175 states and 225 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 01:23:40,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:40,227 INFO L93 Difference]: Finished difference Result 218 states and 276 transitions. [2025-01-10 01:23:40,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:23:40,228 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 74 [2025-01-10 01:23:40,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:40,229 INFO L225 Difference]: With dead ends: 218 [2025-01-10 01:23:40,229 INFO L226 Difference]: Without dead ends: 205 [2025-01-10 01:23:40,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:23:40,230 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 24 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:40,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 578 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:40,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-01-10 01:23:40,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 188. [2025-01-10 01:23:40,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 171 states have (on average 1.280701754385965) internal successors, (219), 170 states have internal predecessors, (219), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (13), 13 states have call predecessors, (13), 10 states have call successors, (13) [2025-01-10 01:23:40,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 242 transitions. [2025-01-10 01:23:40,242 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 242 transitions. Word has length 74 [2025-01-10 01:23:40,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:40,242 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 242 transitions. [2025-01-10 01:23:40,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 01:23:40,242 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 242 transitions. [2025-01-10 01:23:40,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-10 01:23:40,243 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:23:40,243 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:40,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 01:23:40,243 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2025-01-10 01:23:40,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:23:40,243 INFO L85 PathProgramCache]: Analyzing trace with hash -723171516, now seen corresponding path program 1 times [2025-01-10 01:23:40,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:23:40,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517300590] [2025-01-10 01:23:40,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:23:40,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:23:40,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-10 01:23:40,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-10 01:23:40,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:23:40,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:23:40,513 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 01:23:40,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:23:40,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517300590] [2025-01-10 01:23:40,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517300590] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:23:40,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:23:40,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 01:23:40,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200590576] [2025-01-10 01:23:40,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:23:40,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:23:40,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:23:40,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:23:40,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:23:40,514 INFO L87 Difference]: Start difference. First operand 188 states and 242 transitions. Second operand has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 01:23:40,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:23:40,638 INFO L93 Difference]: Finished difference Result 264 states and 336 transitions. [2025-01-10 01:23:40,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:23:40,638 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 75 [2025-01-10 01:23:40,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:23:40,639 INFO L225 Difference]: With dead ends: 264 [2025-01-10 01:23:40,639 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:23:40,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:23:40,639 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 92 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:23:40,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 645 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:23:40,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:23:40,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:23:40,640 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-01-10 01:23:40,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:23:40,640 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2025-01-10 01:23:40,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:23:40,640 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:23:40,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 01:23:40,640 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:23:40,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:23:40,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2025-01-10 01:23:40,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-01-10 01:23:40,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-01-10 01:23:40,642 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2025-01-10 01:23:40,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-01-10 01:23:40,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-01-10 01:23:40,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-01-10 01:23:40,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-01-10 01:23:40,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-01-10 01:23:40,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-01-10 01:23:40,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-01-10 01:23:40,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-01-10 01:23:40,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-01-10 01:23:40,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-01-10 01:23:40,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-01-10 01:23:40,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-01-10 01:23:40,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 01:23:40,645 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:23:40,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:23:41,503 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:23:41,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:23:41 BoogieIcfgContainer [2025-01-10 01:23:41,516 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:23:41,516 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:23:41,516 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:23:41,517 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:23:41,517 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:23:33" (3/4) ... [2025-01-10 01:23:41,519 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:23:41,523 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2025-01-10 01:23:41,523 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-01-10 01:23:41,529 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-01-10 01:23:41,530 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-01-10 01:23:41,530 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 01:23:41,530 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 01:23:41,549 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= (2147483649 + e)) || (\old(e) != 0))) && (e <= 127)) [2025-01-10 01:23:41,550 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) && (e <= 127)) [2025-01-10 01:23:41,563 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) && (e <= 127)) [2025-01-10 01:23:41,563 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= (2147483649 + e)) || (\old(e) != 0))) && (e <= 127)) [2025-01-10 01:23:41,591 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:23:41,591 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:23:41,591 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:23:41,591 INFO L158 Benchmark]: Toolchain (without parser) took 8994.29ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 104.3MB in the beginning and 171.6MB in the end (delta: -67.3MB). Peak memory consumption was 144.1MB. Max. memory is 16.1GB. [2025-01-10 01:23:41,591 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:23:41,592 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.74ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 91.2MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 01:23:41,592 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.32ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 89.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:23:41,592 INFO L158 Benchmark]: Boogie Preprocessor took 38.62ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 87.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:23:41,592 INFO L158 Benchmark]: RCFGBuilder took 539.61ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 61.9MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 01:23:41,592 INFO L158 Benchmark]: TraceAbstraction took 8074.75ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 60.9MB in the beginning and 179.9MB in the end (delta: -119.0MB). Peak memory consumption was 160.9MB. Max. memory is 16.1GB. [2025-01-10 01:23:41,592 INFO L158 Benchmark]: Witness Printer took 74.50ms. Allocated memory is still 352.3MB. Free memory was 179.9MB in the beginning and 171.6MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:23:41,593 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.74ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 91.2MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.32ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 89.1MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.62ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 87.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 539.61ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 61.9MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8074.75ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 60.9MB in the beginning and 179.9MB in the end (delta: -119.0MB). Peak memory consumption was 160.9MB. Max. memory is 16.1GB. * Witness Printer took 74.50ms. Allocated memory is still 352.3MB. Free memory was 179.9MB in the beginning and 171.6MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 112]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 112]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 125 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 21, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1241 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1206 mSDsluCounter, 9216 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7070 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1538 IncrementalHoareTripleChecker+Invalid, 1626 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 2146 mSDtfsCounter, 1538 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 571 GetRequests, 419 SyntacticMatches, 2 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=16, InterpolantAutomatonStates: 137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 411 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 991 NumberOfCodeBlocks, 991 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1105 ConstructedInterpolants, 0 QuantifiedInterpolants, 2153 SizeOfPredicates, 4 NumberOfNonLiveVariables, 862 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 32 InterpolantComputations, 19 PerfectInterpolantSequences, 297/352 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && (0 <= ((long long) 128 + e))) && (e <= 127)) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((((\old(e) <= 127) && (0 <= ((long long) 128 + \old(e)))) && ((0 <= (2147483649 + e)) || (\old(e) != 0))) && (e <= 127)) RESULT: Ultimate proved your program to be correct! [2025-01-10 01:23:41,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE