./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound2.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/nla-digbench-scaling/sqrt1-ll_valuebound2.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 69e3759b6e7ee15378e7391ad11d943bae32b67ab55c3e2fea94db5284daa3ec --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:29:17,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:29:17,836 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 02:29:17,840 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:29:17,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:29:17,853 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:29:17,854 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:29:17,854 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:29:17,854 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:29:17,854 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:29:17,854 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:29:17,854 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:29:17,855 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:29:17,855 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:29:17,855 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:29:17,855 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:29:17,855 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:29:17,855 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:29:17,855 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:29:17,855 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:29:17,855 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:29:17,855 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:29:17,856 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:29:17,856 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:29:17,856 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:29:17,856 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:29:17,856 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:29:17,856 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:29:17,856 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:29:17,857 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:29:17,857 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:29:17,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:29:17,857 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:29:17,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:29:17,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:29:17,857 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:29:17,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:29:17,857 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:29:17,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:29:17,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:29:17,858 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:29:17,858 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:29:17,858 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:29:17,858 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:29:17,858 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:29:17,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:29:17,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:29:17,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:29:17,858 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:29:17,858 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:29:17,858 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 -> 69e3759b6e7ee15378e7391ad11d943bae32b67ab55c3e2fea94db5284daa3ec [2025-01-10 02:29:18,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:29:18,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:29:18,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:29:18,059 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:29:18,060 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:29:18,061 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound2.c [2025-01-10 02:29:19,154 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d0138d65/dd67b6d2c05c4b9191ef9b06f2fea23e/FLAG0f0a0a3ce [2025-01-10 02:29:19,381 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:29:19,382 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/sqrt1-ll_valuebound2.c [2025-01-10 02:29:19,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d0138d65/dd67b6d2c05c4b9191ef9b06f2fea23e/FLAG0f0a0a3ce [2025-01-10 02:29:19,403 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d0138d65/dd67b6d2c05c4b9191ef9b06f2fea23e [2025-01-10 02:29:19,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:29:19,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:29:19,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:29:19,408 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:29:19,412 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:29:19,413 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:29:19" (1/1) ... [2025-01-10 02:29:19,414 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c4a6df1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:19, skipping insertion in model container [2025-01-10 02:29:19,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:29:19" (1/1) ... [2025-01-10 02:29:19,425 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:29:19,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:29:19,549 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:29:19,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:29:19,577 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:29:19,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:19 WrapperNode [2025-01-10 02:29:19,578 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:29:19,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:29:19,579 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:29:19,579 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:29:19,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:19" (1/1) ... [2025-01-10 02:29:19,588 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:19" (1/1) ... [2025-01-10 02:29:19,604 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 94 [2025-01-10 02:29:19,604 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:29:19,605 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:29:19,605 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:29:19,605 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:29:19,611 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:19" (1/1) ... [2025-01-10 02:29:19,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:19" (1/1) ... [2025-01-10 02:29:19,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:19" (1/1) ... [2025-01-10 02:29:19,624 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 02:29:19,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:19" (1/1) ... [2025-01-10 02:29:19,626 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:19" (1/1) ... [2025-01-10 02:29:19,628 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:19" (1/1) ... [2025-01-10 02:29:19,632 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:19" (1/1) ... [2025-01-10 02:29:19,633 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:19" (1/1) ... [2025-01-10 02:29:19,634 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:19" (1/1) ... [2025-01-10 02:29:19,634 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:19" (1/1) ... [2025-01-10 02:29:19,638 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:29:19,639 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:29:19,639 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:29:19,639 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:29:19,640 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:19" (1/1) ... [2025-01-10 02:29:19,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:29:19,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:19,663 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 02:29:19,665 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 02:29:19,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:29:19,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:29:19,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:29:19,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:29:19,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 02:29:19,680 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 02:29:19,721 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:29:19,722 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:29:19,979 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2025-01-10 02:29:19,979 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:29:19,989 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:29:19,990 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 02:29:19,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:29:19 BoogieIcfgContainer [2025-01-10 02:29:19,990 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:29:19,991 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:29:19,991 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:29:19,994 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:29:19,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:29:19" (1/3) ... [2025-01-10 02:29:19,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e40a356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:29:19, skipping insertion in model container [2025-01-10 02:29:19,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:29:19" (2/3) ... [2025-01-10 02:29:19,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e40a356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:29:19, skipping insertion in model container [2025-01-10 02:29:19,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:29:19" (3/3) ... [2025-01-10 02:29:19,997 INFO L128 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_valuebound2.c [2025-01-10 02:29:20,007 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:29:20,009 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sqrt1-ll_valuebound2.c that has 2 procedures, 121 locations, 1 initial locations, 1 loop locations, and 50 error locations. [2025-01-10 02:29:20,049 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:29:20,058 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;@27b552c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:29:20,058 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-01-10 02:29:20,060 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 63 states have (on average 1.8571428571428572) internal successors, (117), 113 states have internal predecessors, (117), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 02:29:20,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 02:29:20,064 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:20,064 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 02:29:20,064 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:20,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:20,067 INFO L85 PathProgramCache]: Analyzing trace with hash 28693830, now seen corresponding path program 1 times [2025-01-10 02:29:20,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:20,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435440215] [2025-01-10 02:29:20,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:20,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:20,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 02:29:20,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 02:29:20,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:20,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:20,156 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 02:29:20,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:20,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435440215] [2025-01-10 02:29:20,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435440215] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:20,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:29:20,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:29:20,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341841510] [2025-01-10 02:29:20,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:20,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 02:29:20,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:20,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 02:29:20,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 02:29:20,177 INFO L87 Difference]: Start difference. First operand has 121 states, 63 states have (on average 1.8571428571428572) internal successors, (117), 113 states have internal predecessors, (117), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 02:29:20,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:20,202 INFO L93 Difference]: Finished difference Result 234 states and 259 transitions. [2025-01-10 02:29:20,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 02:29:20,203 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) Word has length 5 [2025-01-10 02:29:20,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:20,208 INFO L225 Difference]: With dead ends: 234 [2025-01-10 02:29:20,208 INFO L226 Difference]: Without dead ends: 110 [2025-01-10 02:29:20,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 02:29:20,214 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:20,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:29:20,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-10 02:29:20,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-01-10 02:29:20,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 58 states have (on average 1.793103448275862) internal successors, (104), 103 states have internal predecessors, (104), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 02:29:20,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2025-01-10 02:29:20,252 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 5 [2025-01-10 02:29:20,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:20,253 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2025-01-10 02:29:20,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 02:29:20,253 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2025-01-10 02:29:20,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 02:29:20,253 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:20,253 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 02:29:20,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:29:20,254 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:20,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:20,254 INFO L85 PathProgramCache]: Analyzing trace with hash 28695752, now seen corresponding path program 1 times [2025-01-10 02:29:20,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:20,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317381783] [2025-01-10 02:29:20,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:20,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:20,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 02:29:20,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 02:29:20,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:20,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:20,321 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 02:29:20,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:20,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317381783] [2025-01-10 02:29:20,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317381783] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:20,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:29:20,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:29:20,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219547694] [2025-01-10 02:29:20,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:20,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:29:20,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:20,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:29:20,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:29:20,322 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 02:29:20,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:20,460 INFO L93 Difference]: Finished difference Result 204 states and 213 transitions. [2025-01-10 02:29:20,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:29:20,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 5 [2025-01-10 02:29:20,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:20,462 INFO L225 Difference]: With dead ends: 204 [2025-01-10 02:29:20,462 INFO L226 Difference]: Without dead ends: 184 [2025-01-10 02:29:20,462 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 02:29:20,463 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 68 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:20,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 162 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:20,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-01-10 02:29:20,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 149. [2025-01-10 02:29:20,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 93 states have (on average 1.6236559139784945) internal successors, (151), 138 states have internal predecessors, (151), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 02:29:20,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2025-01-10 02:29:20,481 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 5 [2025-01-10 02:29:20,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:20,481 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2025-01-10 02:29:20,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 02:29:20,481 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2025-01-10 02:29:20,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 02:29:20,483 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:20,483 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:20,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:29:20,483 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:20,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:20,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1517972360, now seen corresponding path program 1 times [2025-01-10 02:29:20,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:20,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445798580] [2025-01-10 02:29:20,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:20,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:20,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 02:29:20,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 02:29:20,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:20,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:29:20,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2044589694] [2025-01-10 02:29:20,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:20,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:20,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:20,529 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 02:29:20,530 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 02:29:20,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 02:29:20,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 02:29:20,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:20,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:20,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:29:20,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:20,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:29:20,609 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:29:20,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:20,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445798580] [2025-01-10 02:29:20,610 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:29:20,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044589694] [2025-01-10 02:29:20,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044589694] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:20,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:29:20,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:29:20,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158809136] [2025-01-10 02:29:20,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:20,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:29:20,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:20,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:29:20,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:29:20,611 INFO L87 Difference]: Start difference. First operand 149 states and 169 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:29:20,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:20,702 INFO L93 Difference]: Finished difference Result 176 states and 197 transitions. [2025-01-10 02:29:20,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:29:20,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-01-10 02:29:20,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:20,703 INFO L225 Difference]: With dead ends: 176 [2025-01-10 02:29:20,703 INFO L226 Difference]: Without dead ends: 168 [2025-01-10 02:29:20,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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 02:29:20,704 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 41 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:20,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 148 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:20,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-01-10 02:29:20,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 160. [2025-01-10 02:29:20,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 103 states have (on average 1.5728155339805825) internal successors, (162), 148 states have internal predecessors, (162), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 02:29:20,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 182 transitions. [2025-01-10 02:29:20,712 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 182 transitions. Word has length 26 [2025-01-10 02:29:20,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:20,712 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 182 transitions. [2025-01-10 02:29:20,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:29:20,712 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 182 transitions. [2025-01-10 02:29:20,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 02:29:20,712 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:20,712 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:20,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 02:29:20,913 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 02:29:20,913 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:20,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:20,914 INFO L85 PathProgramCache]: Analyzing trace with hash -187497026, now seen corresponding path program 1 times [2025-01-10 02:29:20,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:20,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293246049] [2025-01-10 02:29:20,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:20,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:20,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 02:29:20,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 02:29:20,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:20,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:20,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:29:20,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:20,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293246049] [2025-01-10 02:29:20,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293246049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:20,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:29:20,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:29:20,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433000794] [2025-01-10 02:29:20,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:20,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:29:20,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:20,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:29:20,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:29:20,993 INFO L87 Difference]: Start difference. First operand 160 states and 182 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:29:21,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:21,069 INFO L93 Difference]: Finished difference Result 176 states and 193 transitions. [2025-01-10 02:29:21,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:29:21,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2025-01-10 02:29:21,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:21,071 INFO L225 Difference]: With dead ends: 176 [2025-01-10 02:29:21,071 INFO L226 Difference]: Without dead ends: 166 [2025-01-10 02:29:21,071 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 02:29:21,072 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 38 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:21,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 162 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:21,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-01-10 02:29:21,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2025-01-10 02:29:21,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 106 states have (on average 1.490566037735849) internal successors, (158), 151 states have internal predecessors, (158), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 02:29:21,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 178 transitions. [2025-01-10 02:29:21,085 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 178 transitions. Word has length 27 [2025-01-10 02:29:21,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:21,085 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 178 transitions. [2025-01-10 02:29:21,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:29:21,085 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 178 transitions. [2025-01-10 02:29:21,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 02:29:21,085 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:21,086 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-10 02:29:21,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 02:29:21,086 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:21,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:21,086 INFO L85 PathProgramCache]: Analyzing trace with hash 2028622092, now seen corresponding path program 1 times [2025-01-10 02:29:21,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:21,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802631874] [2025-01-10 02:29:21,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:21,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:21,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 02:29:21,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 02:29:21,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:21,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:21,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:29:21,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:21,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802631874] [2025-01-10 02:29:21,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802631874] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:21,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:29:21,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:29:21,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053570341] [2025-01-10 02:29:21,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:21,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:29:21,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:21,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:29:21,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:29:21,176 INFO L87 Difference]: Start difference. First operand 163 states and 178 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:29:21,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:21,299 INFO L93 Difference]: Finished difference Result 168 states and 183 transitions. [2025-01-10 02:29:21,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:29:21,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-01-10 02:29:21,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:21,301 INFO L225 Difference]: With dead ends: 168 [2025-01-10 02:29:21,301 INFO L226 Difference]: Without dead ends: 166 [2025-01-10 02:29:21,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:29:21,301 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 46 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:21,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 211 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:21,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-01-10 02:29:21,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2025-01-10 02:29:21,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 106 states have (on average 1.471698113207547) internal successors, (156), 151 states have internal predecessors, (156), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 02:29:21,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 176 transitions. [2025-01-10 02:29:21,316 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 176 transitions. Word has length 30 [2025-01-10 02:29:21,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:21,316 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 176 transitions. [2025-01-10 02:29:21,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:29:21,317 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 176 transitions. [2025-01-10 02:29:21,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-10 02:29:21,318 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:21,318 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-10 02:29:21,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 02:29:21,318 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:21,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:21,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1780979344, now seen corresponding path program 1 times [2025-01-10 02:29:21,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:21,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288937784] [2025-01-10 02:29:21,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:21,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:21,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 02:29:21,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 02:29:21,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:21,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:21,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:29:21,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:21,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288937784] [2025-01-10 02:29:21,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288937784] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:21,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:29:21,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:29:21,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842399079] [2025-01-10 02:29:21,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:21,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:29:21,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:21,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:29:21,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:29:21,429 INFO L87 Difference]: Start difference. First operand 163 states and 176 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:29:21,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:21,514 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2025-01-10 02:29:21,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:29:21,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2025-01-10 02:29:21,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:21,516 INFO L225 Difference]: With dead ends: 168 [2025-01-10 02:29:21,516 INFO L226 Difference]: Without dead ends: 140 [2025-01-10 02:29:21,516 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 02:29:21,517 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 29 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:21,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 144 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:21,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-01-10 02:29:21,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-01-10 02:29:21,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 85 states have (on average 1.5411764705882354) internal successors, (131), 130 states have internal predecessors, (131), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:29:21,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 147 transitions. [2025-01-10 02:29:21,525 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 147 transitions. Word has length 34 [2025-01-10 02:29:21,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:21,525 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 147 transitions. [2025-01-10 02:29:21,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:29:21,525 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 147 transitions. [2025-01-10 02:29:21,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 02:29:21,526 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:21,526 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:21,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 02:29:21,526 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:21,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:21,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1775119788, now seen corresponding path program 1 times [2025-01-10 02:29:21,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:21,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553592119] [2025-01-10 02:29:21,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:21,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:21,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 02:29:21,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 02:29:21,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:21,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:21,617 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:29:21,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:21,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553592119] [2025-01-10 02:29:21,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553592119] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:21,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:29:21,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:29:21,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699031499] [2025-01-10 02:29:21,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:21,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:29:21,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:21,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:29:21,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:29:21,618 INFO L87 Difference]: Start difference. First operand 140 states and 147 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 02:29:21,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:21,710 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2025-01-10 02:29:21,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:29:21,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-01-10 02:29:21,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:21,712 INFO L225 Difference]: With dead ends: 143 [2025-01-10 02:29:21,712 INFO L226 Difference]: Without dead ends: 142 [2025-01-10 02:29:21,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:29:21,713 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 1 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:21,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 207 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:21,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-01-10 02:29:21,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2025-01-10 02:29:21,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 86 states have (on average 1.5348837209302326) internal successors, (132), 131 states have internal predecessors, (132), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:29:21,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 148 transitions. [2025-01-10 02:29:21,721 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 148 transitions. Word has length 47 [2025-01-10 02:29:21,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:21,721 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 148 transitions. [2025-01-10 02:29:21,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 02:29:21,721 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 148 transitions. [2025-01-10 02:29:21,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 02:29:21,722 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:21,722 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:21,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 02:29:21,722 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:21,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:21,722 INFO L85 PathProgramCache]: Analyzing trace with hash 805861526, now seen corresponding path program 1 times [2025-01-10 02:29:21,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:21,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253228905] [2025-01-10 02:29:21,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:21,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:21,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 02:29:21,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 02:29:21,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:21,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:21,804 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:29:21,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:21,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253228905] [2025-01-10 02:29:21,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253228905] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:21,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:29:21,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:29:21,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96750743] [2025-01-10 02:29:21,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:21,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:29:21,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:21,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:29:21,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:29:21,805 INFO L87 Difference]: Start difference. First operand 141 states and 148 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 02:29:21,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:21,881 INFO L93 Difference]: Finished difference Result 143 states and 150 transitions. [2025-01-10 02:29:21,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:29:21,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-01-10 02:29:21,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:21,882 INFO L225 Difference]: With dead ends: 143 [2025-01-10 02:29:21,882 INFO L226 Difference]: Without dead ends: 142 [2025-01-10 02:29:21,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:29:21,882 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:21,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:21,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-01-10 02:29:21,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-01-10 02:29:21,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 87 states have (on average 1.528735632183908) internal successors, (133), 132 states have internal predecessors, (133), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:29:21,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 149 transitions. [2025-01-10 02:29:21,887 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 149 transitions. Word has length 48 [2025-01-10 02:29:21,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:21,887 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 149 transitions. [2025-01-10 02:29:21,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 02:29:21,887 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 149 transitions. [2025-01-10 02:29:21,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-10 02:29:21,888 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:21,888 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:21,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 02:29:21,888 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:21,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:21,888 INFO L85 PathProgramCache]: Analyzing trace with hash -788096426, now seen corresponding path program 1 times [2025-01-10 02:29:21,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:21,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786857370] [2025-01-10 02:29:21,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:21,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:21,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 02:29:21,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 02:29:21,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:21,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:21,935 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:29:21,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:21,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786857370] [2025-01-10 02:29:21,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786857370] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:21,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101994033] [2025-01-10 02:29:21,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:21,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:21,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:21,937 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 02:29:21,939 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 02:29:21,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 02:29:21,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 02:29:21,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:21,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:21,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:29:21,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:22,022 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:29:22,023 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:29:22,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101994033] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:22,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:29:22,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 02:29:22,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703643325] [2025-01-10 02:29:22,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:22,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:29:22,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:22,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:29:22,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:29:22,023 INFO L87 Difference]: Start difference. First operand 142 states and 149 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 02:29:22,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:22,081 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2025-01-10 02:29:22,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:29:22,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2025-01-10 02:29:22,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:22,082 INFO L225 Difference]: With dead ends: 142 [2025-01-10 02:29:22,082 INFO L226 Difference]: Without dead ends: 133 [2025-01-10 02:29:22,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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 02:29:22,083 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 120 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:22,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 117 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:22,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-01-10 02:29:22,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-01-10 02:29:22,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 123 states have internal predecessors, (124), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:29:22,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2025-01-10 02:29:22,086 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 49 [2025-01-10 02:29:22,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:22,087 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2025-01-10 02:29:22,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 02:29:22,087 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2025-01-10 02:29:22,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 02:29:22,087 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:22,087 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 02:29:22,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 02:29:22,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:22,291 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:22,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:22,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1338814616, now seen corresponding path program 1 times [2025-01-10 02:29:22,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:22,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278538462] [2025-01-10 02:29:22,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:22,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:22,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 02:29:22,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 02:29:22,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:22,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:22,335 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:29:22,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:22,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278538462] [2025-01-10 02:29:22,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278538462] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:22,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186080976] [2025-01-10 02:29:22,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:22,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:22,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:22,337 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 02:29:22,339 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 02:29:22,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 02:29:22,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 02:29:22,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:22,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:22,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:29:22,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:22,424 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:29:22,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:22,496 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:29:22,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186080976] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:22,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:22,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 02:29:22,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301233871] [2025-01-10 02:29:22,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:22,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:29:22,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:22,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:29:22,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:29:22,498 INFO L87 Difference]: Start difference. First operand 133 states and 140 transitions. Second operand has 7 states, 6 states have (on average 16.0) internal successors, (96), 7 states have internal predecessors, (96), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-10 02:29:22,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:22,600 INFO L93 Difference]: Finished difference Result 226 states and 255 transitions. [2025-01-10 02:29:22,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:29:22,601 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 16.0) internal successors, (96), 7 states have internal predecessors, (96), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 50 [2025-01-10 02:29:22,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:22,602 INFO L225 Difference]: With dead ends: 226 [2025-01-10 02:29:22,602 INFO L226 Difference]: Without dead ends: 217 [2025-01-10 02:29:22,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:29:22,603 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 180 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:22,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 206 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:22,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-01-10 02:29:22,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 124. [2025-01-10 02:29:22,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 114 states have internal predecessors, (115), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:29:22,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2025-01-10 02:29:22,608 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 50 [2025-01-10 02:29:22,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:22,608 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2025-01-10 02:29:22,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 16.0) internal successors, (96), 7 states have internal predecessors, (96), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-10 02:29:22,608 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2025-01-10 02:29:22,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-10 02:29:22,609 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:22,609 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:22,615 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 02:29:22,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:22,813 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:22,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:22,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1590448804, now seen corresponding path program 1 times [2025-01-10 02:29:22,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:22,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061784312] [2025-01-10 02:29:22,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:22,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:22,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 02:29:22,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 02:29:22,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:22,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:29:22,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1819992231] [2025-01-10 02:29:22,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:22,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:22,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:22,835 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 02:29:22,836 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 02:29:22,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-10 02:29:22,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-10 02:29:22,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:22,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:22,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:29:22,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:22,933 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:29:22,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:23,032 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:29:23,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:23,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061784312] [2025-01-10 02:29:23,032 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:29:23,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819992231] [2025-01-10 02:29:23,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819992231] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:23,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:29:23,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-01-10 02:29:23,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932544467] [2025-01-10 02:29:23,032 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:23,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:29:23,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:23,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:29:23,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:29:23,033 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand has 6 states, 5 states have (on average 17.2) internal successors, (86), 6 states have internal predecessors, (86), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-10 02:29:23,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:23,177 INFO L93 Difference]: Finished difference Result 300 states and 322 transitions. [2025-01-10 02:29:23,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:29:23,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.2) internal successors, (86), 6 states have internal predecessors, (86), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 63 [2025-01-10 02:29:23,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:23,178 INFO L225 Difference]: With dead ends: 300 [2025-01-10 02:29:23,178 INFO L226 Difference]: Without dead ends: 298 [2025-01-10 02:29:23,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:29:23,179 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 237 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:23,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 305 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:23,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-01-10 02:29:23,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 198. [2025-01-10 02:29:23,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 155 states have (on average 1.3806451612903226) internal successors, (214), 181 states have internal predecessors, (214), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-10 02:29:23,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 244 transitions. [2025-01-10 02:29:23,187 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 244 transitions. Word has length 63 [2025-01-10 02:29:23,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:23,187 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 244 transitions. [2025-01-10 02:29:23,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.2) internal successors, (86), 6 states have internal predecessors, (86), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-01-10 02:29:23,187 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 244 transitions. [2025-01-10 02:29:23,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-10 02:29:23,188 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:23,188 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:23,194 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 02:29:23,391 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,SelfDestructingSolverStorable10 [2025-01-10 02:29:23,392 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:23,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:23,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1776332102, now seen corresponding path program 1 times [2025-01-10 02:29:23,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:23,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202372329] [2025-01-10 02:29:23,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:23,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:23,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-10 02:29:23,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-10 02:29:23,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:23,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:29:23,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2029084119] [2025-01-10 02:29:23,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:23,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:23,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:23,405 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 02:29:23,407 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 02:29:23,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-10 02:29:23,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-10 02:29:23,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:23,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:23,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:29:23,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:23,493 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 02:29:23,493 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:23,595 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 02:29:23,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:23,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202372329] [2025-01-10 02:29:23,595 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:29:23,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029084119] [2025-01-10 02:29:23,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029084119] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:23,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:29:23,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-01-10 02:29:23,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252484345] [2025-01-10 02:29:23,595 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:23,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:29:23,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:23,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:29:23,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:29:23,596 INFO L87 Difference]: Start difference. First operand 198 states and 244 transitions. Second operand has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-01-10 02:29:23,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:23,771 INFO L93 Difference]: Finished difference Result 258 states and 321 transitions. [2025-01-10 02:29:23,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:29:23,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 70 [2025-01-10 02:29:23,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:23,773 INFO L225 Difference]: With dead ends: 258 [2025-01-10 02:29:23,773 INFO L226 Difference]: Without dead ends: 250 [2025-01-10 02:29:23,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:29:23,773 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 218 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:23,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 208 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:29:23,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-01-10 02:29:23,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 194. [2025-01-10 02:29:23,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 157 states have (on average 1.267515923566879) internal successors, (199), 176 states have internal predecessors, (199), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 02:29:23,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 231 transitions. [2025-01-10 02:29:23,783 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 231 transitions. Word has length 70 [2025-01-10 02:29:23,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:23,783 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 231 transitions. [2025-01-10 02:29:23,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.0) internal successors, (90), 6 states have internal predecessors, (90), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-01-10 02:29:23,783 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 231 transitions. [2025-01-10 02:29:23,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-10 02:29:23,783 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:23,784 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:23,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 02:29:23,984 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,SelfDestructingSolverStorable11 [2025-01-10 02:29:23,984 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:23,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:23,985 INFO L85 PathProgramCache]: Analyzing trace with hash 768279756, now seen corresponding path program 1 times [2025-01-10 02:29:23,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:23,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492768095] [2025-01-10 02:29:23,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:23,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:23,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-10 02:29:23,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-10 02:29:23,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:23,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:24,073 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 02:29:24,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:24,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492768095] [2025-01-10 02:29:24,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492768095] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:24,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652479525] [2025-01-10 02:29:24,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:24,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:24,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:24,075 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 02:29:24,076 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 02:29:24,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-10 02:29:24,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-10 02:29:24,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:24,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:24,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:29:24,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:24,241 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 02:29:24,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:24,325 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 02:29:24,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652479525] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:24,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:24,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 02:29:24,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469452793] [2025-01-10 02:29:24,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:24,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 02:29:24,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:24,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 02:29:24,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:29:24,326 INFO L87 Difference]: Start difference. First operand 194 states and 231 transitions. Second operand has 10 states, 9 states have (on average 13.555555555555555) internal successors, (122), 10 states have internal predecessors, (122), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-10 02:29:24,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:24,482 INFO L93 Difference]: Finished difference Result 194 states and 231 transitions. [2025-01-10 02:29:24,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:29:24,482 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 13.555555555555555) internal successors, (122), 10 states have internal predecessors, (122), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 71 [2025-01-10 02:29:24,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:24,483 INFO L225 Difference]: With dead ends: 194 [2025-01-10 02:29:24,483 INFO L226 Difference]: Without dead ends: 191 [2025-01-10 02:29:24,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-01-10 02:29:24,484 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 159 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:24,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 192 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:24,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-01-10 02:29:24,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-01-10 02:29:24,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 157 states have (on average 1.2229299363057324) internal successors, (192), 173 states have internal predecessors, (192), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 02:29:24,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 224 transitions. [2025-01-10 02:29:24,494 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 224 transitions. Word has length 71 [2025-01-10 02:29:24,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:24,494 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 224 transitions. [2025-01-10 02:29:24,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 13.555555555555555) internal successors, (122), 10 states have internal predecessors, (122), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-10 02:29:24,494 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 224 transitions. [2025-01-10 02:29:24,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-10 02:29:24,495 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:24,495 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:24,501 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 02:29:24,695 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,SelfDestructingSolverStorable12 [2025-01-10 02:29:24,696 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:24,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:24,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1953131268, now seen corresponding path program 1 times [2025-01-10 02:29:24,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:24,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093625612] [2025-01-10 02:29:24,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:24,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:24,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-10 02:29:24,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 02:29:24,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:24,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:24,766 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 02:29:24,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:24,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093625612] [2025-01-10 02:29:24,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093625612] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:24,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947459475] [2025-01-10 02:29:24,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:24,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:24,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:24,768 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 02:29:24,769 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 02:29:24,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-10 02:29:24,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 02:29:24,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:24,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:24,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:29:24,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:24,923 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 02:29:24,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:25,005 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 02:29:25,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947459475] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:25,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:25,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 02:29:25,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046130573] [2025-01-10 02:29:25,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:25,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 02:29:25,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:25,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 02:29:25,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:29:25,008 INFO L87 Difference]: Start difference. First operand 191 states and 224 transitions. Second operand has 10 states, 9 states have (on average 13.777777777777779) internal successors, (124), 10 states have internal predecessors, (124), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-10 02:29:25,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:25,190 INFO L93 Difference]: Finished difference Result 217 states and 256 transitions. [2025-01-10 02:29:25,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:29:25,191 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 13.777777777777779) internal successors, (124), 10 states have internal predecessors, (124), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 72 [2025-01-10 02:29:25,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:25,192 INFO L225 Difference]: With dead ends: 217 [2025-01-10 02:29:25,192 INFO L226 Difference]: Without dead ends: 208 [2025-01-10 02:29:25,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=72, Unknown=0, NotChecked=0, Total=132 [2025-01-10 02:29:25,193 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 96 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:25,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 222 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:29:25,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-01-10 02:29:25,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 184. [2025-01-10 02:29:25,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 157 states have (on average 1.1210191082802548) internal successors, (176), 166 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 02:29:25,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 208 transitions. [2025-01-10 02:29:25,202 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 208 transitions. Word has length 72 [2025-01-10 02:29:25,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:25,202 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 208 transitions. [2025-01-10 02:29:25,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 13.777777777777779) internal successors, (124), 10 states have internal predecessors, (124), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-10 02:29:25,203 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 208 transitions. [2025-01-10 02:29:25,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-10 02:29:25,205 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:25,205 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:25,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 02:29:25,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:25,406 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:25,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:25,406 INFO L85 PathProgramCache]: Analyzing trace with hash -58437826, now seen corresponding path program 1 times [2025-01-10 02:29:25,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:25,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461385878] [2025-01-10 02:29:25,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:25,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:25,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-10 02:29:25,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-10 02:29:25,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:25,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:25,487 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 02:29:25,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:25,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461385878] [2025-01-10 02:29:25,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461385878] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:25,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275484180] [2025-01-10 02:29:25,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:25,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:25,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:25,490 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 02:29:25,490 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 02:29:25,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-10 02:29:25,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-10 02:29:25,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:25,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:25,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 02:29:25,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:25,677 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 02:29:25,677 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:29:25,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275484180] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:29:25,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:29:25,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-01-10 02:29:25,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519508793] [2025-01-10 02:29:25,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:29:25,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:29:25,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:25,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:29:25,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:29:25,679 INFO L87 Difference]: Start difference. First operand 184 states and 208 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 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 02:29:25,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:25,756 INFO L93 Difference]: Finished difference Result 184 states and 208 transitions. [2025-01-10 02:29:25,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:29:25,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 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 74 [2025-01-10 02:29:25,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:25,757 INFO L225 Difference]: With dead ends: 184 [2025-01-10 02:29:25,757 INFO L226 Difference]: Without dead ends: 154 [2025-01-10 02:29:25,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:29:25,758 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 68 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:25,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 107 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:25,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-01-10 02:29:25,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-01-10 02:29:25,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 135 states have (on average 1.037037037037037) internal successors, (140), 138 states have internal predecessors, (140), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-10 02:29:25,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 168 transitions. [2025-01-10 02:29:25,764 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 168 transitions. Word has length 74 [2025-01-10 02:29:25,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:25,764 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 168 transitions. [2025-01-10 02:29:25,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 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 02:29:25,764 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions. [2025-01-10 02:29:25,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-10 02:29:25,765 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:25,765 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-01-10 02:29:25,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 02:29:25,966 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,SelfDestructingSolverStorable14 [2025-01-10 02:29:25,966 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:25,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:25,966 INFO L85 PathProgramCache]: Analyzing trace with hash -591437574, now seen corresponding path program 1 times [2025-01-10 02:29:25,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:25,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078739076] [2025-01-10 02:29:25,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:25,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:25,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-10 02:29:25,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-10 02:29:25,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:25,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:26,107 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-10 02:29:26,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:26,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078739076] [2025-01-10 02:29:26,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078739076] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:26,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861961395] [2025-01-10 02:29:26,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:29:26,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:26,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:26,110 INFO L229 MonitoredProcess]: Starting monitored process 10 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 02:29:26,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 02:29:26,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-10 02:29:26,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-10 02:29:26,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:29:26,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:26,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 02:29:26,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:26,430 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-10 02:29:26,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:26,606 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-10 02:29:26,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861961395] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:26,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:26,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-01-10 02:29:26,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517701119] [2025-01-10 02:29:26,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:26,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-10 02:29:26,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:26,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-10 02:29:26,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2025-01-10 02:29:26,608 INFO L87 Difference]: Start difference. First operand 154 states and 168 transitions. Second operand has 20 states, 19 states have (on average 14.210526315789474) internal successors, (270), 20 states have internal predecessors, (270), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2025-01-10 02:29:26,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:26,859 INFO L93 Difference]: Finished difference Result 239 states and 267 transitions. [2025-01-10 02:29:26,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 02:29:26,860 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 14.210526315789474) internal successors, (270), 20 states have internal predecessors, (270), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) Word has length 136 [2025-01-10 02:29:26,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:26,861 INFO L225 Difference]: With dead ends: 239 [2025-01-10 02:29:26,861 INFO L226 Difference]: Without dead ends: 238 [2025-01-10 02:29:26,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=248, Invalid=402, Unknown=0, NotChecked=0, Total=650 [2025-01-10 02:29:26,862 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:26,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 184 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:29:26,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-01-10 02:29:26,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2025-01-10 02:29:26,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 210 states have (on average 1.0523809523809524) internal successors, (221), 213 states have internal predecessors, (221), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-10 02:29:26,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 263 transitions. [2025-01-10 02:29:26,874 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 263 transitions. Word has length 136 [2025-01-10 02:29:26,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:26,874 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 263 transitions. [2025-01-10 02:29:26,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 14.210526315789474) internal successors, (270), 20 states have internal predecessors, (270), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2025-01-10 02:29:26,875 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 263 transitions. [2025-01-10 02:29:26,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-10 02:29:26,877 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:26,877 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2025-01-10 02:29:26,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 02:29:27,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:27,079 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:27,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:27,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1592955232, now seen corresponding path program 2 times [2025-01-10 02:29:27,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:27,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548218866] [2025-01-10 02:29:27,079 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:29:27,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:27,085 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 160 statements into 2 equivalence classes. [2025-01-10 02:29:27,093 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 160 of 160 statements. [2025-01-10 02:29:27,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:29:27,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:27,232 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-10 02:29:27,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:27,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548218866] [2025-01-10 02:29:27,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548218866] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:27,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425402066] [2025-01-10 02:29:27,232 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:29:27,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:27,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:27,234 INFO L229 MonitoredProcess]: Starting monitored process 11 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 02:29:27,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 02:29:27,259 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 160 statements into 2 equivalence classes. [2025-01-10 02:29:27,283 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 160 of 160 statements. [2025-01-10 02:29:27,283 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:29:27,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:27,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 02:29:27,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:27,578 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-10 02:29:27,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:27,780 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-10 02:29:27,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425402066] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:27,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:27,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-01-10 02:29:27,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363895646] [2025-01-10 02:29:27,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:27,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 02:29:27,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:27,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 02:29:27,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=297, Unknown=0, NotChecked=0, Total=462 [2025-01-10 02:29:27,782 INFO L87 Difference]: Start difference. First operand 236 states and 263 transitions. Second operand has 22 states, 21 states have (on average 14.19047619047619) internal successors, (298), 22 states have internal predecessors, (298), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-01-10 02:29:28,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:28,101 INFO L93 Difference]: Finished difference Result 257 states and 284 transitions. [2025-01-10 02:29:28,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 02:29:28,102 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 14.19047619047619) internal successors, (298), 22 states have internal predecessors, (298), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) Word has length 160 [2025-01-10 02:29:28,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:28,103 INFO L225 Difference]: With dead ends: 257 [2025-01-10 02:29:28,103 INFO L226 Difference]: Without dead ends: 256 [2025-01-10 02:29:28,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=319, Invalid=551, Unknown=0, NotChecked=0, Total=870 [2025-01-10 02:29:28,104 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 75 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:28,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 264 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:29:28,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-01-10 02:29:28,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 252. [2025-01-10 02:29:28,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 224 states have (on average 1.0446428571428572) internal successors, (234), 227 states have internal predecessors, (234), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-10 02:29:28,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 280 transitions. [2025-01-10 02:29:28,114 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 280 transitions. Word has length 160 [2025-01-10 02:29:28,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:28,114 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 280 transitions. [2025-01-10 02:29:28,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 14.19047619047619) internal successors, (298), 22 states have internal predecessors, (298), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-01-10 02:29:28,115 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 280 transitions. [2025-01-10 02:29:28,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-10 02:29:28,116 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:29:28,116 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-01-10 02:29:28,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 02:29:28,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 02:29:28,316 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-01-10 02:29:28,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:29:28,317 INFO L85 PathProgramCache]: Analyzing trace with hash 443673550, now seen corresponding path program 2 times [2025-01-10 02:29:28,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:29:28,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262640625] [2025-01-10 02:29:28,317 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:29:28,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:29:28,322 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 195 statements into 2 equivalence classes. [2025-01-10 02:29:28,336 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 195 of 195 statements. [2025-01-10 02:29:28,336 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:29:28,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:28,604 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 62 proven. 174 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-10 02:29:28,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:29:28,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262640625] [2025-01-10 02:29:28,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262640625] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:29:28,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121265046] [2025-01-10 02:29:28,604 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:29:28,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:29:28,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:29:28,606 INFO L229 MonitoredProcess]: Starting monitored process 12 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 02:29:28,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 02:29:28,635 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 195 statements into 2 equivalence classes. [2025-01-10 02:29:28,661 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 195 of 195 statements. [2025-01-10 02:29:28,661 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:29:28,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:29:28,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 02:29:28,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:29:29,347 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 206 proven. 78 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-10 02:29:29,348 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:29:29,617 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 62 proven. 174 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-10 02:29:29,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121265046] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:29:29,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:29:29,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2025-01-10 02:29:29,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967156299] [2025-01-10 02:29:29,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:29:29,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-10 02:29:29,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:29:29,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-10 02:29:29,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=623, Unknown=0, NotChecked=0, Total=812 [2025-01-10 02:29:29,620 INFO L87 Difference]: Start difference. First operand 252 states and 280 transitions. Second operand has 29 states, 29 states have (on average 12.482758620689655) internal successors, (362), 29 states have internal predecessors, (362), 13 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 13 states have call predecessors, (38), 13 states have call successors, (38) [2025-01-10 02:29:29,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:29:29,783 INFO L93 Difference]: Finished difference Result 256 states and 283 transitions. [2025-01-10 02:29:29,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:29:29,784 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 12.482758620689655) internal successors, (362), 29 states have internal predecessors, (362), 13 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 13 states have call predecessors, (38), 13 states have call successors, (38) Word has length 195 [2025-01-10 02:29:29,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:29:29,784 INFO L225 Difference]: With dead ends: 256 [2025-01-10 02:29:29,784 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 02:29:29,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=219, Invalid=711, Unknown=0, NotChecked=0, Total=930 [2025-01-10 02:29:29,786 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:29:29,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 318 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:29:29,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 02:29:29,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 02:29:29,786 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 02:29:29,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 02:29:29,786 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 195 [2025-01-10 02:29:29,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:29:29,786 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 02:29:29,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 12.482758620689655) internal successors, (362), 29 states have internal predecessors, (362), 13 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 13 states have call predecessors, (38), 13 states have call successors, (38) [2025-01-10 02:29:29,786 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 02:29:29,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 02:29:29,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 50 remaining) [2025-01-10 02:29:29,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 50 remaining) [2025-01-10 02:29:29,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 50 remaining) [2025-01-10 02:29:29,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 50 remaining) [2025-01-10 02:29:29,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 50 remaining) [2025-01-10 02:29:29,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 50 remaining) [2025-01-10 02:29:29,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 50 remaining) [2025-01-10 02:29:29,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 50 remaining) [2025-01-10 02:29:29,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 50 remaining) [2025-01-10 02:29:29,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 50 remaining) [2025-01-10 02:29:29,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 50 remaining) [2025-01-10 02:29:29,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 50 remaining) [2025-01-10 02:29:29,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 50 remaining) [2025-01-10 02:29:29,790 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 50 remaining) [2025-01-10 02:29:29,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 50 remaining) [2025-01-10 02:29:29,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 50 remaining) [2025-01-10 02:29:29,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 50 remaining) [2025-01-10 02:29:29,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 50 remaining) [2025-01-10 02:29:29,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 50 remaining) [2025-01-10 02:29:29,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 50 remaining) [2025-01-10 02:29:29,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 50 remaining) [2025-01-10 02:29:29,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 50 remaining) [2025-01-10 02:29:29,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 50 remaining) [2025-01-10 02:29:29,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 50 remaining) [2025-01-10 02:29:29,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 50 remaining) [2025-01-10 02:29:29,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 50 remaining) [2025-01-10 02:29:29,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 50 remaining) [2025-01-10 02:29:29,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 50 remaining) [2025-01-10 02:29:29,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 50 remaining) [2025-01-10 02:29:29,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 50 remaining) [2025-01-10 02:29:29,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 50 remaining) [2025-01-10 02:29:29,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 50 remaining) [2025-01-10 02:29:29,791 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 50 remaining) [2025-01-10 02:29:29,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 50 remaining) [2025-01-10 02:29:29,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 50 remaining) [2025-01-10 02:29:29,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 50 remaining) [2025-01-10 02:29:29,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 50 remaining) [2025-01-10 02:29:29,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 50 remaining) [2025-01-10 02:29:29,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 50 remaining) [2025-01-10 02:29:29,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 50 remaining) [2025-01-10 02:29:29,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 50 remaining) [2025-01-10 02:29:29,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 50 remaining) [2025-01-10 02:29:29,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 50 remaining) [2025-01-10 02:29:29,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 50 remaining) [2025-01-10 02:29:29,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 50 remaining) [2025-01-10 02:29:29,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 50 remaining) [2025-01-10 02:29:29,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 50 remaining) [2025-01-10 02:29:29,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 50 remaining) [2025-01-10 02:29:29,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 50 remaining) [2025-01-10 02:29:29,792 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 50 remaining) [2025-01-10 02:29:29,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 02:29:29,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 02:29:29,995 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:29:29,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 02:29:30,209 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 02:29:30,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:29:30 BoogieIcfgContainer [2025-01-10 02:29:30,222 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 02:29:30,222 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 02:29:30,222 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 02:29:30,223 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 02:29:30,223 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:29:19" (3/4) ... [2025-01-10 02:29:30,224 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 02:29:30,228 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-01-10 02:29:30,231 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-10 02:29:30,232 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 02:29:30,232 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-10 02:29:30,232 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 02:29:30,291 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 02:29:30,291 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 02:29:30,291 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 02:29:30,292 INFO L158 Benchmark]: Toolchain (without parser) took 10885.79ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 122.3MB in the beginning and 113.9MB in the end (delta: 8.4MB). Peak memory consumption was 85.1MB. Max. memory is 16.1GB. [2025-01-10 02:29:30,293 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:29:30,293 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.73ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 111.2MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:29:30,293 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.50ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 109.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:29:30,293 INFO L158 Benchmark]: Boogie Preprocessor took 33.64ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 108.3MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:29:30,293 INFO L158 Benchmark]: RCFGBuilder took 350.81ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 90.7MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 02:29:30,293 INFO L158 Benchmark]: TraceAbstraction took 10230.95ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 90.2MB in the beginning and 122.1MB in the end (delta: -31.9MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. [2025-01-10 02:29:30,294 INFO L158 Benchmark]: Witness Printer took 68.63ms. Allocated memory is still 243.3MB. Free memory was 122.1MB in the beginning and 113.9MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:29:30,294 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.20ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 170.73ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 111.2MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.50ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 109.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.64ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 108.3MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 350.81ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 90.7MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10230.95ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 90.2MB in the beginning and 122.1MB in the end (delta: -31.9MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. * Witness Printer took 68.63ms. Allocated memory is still 243.3MB. Free memory was 122.1MB in the beginning and 113.9MB in the end (delta: 8.2MB). 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: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 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: 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: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 121 locations, 50 error locations. Started 1 CEGAR loops. OverallTime: 10.0s, OverallIterations: 18, TraceHistogramMax: 13, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1434 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1381 mSDsluCounter, 3432 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2113 mSDsCounter, 184 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2510 IncrementalHoareTripleChecker+Invalid, 2694 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 184 mSolverCounterUnsat, 1319 mSDtfsCounter, 2510 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1848 GetRequests, 1712 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=252occurred in iteration=17, InterpolantAutomatonStates: 103, 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, 18 MinimizatonAttempts, 329 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 2128 NumberOfCodeBlocks, 2128 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2752 ConstructedInterpolants, 0 QuantifiedInterpolants, 13009 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1656 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 34 InterpolantComputations, 10 PerfectInterpolantSequences, 2877/4191 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 50 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((n <= 2) && (3 == t)) && (a == 1)) && (s == 4)) && (0 <= n)) || (((((n <= 2) && (t == 1)) && (a == 0)) && (0 <= n)) && (s == 1))) RESULT: Ultimate proved your program to be correct! [2025-01-10 02:29:30,321 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