./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d 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/ps6-ll_valuebound100.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 b8588da8d66d82eb7aa3eaf3ef7c4d24b2b275bf9c1acdf38a110c8bc6eba3b7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 09:55:51,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 09:55:51,548 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 09:55:51,553 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 09:55:51,553 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 09:55:51,572 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 09:55:51,573 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 09:55:51,573 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 09:55:51,574 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 09:55:51,574 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 09:55:51,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 09:55:51,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 09:55:51,575 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 09:55:51,575 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 09:55:51,576 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 09:55:51,576 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 09:55:51,576 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 09:55:51,576 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 09:55:51,576 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 09:55:51,576 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 09:55:51,577 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 09:55:51,577 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 09:55:51,577 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 09:55:51,577 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 09:55:51,577 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 09:55:51,577 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 09:55:51,577 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 09:55:51,577 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 09:55:51,577 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 09:55:51,577 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 09:55:51,578 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 09:55:51,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 09:55:51,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 09:55:51,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 09:55:51,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:55:51,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 09:55:51,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 09:55:51,579 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 09:55:51,579 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 09:55:51,579 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 09:55:51,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 09:55:51,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 09:55:51,579 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 09:55:51,579 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 09:55:51,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 09:55:51,580 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 -> b8588da8d66d82eb7aa3eaf3ef7c4d24b2b275bf9c1acdf38a110c8bc6eba3b7 [2025-02-08 09:55:51,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 09:55:51,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 09:55:51,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 09:55:51,868 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 09:55:51,869 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 09:55:51,870 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound100.c [2025-02-08 09:55:53,123 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1184941f2/00dca9d29d594b09a6995c3985f661e5/FLAG48288dc44 [2025-02-08 09:55:53,406 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 09:55:53,412 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound100.c [2025-02-08 09:55:53,426 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1184941f2/00dca9d29d594b09a6995c3985f661e5/FLAG48288dc44 [2025-02-08 09:55:53,480 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1184941f2/00dca9d29d594b09a6995c3985f661e5 [2025-02-08 09:55:53,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 09:55:53,489 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 09:55:53,492 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 09:55:53,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 09:55:53,497 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 09:55:53,498 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:55:53" (1/1) ... [2025-02-08 09:55:53,498 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dc13a4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:55:53, skipping insertion in model container [2025-02-08 09:55:53,499 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:55:53" (1/1) ... [2025-02-08 09:55:53,514 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 09:55:53,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:55:53,662 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 09:55:53,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:55:53,702 INFO L204 MainTranslator]: Completed translation [2025-02-08 09:55:53,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:55:53 WrapperNode [2025-02-08 09:55:53,703 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 09:55:53,704 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 09:55:53,705 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 09:55:53,705 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 09:55:53,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:55:53" (1/1) ... [2025-02-08 09:55:53,716 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:55:53" (1/1) ... [2025-02-08 09:55:53,749 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 141 [2025-02-08 09:55:53,749 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 09:55:53,750 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 09:55:53,750 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 09:55:53,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 09:55:53,757 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:55:53" (1/1) ... [2025-02-08 09:55:53,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:55:53" (1/1) ... [2025-02-08 09:55:53,764 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:55:53" (1/1) ... [2025-02-08 09:55:53,777 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-02-08 09:55:53,777 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:55:53" (1/1) ... [2025-02-08 09:55:53,778 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:55:53" (1/1) ... [2025-02-08 09:55:53,783 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:55:53" (1/1) ... [2025-02-08 09:55:53,784 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:55:53" (1/1) ... [2025-02-08 09:55:53,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:55:53" (1/1) ... [2025-02-08 09:55:53,785 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:55:53" (1/1) ... [2025-02-08 09:55:53,794 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 09:55:53,794 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 09:55:53,794 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 09:55:53,794 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 09:55:53,795 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:55:53" (1/1) ... [2025-02-08 09:55:53,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:55:53,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:55:53,827 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-02-08 09:55:53,829 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-02-08 09:55:53,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 09:55:53,850 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 09:55:53,851 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 09:55:53,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 09:55:53,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 09:55:53,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 09:55:53,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 09:55:53,851 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 09:55:53,895 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 09:55:53,898 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 09:55:54,376 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2025-02-08 09:55:54,377 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 09:55:54,396 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 09:55:54,398 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 09:55:54,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:55:54 BoogieIcfgContainer [2025-02-08 09:55:54,399 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 09:55:54,401 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 09:55:54,401 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 09:55:54,405 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 09:55:54,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 09:55:53" (1/3) ... [2025-02-08 09:55:54,407 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea693fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:55:54, skipping insertion in model container [2025-02-08 09:55:54,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:55:53" (2/3) ... [2025-02-08 09:55:54,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea693fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:55:54, skipping insertion in model container [2025-02-08 09:55:54,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:55:54" (3/3) ... [2025-02-08 09:55:54,409 INFO L128 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound100.c [2025-02-08 09:55:54,422 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 09:55:54,424 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps6-ll_valuebound100.c that has 3 procedures, 224 locations, 1 initial locations, 1 loop locations, and 102 error locations. [2025-02-08 09:55:54,484 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 09:55:54,496 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;@2505039d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 09:55:54,498 INFO L334 AbstractCegarLoop]: Starting to check reachability of 102 error locations. [2025-02-08 09:55:54,502 INFO L276 IsEmpty]: Start isEmpty. Operand has 224 states, 114 states have (on average 1.9298245614035088) internal successors, (220), 216 states have internal predecessors, (220), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 09:55:54,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 09:55:54,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:55:54,508 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:55:54,508 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-02-08 09:55:54,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:55:54,513 INFO L85 PathProgramCache]: Analyzing trace with hash -589823679, now seen corresponding path program 1 times [2025-02-08 09:55:54,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:55:54,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634663919] [2025-02-08 09:55:54,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:55:54,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:55:54,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 09:55:54,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 09:55:54,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:55:54,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:55:54,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 09:55:54,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:55:54,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634663919] [2025-02-08 09:55:54,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634663919] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:55:54,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832412518] [2025-02-08 09:55:54,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:55:54,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:55:54,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:55:54,640 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-02-08 09:55:54,642 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-02-08 09:55:54,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 09:55:54,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 09:55:54,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:55:54,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:55:54,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-08 09:55:54,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:55:54,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 09:55:54,692 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:55:54,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832412518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:55:54,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 09:55:54,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-08 09:55:54,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745142450] [2025-02-08 09:55:54,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:55:54,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 09:55:54,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:55:54,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 09:55:54,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 09:55:54,721 INFO L87 Difference]: Start difference. First operand has 224 states, 114 states have (on average 1.9298245614035088) internal successors, (220), 216 states have internal predecessors, (220), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:55:54,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:55:54,757 INFO L93 Difference]: Finished difference Result 421 states and 462 transitions. [2025-02-08 09:55:54,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 09:55:54,761 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2025-02-08 09:55:54,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:55:54,768 INFO L225 Difference]: With dead ends: 421 [2025-02-08 09:55:54,768 INFO L226 Difference]: Without dead ends: 195 [2025-02-08 09:55:54,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 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-02-08 09:55:54,776 INFO L435 NwaCegarLoop]: 202 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, 202 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-02-08 09:55:54,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:55:54,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-02-08 09:55:54,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2025-02-08 09:55:54,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 112 states have (on average 1.6875) internal successors, (189), 188 states have internal predecessors, (189), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 09:55:54,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 197 transitions. [2025-02-08 09:55:54,819 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 197 transitions. Word has length 14 [2025-02-08 09:55:54,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:55:54,819 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 197 transitions. [2025-02-08 09:55:54,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 09:55:54,820 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 197 transitions. [2025-02-08 09:55:54,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 09:55:54,820 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:55:54,821 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:55:54,829 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-02-08 09:55:55,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-08 09:55:55,025 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-02-08 09:55:55,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:55:55,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1936821409, now seen corresponding path program 1 times [2025-02-08 09:55:55,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:55:55,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798203061] [2025-02-08 09:55:55,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:55:55,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:55:55,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 09:55:55,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 09:55:55,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:55:55,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:55:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:55:55,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:55:55,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798203061] [2025-02-08 09:55:55,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798203061] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:55:55,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:55:55,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:55:55,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764259775] [2025-02-08 09:55:55,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:55:55,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:55:55,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:55:55,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:55:55,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:55:55,093 INFO L87 Difference]: Start difference. First operand 195 states and 197 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-02-08 09:55:55,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:55:55,583 INFO L93 Difference]: Finished difference Result 356 states and 364 transitions. [2025-02-08 09:55:55,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:55:55,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 14 [2025-02-08 09:55:55,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:55:55,585 INFO L225 Difference]: With dead ends: 356 [2025-02-08 09:55:55,585 INFO L226 Difference]: Without dead ends: 292 [2025-02-08 09:55:55,586 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-02-08 09:55:55,586 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 98 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 09:55:55,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 137 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 09:55:55,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-02-08 09:55:55,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 286. [2025-02-08 09:55:55,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 202 states have (on average 1.4306930693069306) internal successors, (289), 278 states have internal predecessors, (289), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 09:55:55,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 299 transitions. [2025-02-08 09:55:55,602 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 299 transitions. Word has length 14 [2025-02-08 09:55:55,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:55:55,603 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 299 transitions. [2025-02-08 09:55:55,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-02-08 09:55:55,603 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 299 transitions. [2025-02-08 09:55:55,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 09:55:55,604 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:55:55,604 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:55:55,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 09:55:55,604 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-02-08 09:55:55,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:55:55,605 INFO L85 PathProgramCache]: Analyzing trace with hash -479341125, now seen corresponding path program 1 times [2025-02-08 09:55:55,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:55:55,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310959547] [2025-02-08 09:55:55,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:55:55,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:55:55,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 09:55:55,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 09:55:55,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:55:55,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:55:55,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:55:55,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:55:55,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310959547] [2025-02-08 09:55:55,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310959547] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:55:55,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:55:55,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:55:55,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512644619] [2025-02-08 09:55:55,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:55:55,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:55:55,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:55:55,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:55:55,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:55:55,794 INFO L87 Difference]: Start difference. First operand 286 states and 299 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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-02-08 09:55:55,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:55:55,868 INFO L93 Difference]: Finished difference Result 310 states and 317 transitions. [2025-02-08 09:55:55,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:55:55,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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 52 [2025-02-08 09:55:55,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:55:55,870 INFO L225 Difference]: With dead ends: 310 [2025-02-08 09:55:55,870 INFO L226 Difference]: Without dead ends: 303 [2025-02-08 09:55:55,870 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-02-08 09:55:55,871 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 68 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:55:55,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 359 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:55:55,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-02-08 09:55:55,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 285. [2025-02-08 09:55:55,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 201 states have (on average 1.4029850746268657) internal successors, (282), 277 states have internal predecessors, (282), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 09:55:55,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 292 transitions. [2025-02-08 09:55:55,888 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 292 transitions. Word has length 52 [2025-02-08 09:55:55,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:55:55,888 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 292 transitions. [2025-02-08 09:55:55,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 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-02-08 09:55:55,888 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 292 transitions. [2025-02-08 09:55:55,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 09:55:55,889 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:55:55,889 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:55:55,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 09:55:55,890 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-02-08 09:55:55,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:55:55,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1085317255, now seen corresponding path program 1 times [2025-02-08 09:55:55,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:55:55,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415536840] [2025-02-08 09:55:55,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:55:55,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:55:55,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 09:55:55,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 09:55:55,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:55:55,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:55:56,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:55:56,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:55:56,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415536840] [2025-02-08 09:55:56,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415536840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:55:56,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:55:56,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:55:56,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028536165] [2025-02-08 09:55:56,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:55:56,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:55:56,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:55:56,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:55:56,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:55:56,049 INFO L87 Difference]: Start difference. First operand 285 states and 292 transitions. Second operand has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 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-02-08 09:55:56,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:55:56,249 INFO L93 Difference]: Finished difference Result 305 states and 310 transitions. [2025-02-08 09:55:56,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:55:56,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 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 54 [2025-02-08 09:55:56,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:55:56,251 INFO L225 Difference]: With dead ends: 305 [2025-02-08 09:55:56,252 INFO L226 Difference]: Without dead ends: 262 [2025-02-08 09:55:56,252 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-02-08 09:55:56,253 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 151 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 09:55:56,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 284 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 09:55:56,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-02-08 09:55:56,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 244. [2025-02-08 09:55:56,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 160 states have (on average 1.49375) internal successors, (239), 236 states have internal predecessors, (239), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 09:55:56,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 249 transitions. [2025-02-08 09:55:56,275 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 249 transitions. Word has length 54 [2025-02-08 09:55:56,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:55:56,275 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 249 transitions. [2025-02-08 09:55:56,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 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-02-08 09:55:56,275 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 249 transitions. [2025-02-08 09:55:56,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 09:55:56,276 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:55:56,276 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, 1, 1, 1, 1, 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-02-08 09:55:56,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 09:55:56,280 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-02-08 09:55:56,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:55:56,281 INFO L85 PathProgramCache]: Analyzing trace with hash -511322942, now seen corresponding path program 1 times [2025-02-08 09:55:56,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:55:56,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617007766] [2025-02-08 09:55:56,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:55:56,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:55:56,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 09:55:56,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 09:55:56,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:55:56,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:55:56,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:55:56,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:55:56,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617007766] [2025-02-08 09:55:56,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617007766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:55:56,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:55:56,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:55:56,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526086829] [2025-02-08 09:55:56,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:55:56,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:55:56,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:55:56,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:55:56,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:55:56,381 INFO L87 Difference]: Start difference. First operand 244 states and 249 transitions. Second operand has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 09:55:56,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:55:56,419 INFO L93 Difference]: Finished difference Result 246 states and 249 transitions. [2025-02-08 09:55:56,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:55:56,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 62 [2025-02-08 09:55:56,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:55:56,422 INFO L225 Difference]: With dead ends: 246 [2025-02-08 09:55:56,422 INFO L226 Difference]: Without dead ends: 244 [2025-02-08 09:55:56,423 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-02-08 09:55:56,424 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 1 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:55:56,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 383 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:55:56,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-02-08 09:55:56,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2025-02-08 09:55:56,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 160 states have (on average 1.48125) internal successors, (237), 236 states have internal predecessors, (237), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 09:55:56,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 247 transitions. [2025-02-08 09:55:56,434 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 247 transitions. Word has length 62 [2025-02-08 09:55:56,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:55:56,435 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 247 transitions. [2025-02-08 09:55:56,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 09:55:56,435 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 247 transitions. [2025-02-08 09:55:56,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-08 09:55:56,436 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:55:56,436 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 09:55:56,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 09:55:56,437 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-02-08 09:55:56,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:55:56,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1561974291, now seen corresponding path program 1 times [2025-02-08 09:55:56,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:55:56,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560210197] [2025-02-08 09:55:56,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:55:56,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:55:56,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 09:55:56,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 09:55:56,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:55:56,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 09:55:56,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1014168898] [2025-02-08 09:55:56,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:55:56,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:55:56,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:55:56,480 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-02-08 09:55:56,482 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-02-08 09:55:56,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 09:55:56,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 09:55:56,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:55:56,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:55:56,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 09:55:56,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:55:56,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:55:56,647 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 09:55:56,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:55:56,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560210197] [2025-02-08 09:55:56,648 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 09:55:56,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014168898] [2025-02-08 09:55:56,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014168898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:55:56,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:55:56,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:55:56,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610544781] [2025-02-08 09:55:56,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:55:56,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:55:56,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:55:56,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:55:56,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:55:56,651 INFO L87 Difference]: Start difference. First operand 244 states and 247 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 09:55:57,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:55:57,111 INFO L93 Difference]: Finished difference Result 419 states and 432 transitions. [2025-02-08 09:55:57,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:55:57,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2025-02-08 09:55:57,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:55:57,115 INFO L225 Difference]: With dead ends: 419 [2025-02-08 09:55:57,115 INFO L226 Difference]: Without dead ends: 354 [2025-02-08 09:55:57,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 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-02-08 09:55:57,116 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 108 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 09:55:57,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 159 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 09:55:57,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-02-08 09:55:57,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 348. [2025-02-08 09:55:57,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 262 states have (on average 1.3473282442748091) internal successors, (353), 338 states have internal predecessors, (353), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 09:55:57,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 367 transitions. [2025-02-08 09:55:57,134 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 367 transitions. Word has length 67 [2025-02-08 09:55:57,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:55:57,134 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 367 transitions. [2025-02-08 09:55:57,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 09:55:57,134 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 367 transitions. [2025-02-08 09:55:57,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-08 09:55:57,136 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:55:57,136 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 09:55:57,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 09:55:57,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:55:57,338 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-02-08 09:55:57,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:55:57,339 INFO L85 PathProgramCache]: Analyzing trace with hash 817124470, now seen corresponding path program 1 times [2025-02-08 09:55:57,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:55:57,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190559487] [2025-02-08 09:55:57,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:55:57,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:55:57,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 09:55:57,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 09:55:57,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:55:57,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:55:57,436 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:55:57,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:55:57,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190559487] [2025-02-08 09:55:57,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190559487] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:55:57,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:55:57,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:55:57,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594512173] [2025-02-08 09:55:57,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:55:57,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:55:57,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:55:57,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:55:57,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:55:57,439 INFO L87 Difference]: Start difference. First operand 348 states and 367 transitions. Second operand has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 09:55:57,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:55:57,520 INFO L93 Difference]: Finished difference Result 349 states and 367 transitions. [2025-02-08 09:55:57,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:55:57,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 74 [2025-02-08 09:55:57,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:55:57,522 INFO L225 Difference]: With dead ends: 349 [2025-02-08 09:55:57,522 INFO L226 Difference]: Without dead ends: 348 [2025-02-08 09:55:57,523 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-02-08 09:55:57,523 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 55 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:55:57,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 317 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:55:57,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-02-08 09:55:57,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2025-02-08 09:55:57,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 262 states have (on average 1.3435114503816794) internal successors, (352), 338 states have internal predecessors, (352), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 09:55:57,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 366 transitions. [2025-02-08 09:55:57,533 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 366 transitions. Word has length 74 [2025-02-08 09:55:57,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:55:57,533 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 366 transitions. [2025-02-08 09:55:57,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 09:55:57,533 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 366 transitions. [2025-02-08 09:55:57,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-08 09:55:57,534 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:55:57,534 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 09:55:57,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 09:55:57,535 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-02-08 09:55:57,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:55:57,535 INFO L85 PathProgramCache]: Analyzing trace with hash -438945141, now seen corresponding path program 1 times [2025-02-08 09:55:57,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:55:57,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904340266] [2025-02-08 09:55:57,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:55:57,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:55:57,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 09:55:57,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 09:55:57,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:55:57,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:55:57,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:55:57,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:55:57,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904340266] [2025-02-08 09:55:57,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904340266] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:55:57,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:55:57,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:55:57,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064052416] [2025-02-08 09:55:57,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:55:57,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:55:57,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:55:57,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:55:57,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:55:57,646 INFO L87 Difference]: Start difference. First operand 348 states and 366 transitions. Second operand has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 09:55:57,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:55:57,742 INFO L93 Difference]: Finished difference Result 349 states and 366 transitions. [2025-02-08 09:55:57,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:55:57,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 75 [2025-02-08 09:55:57,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:55:57,744 INFO L225 Difference]: With dead ends: 349 [2025-02-08 09:55:57,744 INFO L226 Difference]: Without dead ends: 348 [2025-02-08 09:55:57,744 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-02-08 09:55:57,745 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 47 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:55:57,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 326 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:55:57,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-02-08 09:55:57,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2025-02-08 09:55:57,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 262 states have (on average 1.3396946564885497) internal successors, (351), 338 states have internal predecessors, (351), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 09:55:57,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 365 transitions. [2025-02-08 09:55:57,756 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 365 transitions. Word has length 75 [2025-02-08 09:55:57,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:55:57,756 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 365 transitions. [2025-02-08 09:55:57,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 09:55:57,756 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 365 transitions. [2025-02-08 09:55:57,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-08 09:55:57,760 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:55:57,760 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:55:57,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 09:55:57,760 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-02-08 09:55:57,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:55:57,761 INFO L85 PathProgramCache]: Analyzing trace with hash 472819043, now seen corresponding path program 1 times [2025-02-08 09:55:57,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:55:57,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102373490] [2025-02-08 09:55:57,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:55:57,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:55:57,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-08 09:55:57,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-08 09:55:57,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:55:57,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 09:55:57,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1222336445] [2025-02-08 09:55:57,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:55:57,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:55:57,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:55:57,802 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-02-08 09:55:57,805 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-02-08 09:55:57,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-08 09:55:57,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-08 09:55:57,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:55:57,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:55:57,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 09:55:57,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:55:58,182 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:55:58,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:55:58,492 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:55:58,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:55:58,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102373490] [2025-02-08 09:55:58,492 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 09:55:58,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222336445] [2025-02-08 09:55:58,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222336445] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:55:58,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 09:55:58,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-02-08 09:55:58,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888809474] [2025-02-08 09:55:58,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 09:55:58,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 09:55:58,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:55:58,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 09:55:58,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-08 09:55:58,495 INFO L87 Difference]: Start difference. First operand 348 states and 365 transitions. Second operand has 8 states, 7 states have (on average 29.285714285714285) internal successors, (205), 8 states have internal predecessors, (205), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 09:55:59,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:55:59,707 INFO L93 Difference]: Finished difference Result 372 states and 383 transitions. [2025-02-08 09:55:59,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 09:55:59,707 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 29.285714285714285) internal successors, (205), 8 states have internal predecessors, (205), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 115 [2025-02-08 09:55:59,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:55:59,709 INFO L225 Difference]: With dead ends: 372 [2025-02-08 09:55:59,709 INFO L226 Difference]: Without dead ends: 363 [2025-02-08 09:55:59,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-02-08 09:55:59,710 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 342 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:55:59,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 168 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 09:55:59,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-02-08 09:55:59,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 352. [2025-02-08 09:55:59,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 269 states have (on average 1.308550185873606) internal successors, (352), 342 states have internal predecessors, (352), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 09:55:59,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 366 transitions. [2025-02-08 09:55:59,723 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 366 transitions. Word has length 115 [2025-02-08 09:55:59,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:55:59,723 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 366 transitions. [2025-02-08 09:55:59,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 29.285714285714285) internal successors, (205), 8 states have internal predecessors, (205), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 09:55:59,724 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 366 transitions. [2025-02-08 09:55:59,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-08 09:55:59,725 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:55:59,725 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:55:59,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 09:55:59,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:55:59,930 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-02-08 09:55:59,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:55:59,930 INFO L85 PathProgramCache]: Analyzing trace with hash -887429855, now seen corresponding path program 1 times [2025-02-08 09:55:59,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:55:59,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107000233] [2025-02-08 09:55:59,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:55:59,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:55:59,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-08 09:55:59,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-08 09:55:59,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:55:59,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 09:55:59,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1547430672] [2025-02-08 09:55:59,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:55:59,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:55:59,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:55:59,958 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-02-08 09:55:59,960 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-02-08 09:55:59,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-08 09:56:00,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-08 09:56:00,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:56:00,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:56:00,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 09:56:00,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:56:00,377 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:56:00,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:56:01,746 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 09:56:01,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:56:01,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107000233] [2025-02-08 09:56:01,747 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 09:56:01,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547430672] [2025-02-08 09:56:01,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547430672] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:56:01,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 09:56:01,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2025-02-08 09:56:01,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408665858] [2025-02-08 09:56:01,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 09:56:01,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 09:56:01,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:56:01,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 09:56:01,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-02-08 09:56:01,749 INFO L87 Difference]: Start difference. First operand 352 states and 366 transitions. Second operand has 9 states, 8 states have (on average 26.125) internal successors, (209), 9 states have internal predecessors, (209), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 09:56:11,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:56:20,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 9.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:56:24,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:56:30,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:56:39,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 8.95s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:56:44,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:56:48,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:57:00,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 9.62s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:57:05,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.87s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:57:11,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:57:15,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:57:19,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:57:20,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:57:25,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.56s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-08 09:57:32,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.87s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []