./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_valuebound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_valuebound5.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 ee7efdbf8e082fecbcf7a0b7187f01592d4dffd310592a1175678347e3e281b9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:02:39,321 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:02:39,375 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 02:02:39,382 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:02:39,382 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:02:39,401 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:02:39,401 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:02:39,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:02:39,405 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:02:39,406 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:02:39,406 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:02:39,406 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:02:39,406 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:02:39,406 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:02:39,406 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:02:39,406 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:02:39,406 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:02:39,406 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:02:39,406 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:02:39,406 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:02:39,406 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:02:39,406 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:02:39,406 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:02:39,406 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:02:39,406 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:02:39,406 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:02:39,406 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:02:39,407 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:02:39,407 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:02:39,407 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:02:39,407 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:02:39,407 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:02:39,407 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:02:39,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:02:39,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:02:39,407 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:02:39,407 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:02:39,407 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:02:39,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:02:39,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:02:39,407 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:02:39,407 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:02:39,407 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:02:39,407 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:02:39,407 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:02:39,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:02:39,407 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:02:39,407 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:02:39,407 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:02:39,407 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:02:39,407 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 -> ee7efdbf8e082fecbcf7a0b7187f01592d4dffd310592a1175678347e3e281b9 [2025-01-10 02:02:39,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:02:39,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:02:39,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:02:39,644 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:02:39,644 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:02:39,645 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_valuebound5.c [2025-01-10 02:02:40,853 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eda955dba/96510e81084e4e55b95b04214a7ddc28/FLAGb29d244ba [2025-01-10 02:02:41,127 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:02:41,127 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_valuebound5.c [2025-01-10 02:02:41,136 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eda955dba/96510e81084e4e55b95b04214a7ddc28/FLAGb29d244ba [2025-01-10 02:02:41,150 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eda955dba/96510e81084e4e55b95b04214a7ddc28 [2025-01-10 02:02:41,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:02:41,153 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:02:41,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:02:41,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:02:41,157 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:02:41,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:02:41" (1/1) ... [2025-01-10 02:02:41,158 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@626e5a40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:02:41, skipping insertion in model container [2025-01-10 02:02:41,158 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:02:41" (1/1) ... [2025-01-10 02:02:41,170 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:02:41,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:02:41,300 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:02:41,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:02:41,331 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:02:41,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:02:41 WrapperNode [2025-01-10 02:02:41,333 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:02:41,333 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:02:41,334 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:02:41,334 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:02:41,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:02:41" (1/1) ... [2025-01-10 02:02:41,344 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:02:41" (1/1) ... [2025-01-10 02:02:41,366 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 146 [2025-01-10 02:02:41,369 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:02:41,370 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:02:41,370 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:02:41,370 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:02:41,379 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:02:41" (1/1) ... [2025-01-10 02:02:41,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:02:41" (1/1) ... [2025-01-10 02:02:41,384 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:02:41" (1/1) ... [2025-01-10 02:02:41,395 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 02:02:41,396 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:02:41" (1/1) ... [2025-01-10 02:02:41,396 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:02:41" (1/1) ... [2025-01-10 02:02:41,398 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:02:41" (1/1) ... [2025-01-10 02:02:41,402 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:02:41" (1/1) ... [2025-01-10 02:02:41,404 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:02:41" (1/1) ... [2025-01-10 02:02:41,408 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:02:41" (1/1) ... [2025-01-10 02:02:41,409 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:02:41" (1/1) ... [2025-01-10 02:02:41,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:02:41,410 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:02:41,410 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:02:41,410 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:02:41,411 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:02:41" (1/1) ... [2025-01-10 02:02:41,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:02:41,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:02:41,438 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 02:02:41,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 02:02:41,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:02:41,467 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 02:02:41,467 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 02:02:41,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:02:41,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:02:41,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:02:41,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 02:02:41,468 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 02:02:41,516 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:02:41,518 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:02:41,866 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2025-01-10 02:02:41,866 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:02:41,879 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:02:41,879 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-10 02:02:41,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:02:41 BoogieIcfgContainer [2025-01-10 02:02:41,880 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:02:41,881 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:02:41,881 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:02:41,888 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:02:41,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:02:41" (1/3) ... [2025-01-10 02:02:41,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a1ed3de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:02:41, skipping insertion in model container [2025-01-10 02:02:41,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:02:41" (2/3) ... [2025-01-10 02:02:41,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a1ed3de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:02:41, skipping insertion in model container [2025-01-10 02:02:41,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:02:41" (3/3) ... [2025-01-10 02:02:41,892 INFO L128 eAbstractionObserver]: Analyzing ICFG fermat1-ll_valuebound5.c [2025-01-10 02:02:41,903 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:02:41,904 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fermat1-ll_valuebound5.c that has 3 procedures, 212 locations, 1 initial locations, 3 loop locations, and 92 error locations. [2025-01-10 02:02:41,941 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:02:41,948 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;@9b09b3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:02:41,948 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2025-01-10 02:02:41,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 212 states, 109 states have (on average 1.9174311926605505) internal successors, (209), 201 states have internal predecessors, (209), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-10 02:02:41,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 02:02:41,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:41,955 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:41,955 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2025-01-10 02:02:41,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:41,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1609192337, now seen corresponding path program 1 times [2025-01-10 02:02:41,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:41,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468597350] [2025-01-10 02:02:41,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:41,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:42,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 02:02:42,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 02:02:42,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:42,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:42,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:02:42,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:42,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468597350] [2025-01-10 02:02:42,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468597350] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:02:42,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363500033] [2025-01-10 02:02:42,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:42,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:02:42,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:02:42,062 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:02:42,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 02:02:42,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 02:02:42,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 02:02:42,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:42,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:42,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-10 02:02:42,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:02:42,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 02:02:42,113 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:02:42,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363500033] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:02:42,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:02:42,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-10 02:02:42,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986627455] [2025-01-10 02:02:42,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:02:42,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 02:02:42,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:42,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 02:02:42,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 02:02:42,132 INFO L87 Difference]: Start difference. First operand has 212 states, 109 states have (on average 1.9174311926605505) internal successors, (209), 201 states have internal predecessors, (209), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) 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-01-10 02:02:42,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:42,160 INFO L93 Difference]: Finished difference Result 410 states and 453 transitions. [2025-01-10 02:02:42,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 02:02:42,161 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-01-10 02:02:42,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:42,168 INFO L225 Difference]: With dead ends: 410 [2025-01-10 02:02:42,169 INFO L226 Difference]: Without dead ends: 195 [2025-01-10 02:02:42,171 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-01-10 02:02:42,172 INFO L435 NwaCegarLoop]: 209 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, 209 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:42,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:02:42,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-01-10 02:02:42,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2025-01-10 02:02:42,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 104 states have (on average 1.8076923076923077) internal successors, (188), 185 states have internal predecessors, (188), 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-01-10 02:02:42,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 202 transitions. [2025-01-10 02:02:42,208 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 202 transitions. Word has length 14 [2025-01-10 02:02:42,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:42,209 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 202 transitions. [2025-01-10 02:02:42,209 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-01-10 02:02:42,209 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 202 transitions. [2025-01-10 02:02:42,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 02:02:42,209 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:42,210 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:42,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 02:02:42,413 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-01-10 02:02:42,413 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2025-01-10 02:02:42,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:42,416 INFO L85 PathProgramCache]: Analyzing trace with hash -2002159765, now seen corresponding path program 1 times [2025-01-10 02:02:42,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:42,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909620708] [2025-01-10 02:02:42,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:42,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:42,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 02:02:42,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 02:02:42,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:42,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:42,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:02:42,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:42,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909620708] [2025-01-10 02:02:42,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909620708] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:02:42,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:02:42,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:02:42,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528114543] [2025-01-10 02:02:42,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:02:42,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:02:42,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:42,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:02:42,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:02:42,515 INFO L87 Difference]: Start difference. First operand 195 states and 202 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:02:42,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:42,575 INFO L93 Difference]: Finished difference Result 195 states and 202 transitions. [2025-01-10 02:02:42,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:02:42,576 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2025-01-10 02:02:42,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:42,578 INFO L225 Difference]: With dead ends: 195 [2025-01-10 02:02:42,578 INFO L226 Difference]: Without dead ends: 191 [2025-01-10 02:02:42,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:02:42,579 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 13 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:42,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 347 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:02:42,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-01-10 02:02:42,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-01-10 02:02:42,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 104 states have (on average 1.7692307692307692) internal successors, (184), 181 states have internal predecessors, (184), 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-01-10 02:02:42,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 198 transitions. [2025-01-10 02:02:42,587 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 198 transitions. Word has length 14 [2025-01-10 02:02:42,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:42,588 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 198 transitions. [2025-01-10 02:02:42,588 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:02:42,588 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 198 transitions. [2025-01-10 02:02:42,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 02:02:42,588 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:42,588 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:42,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:02:42,589 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2025-01-10 02:02:42,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:42,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1937410532, now seen corresponding path program 1 times [2025-01-10 02:02:42,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:42,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903957787] [2025-01-10 02:02:42,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:42,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:42,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 02:02:42,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 02:02:42,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:42,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:42,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:02:42,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:42,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903957787] [2025-01-10 02:02:42,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903957787] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:02:42,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:02:42,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:02:42,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749753417] [2025-01-10 02:02:42,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:02:42,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:02:42,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:42,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:02:42,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:02:42,635 INFO L87 Difference]: Start difference. First operand 191 states and 198 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:02:42,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:42,668 INFO L93 Difference]: Finished difference Result 191 states and 198 transitions. [2025-01-10 02:02:42,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:02:42,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2025-01-10 02:02:42,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:42,669 INFO L225 Difference]: With dead ends: 191 [2025-01-10 02:02:42,669 INFO L226 Difference]: Without dead ends: 187 [2025-01-10 02:02:42,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:02:42,670 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 12 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:42,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 347 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:02:42,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-01-10 02:02:42,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2025-01-10 02:02:42,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 104 states have (on average 1.7307692307692308) internal successors, (180), 177 states have internal predecessors, (180), 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-01-10 02:02:42,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 194 transitions. [2025-01-10 02:02:42,677 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 194 transitions. Word has length 15 [2025-01-10 02:02:42,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:42,677 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 194 transitions. [2025-01-10 02:02:42,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 02:02:42,677 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 194 transitions. [2025-01-10 02:02:42,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 02:02:42,678 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:42,678 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:42,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 02:02:42,678 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2025-01-10 02:02:42,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:42,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1115181664, now seen corresponding path program 1 times [2025-01-10 02:02:42,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:42,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580493238] [2025-01-10 02:02:42,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:42,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:42,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 02:02:42,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 02:02:42,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:42,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:02:42,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2109221335] [2025-01-10 02:02:42,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:42,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:02:42,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:02:42,700 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:02:42,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 02:02:42,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 02:02:42,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 02:02:42,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:42,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:42,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 02:02:42,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:02:42,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 02:02:42,799 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:02:42,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:42,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580493238] [2025-01-10 02:02:42,800 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:02:42,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109221335] [2025-01-10 02:02:42,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109221335] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:02:42,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:02:42,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:02:42,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675198015] [2025-01-10 02:02:42,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:02:42,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:02:42,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:42,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:02:42,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:02:42,802 INFO L87 Difference]: Start difference. First operand 187 states and 194 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:02:42,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:42,874 INFO L93 Difference]: Finished difference Result 187 states and 194 transitions. [2025-01-10 02:02:42,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:02:42,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-01-10 02:02:42,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:42,876 INFO L225 Difference]: With dead ends: 187 [2025-01-10 02:02:42,876 INFO L226 Difference]: Without dead ends: 185 [2025-01-10 02:02:42,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:02:42,877 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 8 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:42,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 671 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:02:42,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-01-10 02:02:42,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-01-10 02:02:42,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 104 states have (on average 1.7115384615384615) internal successors, (178), 175 states have internal predecessors, (178), 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-01-10 02:02:42,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 192 transitions. [2025-01-10 02:02:42,886 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 192 transitions. Word has length 19 [2025-01-10 02:02:42,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:42,886 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 192 transitions. [2025-01-10 02:02:42,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 02:02:42,886 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 192 transitions. [2025-01-10 02:02:42,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-10 02:02:42,887 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:42,887 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:42,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 02:02:43,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:02:43,091 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2025-01-10 02:02:43,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:43,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1533964587, now seen corresponding path program 1 times [2025-01-10 02:02:43,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:43,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222442131] [2025-01-10 02:02:43,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:43,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:43,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 02:02:43,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 02:02:43,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:43,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:02:43,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1847638002] [2025-01-10 02:02:43,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:43,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:02:43,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:02:43,117 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:02:43,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 02:02:43,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 02:02:43,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 02:02:43,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:43,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:43,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 02:02:43,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:02:43,240 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 02:02:43,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:02:43,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:43,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222442131] [2025-01-10 02:02:43,278 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:02:43,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847638002] [2025-01-10 02:02:43,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847638002] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:02:43,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:02:43,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-01-10 02:02:43,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591645773] [2025-01-10 02:02:43,279 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-10 02:02:43,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:02:43,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:43,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:02:43,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:02:43,280 INFO L87 Difference]: Start difference. First operand 185 states and 192 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:02:43,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:43,356 INFO L93 Difference]: Finished difference Result 185 states and 192 transitions. [2025-01-10 02:02:43,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:02:43,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2025-01-10 02:02:43,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:43,357 INFO L225 Difference]: With dead ends: 185 [2025-01-10 02:02:43,358 INFO L226 Difference]: Without dead ends: 182 [2025-01-10 02:02:43,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:02:43,358 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 141 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:43,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 467 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:02:43,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-01-10 02:02:43,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2025-01-10 02:02:43,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 104 states have (on average 1.6826923076923077) internal successors, (175), 172 states have internal predecessors, (175), 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-01-10 02:02:43,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 189 transitions. [2025-01-10 02:02:43,364 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 189 transitions. Word has length 36 [2025-01-10 02:02:43,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:43,364 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 189 transitions. [2025-01-10 02:02:43,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:02:43,364 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 189 transitions. [2025-01-10 02:02:43,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-10 02:02:43,365 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:43,365 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:43,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 02:02:43,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:02:43,569 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2025-01-10 02:02:43,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:43,570 INFO L85 PathProgramCache]: Analyzing trace with hash -308261876, now seen corresponding path program 1 times [2025-01-10 02:02:43,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:43,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526686539] [2025-01-10 02:02:43,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:43,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:43,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 02:02:43,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 02:02:43,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:43,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:43,746 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 02:02:43,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:43,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526686539] [2025-01-10 02:02:43,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526686539] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:02:43,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023927143] [2025-01-10 02:02:43,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:43,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:02:43,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:02:43,751 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:02:43,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 02:02:43,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 02:02:43,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 02:02:43,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:43,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:43,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 02:02:43,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:02:43,869 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 02:02:43,869 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:02:43,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023927143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:02:43,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:02:43,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 02:02:43,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87817619] [2025-01-10 02:02:43,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:02:43,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:02:43,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:43,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:02:43,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:02:43,870 INFO L87 Difference]: Start difference. First operand 182 states and 189 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 02:02:43,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:43,979 INFO L93 Difference]: Finished difference Result 182 states and 189 transitions. [2025-01-10 02:02:43,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:02:43,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2025-01-10 02:02:43,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:43,980 INFO L225 Difference]: With dead ends: 182 [2025-01-10 02:02:43,981 INFO L226 Difference]: Without dead ends: 181 [2025-01-10 02:02:43,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 02:02:43,981 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 140 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:43,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 599 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:02:43,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-01-10 02:02:43,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-01-10 02:02:43,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 104 states have (on average 1.6730769230769231) internal successors, (174), 171 states have internal predecessors, (174), 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-01-10 02:02:43,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 188 transitions. [2025-01-10 02:02:43,995 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 188 transitions. Word has length 37 [2025-01-10 02:02:43,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:43,996 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 188 transitions. [2025-01-10 02:02:43,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 02:02:43,996 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 188 transitions. [2025-01-10 02:02:43,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-10 02:02:43,996 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:43,996 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:44,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 02:02:44,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-01-10 02:02:44,197 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2025-01-10 02:02:44,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:44,198 INFO L85 PathProgramCache]: Analyzing trace with hash -966183494, now seen corresponding path program 1 times [2025-01-10 02:02:44,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:44,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888419354] [2025-01-10 02:02:44,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:44,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:44,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 02:02:44,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 02:02:44,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:44,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:44,272 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:02:44,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:44,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888419354] [2025-01-10 02:02:44,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888419354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:02:44,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:02:44,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:02:44,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255251803] [2025-01-10 02:02:44,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:02:44,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:02:44,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:44,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:02:44,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:02:44,274 INFO L87 Difference]: Start difference. First operand 181 states and 188 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 02:02:44,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:44,326 INFO L93 Difference]: Finished difference Result 185 states and 192 transitions. [2025-01-10 02:02:44,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:02:44,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 38 [2025-01-10 02:02:44,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:44,327 INFO L225 Difference]: With dead ends: 185 [2025-01-10 02:02:44,327 INFO L226 Difference]: Without dead ends: 182 [2025-01-10 02:02:44,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:02:44,328 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 97 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:44,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 216 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:02:44,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-01-10 02:02:44,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2025-01-10 02:02:44,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 106 states have (on average 1.650943396226415) internal successors, (175), 172 states have internal predecessors, (175), 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-01-10 02:02:44,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 189 transitions. [2025-01-10 02:02:44,334 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 189 transitions. Word has length 38 [2025-01-10 02:02:44,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:44,334 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 189 transitions. [2025-01-10 02:02:44,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 02:02:44,334 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 189 transitions. [2025-01-10 02:02:44,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-10 02:02:44,335 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:44,335 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:44,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 02:02:44,335 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2025-01-10 02:02:44,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:44,336 INFO L85 PathProgramCache]: Analyzing trace with hash 113082830, now seen corresponding path program 1 times [2025-01-10 02:02:44,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:44,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146095628] [2025-01-10 02:02:44,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:44,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:44,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-10 02:02:44,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-10 02:02:44,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:44,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:44,369 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:02:44,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:44,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146095628] [2025-01-10 02:02:44,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146095628] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:02:44,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:02:44,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:02:44,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83944993] [2025-01-10 02:02:44,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:02:44,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:02:44,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:44,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:02:44,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:02:44,370 INFO L87 Difference]: Start difference. First operand 182 states and 189 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 02:02:44,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:44,451 INFO L93 Difference]: Finished difference Result 186 states and 193 transitions. [2025-01-10 02:02:44,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:02:44,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2025-01-10 02:02:44,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:44,452 INFO L225 Difference]: With dead ends: 186 [2025-01-10 02:02:44,452 INFO L226 Difference]: Without dead ends: 183 [2025-01-10 02:02:44,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:02:44,453 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 107 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:44,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 327 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:02:44,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-01-10 02:02:44,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2025-01-10 02:02:44,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 108 states have (on average 1.6296296296296295) internal successors, (176), 173 states have internal predecessors, (176), 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-01-10 02:02:44,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 190 transitions. [2025-01-10 02:02:44,458 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 190 transitions. Word has length 39 [2025-01-10 02:02:44,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:44,458 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 190 transitions. [2025-01-10 02:02:44,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 02:02:44,459 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 190 transitions. [2025-01-10 02:02:44,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-10 02:02:44,459 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:44,459 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:44,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 02:02:44,459 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2025-01-10 02:02:44,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:44,460 INFO L85 PathProgramCache]: Analyzing trace with hash -789399492, now seen corresponding path program 1 times [2025-01-10 02:02:44,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:44,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309278512] [2025-01-10 02:02:44,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:44,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:44,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 02:02:44,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 02:02:44,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:44,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:02:44,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [818582601] [2025-01-10 02:02:44,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:44,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:02:44,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:02:44,479 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:02:44,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 02:02:44,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 02:02:44,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 02:02:44,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:44,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:44,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 02:02:44,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:02:44,533 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:02:44,533 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:02:44,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:44,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309278512] [2025-01-10 02:02:44,533 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:02:44,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818582601] [2025-01-10 02:02:44,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818582601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:02:44,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:02:44,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:02:44,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233141244] [2025-01-10 02:02:44,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:02:44,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:02:44,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:44,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:02:44,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:02:44,534 INFO L87 Difference]: Start difference. First operand 183 states and 190 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 02:02:44,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:44,621 INFO L93 Difference]: Finished difference Result 286 states and 306 transitions. [2025-01-10 02:02:44,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:02:44,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2025-01-10 02:02:44,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:44,623 INFO L225 Difference]: With dead ends: 286 [2025-01-10 02:02:44,623 INFO L226 Difference]: Without dead ends: 283 [2025-01-10 02:02:44,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:02:44,623 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 95 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:44,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 302 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:02:44,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-01-10 02:02:44,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 243. [2025-01-10 02:02:44,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 165 states have (on average 1.6666666666666667) internal successors, (275), 230 states have internal predecessors, (275), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-10 02:02:44,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 295 transitions. [2025-01-10 02:02:44,634 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 295 transitions. Word has length 40 [2025-01-10 02:02:44,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:44,635 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 295 transitions. [2025-01-10 02:02:44,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 02:02:44,635 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 295 transitions. [2025-01-10 02:02:44,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-10 02:02:44,635 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:44,636 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:44,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 02:02:44,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:02:44,836 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2025-01-10 02:02:44,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:44,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1298419600, now seen corresponding path program 1 times [2025-01-10 02:02:44,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:44,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403530929] [2025-01-10 02:02:44,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:44,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:44,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 02:02:44,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 02:02:44,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:44,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:44,960 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:02:44,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:44,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403530929] [2025-01-10 02:02:44,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403530929] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:02:44,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242220612] [2025-01-10 02:02:44,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:44,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:02:44,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:02:44,966 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:02:44,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 02:02:44,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 02:02:44,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 02:02:44,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:44,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:44,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 02:02:44,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:02:45,171 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 02:02:45,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:02:45,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242220612] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:02:45,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:02:45,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2025-01-10 02:02:45,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998638853] [2025-01-10 02:02:45,349 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:02:45,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 02:02:45,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:45,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 02:02:45,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-01-10 02:02:45,351 INFO L87 Difference]: Start difference. First operand 243 states and 295 transitions. Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-01-10 02:02:46,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:46,661 INFO L93 Difference]: Finished difference Result 382 states and 413 transitions. [2025-01-10 02:02:46,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 02:02:46,661 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 41 [2025-01-10 02:02:46,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:46,663 INFO L225 Difference]: With dead ends: 382 [2025-01-10 02:02:46,663 INFO L226 Difference]: Without dead ends: 379 [2025-01-10 02:02:46,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2025-01-10 02:02:46,663 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 815 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 27 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:46,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 1125 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 476 Invalid, 2 Unknown, 0 Unchecked, 1.2s Time] [2025-01-10 02:02:46,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-01-10 02:02:46,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 285. [2025-01-10 02:02:46,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 205 states have (on average 1.6634146341463414) internal successors, (341), 270 states have internal predecessors, (341), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 02:02:46,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 365 transitions. [2025-01-10 02:02:46,672 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 365 transitions. Word has length 41 [2025-01-10 02:02:46,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:46,673 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 365 transitions. [2025-01-10 02:02:46,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 6 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-01-10 02:02:46,673 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 365 transitions. [2025-01-10 02:02:46,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-10 02:02:46,673 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:46,673 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:46,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 02:02:46,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-10 02:02:46,874 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2025-01-10 02:02:46,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:46,874 INFO L85 PathProgramCache]: Analyzing trace with hash -2054245038, now seen corresponding path program 1 times [2025-01-10 02:02:46,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:46,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515983531] [2025-01-10 02:02:46,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:46,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:46,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 02:02:46,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 02:02:46,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:46,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:02:46,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [178376053] [2025-01-10 02:02:46,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:46,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:02:46,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:02:46,898 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:02:46,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 02:02:46,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 02:02:46,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 02:02:46,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:46,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:46,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 02:02:46,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:02:47,154 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 02:02:47,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:02:47,264 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 02:02:47,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:47,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515983531] [2025-01-10 02:02:47,264 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:02:47,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178376053] [2025-01-10 02:02:47,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178376053] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:02:47,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 02:02:47,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-01-10 02:02:47,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002749832] [2025-01-10 02:02:47,265 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 02:02:47,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 02:02:47,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:47,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 02:02:47,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:02:47,266 INFO L87 Difference]: Start difference. First operand 285 states and 365 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-10 02:02:47,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:47,754 INFO L93 Difference]: Finished difference Result 414 states and 532 transitions. [2025-01-10 02:02:47,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 02:02:47,755 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 43 [2025-01-10 02:02:47,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:47,758 INFO L225 Difference]: With dead ends: 414 [2025-01-10 02:02:47,758 INFO L226 Difference]: Without dead ends: 387 [2025-01-10 02:02:47,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:02:47,759 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 309 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:47,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 336 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 02:02:47,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-01-10 02:02:47,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 361. [2025-01-10 02:02:47,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 295 states have (on average 1.4610169491525424) internal successors, (431), 343 states have internal predecessors, (431), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-10 02:02:47,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 461 transitions. [2025-01-10 02:02:47,785 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 461 transitions. Word has length 43 [2025-01-10 02:02:47,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:47,785 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 461 transitions. [2025-01-10 02:02:47,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-10 02:02:47,785 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 461 transitions. [2025-01-10 02:02:47,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-10 02:02:47,786 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:47,786 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:47,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 02:02:47,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:02:47,992 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2025-01-10 02:02:47,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:47,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1555477268, now seen corresponding path program 1 times [2025-01-10 02:02:47,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:47,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857088931] [2025-01-10 02:02:47,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:47,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:47,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 02:02:48,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 02:02:48,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:48,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:02:48,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1836592027] [2025-01-10 02:02:48,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:48,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:02:48,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:02:48,017 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:02:48,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 02:02:48,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 02:02:48,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 02:02:48,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:48,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:48,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:02:48,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:02:48,069 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:02:48,069 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:02:48,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:48,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857088931] [2025-01-10 02:02:48,069 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:02:48,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836592027] [2025-01-10 02:02:48,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836592027] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:02:48,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:02:48,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:02:48,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436823138] [2025-01-10 02:02:48,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:02:48,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:02:48,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:48,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:02:48,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:02:48,070 INFO L87 Difference]: Start difference. First operand 361 states and 461 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 02:02:48,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:48,211 INFO L93 Difference]: Finished difference Result 555 states and 708 transitions. [2025-01-10 02:02:48,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:02:48,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2025-01-10 02:02:48,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:48,213 INFO L225 Difference]: With dead ends: 555 [2025-01-10 02:02:48,213 INFO L226 Difference]: Without dead ends: 514 [2025-01-10 02:02:48,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:02:48,214 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 86 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:48,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 203 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:02:48,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-01-10 02:02:48,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 502. [2025-01-10 02:02:48,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 431 states have (on average 1.3642691415313226) internal successors, (588), 479 states have internal predecessors, (588), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-10 02:02:48,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 628 transitions. [2025-01-10 02:02:48,246 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 628 transitions. Word has length 45 [2025-01-10 02:02:48,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:48,246 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 628 transitions. [2025-01-10 02:02:48,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 02:02:48,247 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 628 transitions. [2025-01-10 02:02:48,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-10 02:02:48,247 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:48,247 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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-01-10 02:02:48,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 02:02:48,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:02:48,448 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2025-01-10 02:02:48,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:48,449 INFO L85 PathProgramCache]: Analyzing trace with hash -107736174, now seen corresponding path program 1 times [2025-01-10 02:02:48,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:48,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145519963] [2025-01-10 02:02:48,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:48,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:48,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-10 02:02:48,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-10 02:02:48,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:48,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:48,503 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-10 02:02:48,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:48,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145519963] [2025-01-10 02:02:48,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145519963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:02:48,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:02:48,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:02:48,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626293287] [2025-01-10 02:02:48,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:02:48,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:02:48,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:48,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:02:48,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:02:48,504 INFO L87 Difference]: Start difference. First operand 502 states and 628 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 02:02:48,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:48,685 INFO L93 Difference]: Finished difference Result 515 states and 629 transitions. [2025-01-10 02:02:48,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:02:48,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 86 [2025-01-10 02:02:48,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:48,687 INFO L225 Difference]: With dead ends: 515 [2025-01-10 02:02:48,687 INFO L226 Difference]: Without dead ends: 514 [2025-01-10 02:02:48,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:02:48,688 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 55 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:48,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 256 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:02:48,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-01-10 02:02:48,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 502. [2025-01-10 02:02:48,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 431 states have (on average 1.359628770301624) internal successors, (586), 479 states have internal predecessors, (586), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-10 02:02:48,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 626 transitions. [2025-01-10 02:02:48,703 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 626 transitions. Word has length 86 [2025-01-10 02:02:48,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:48,703 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 626 transitions. [2025-01-10 02:02:48,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 02:02:48,703 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 626 transitions. [2025-01-10 02:02:48,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-10 02:02:48,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:48,704 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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-01-10 02:02:48,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 02:02:48,704 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2025-01-10 02:02:48,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:48,705 INFO L85 PathProgramCache]: Analyzing trace with hash 955146061, now seen corresponding path program 1 times [2025-01-10 02:02:48,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:48,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533523072] [2025-01-10 02:02:48,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:48,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:48,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-10 02:02:48,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-10 02:02:48,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:48,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:48,783 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-10 02:02:48,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:48,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533523072] [2025-01-10 02:02:48,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533523072] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:02:48,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:02:48,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:02:48,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415685582] [2025-01-10 02:02:48,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:02:48,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:02:48,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:48,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:02:48,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:02:48,785 INFO L87 Difference]: Start difference. First operand 502 states and 626 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 02:02:49,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:49,063 INFO L93 Difference]: Finished difference Result 511 states and 631 transitions. [2025-01-10 02:02:49,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:02:49,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 87 [2025-01-10 02:02:49,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:49,065 INFO L225 Difference]: With dead ends: 511 [2025-01-10 02:02:49,065 INFO L226 Difference]: Without dead ends: 510 [2025-01-10 02:02:49,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:02:49,066 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 244 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:49,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 201 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:02:49,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-01-10 02:02:49,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 502. [2025-01-10 02:02:49,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 431 states have (on average 1.3549883990719258) internal successors, (584), 479 states have internal predecessors, (584), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-10 02:02:49,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 624 transitions. [2025-01-10 02:02:49,081 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 624 transitions. Word has length 87 [2025-01-10 02:02:49,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:49,081 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 624 transitions. [2025-01-10 02:02:49,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-10 02:02:49,081 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 624 transitions. [2025-01-10 02:02:49,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-10 02:02:49,082 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:49,082 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1] [2025-01-10 02:02:49,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 02:02:49,082 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2025-01-10 02:02:49,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:49,083 INFO L85 PathProgramCache]: Analyzing trace with hash 598127140, now seen corresponding path program 1 times [2025-01-10 02:02:49,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:49,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830685979] [2025-01-10 02:02:49,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:49,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:49,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-10 02:02:49,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-10 02:02:49,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:49,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:49,177 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-10 02:02:49,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:49,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830685979] [2025-01-10 02:02:49,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830685979] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:02:49,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689629402] [2025-01-10 02:02:49,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:49,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:02:49,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:02:49,180 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:02:49,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 02:02:49,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-10 02:02:49,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-10 02:02:49,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:49,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:49,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:02:49,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:02:49,366 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-10 02:02:49,366 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:02:49,512 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-10 02:02:49,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689629402] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:02:49,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:02:49,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2025-01-10 02:02:49,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642992671] [2025-01-10 02:02:49,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:02:49,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 02:02:49,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:02:49,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 02:02:49,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-01-10 02:02:49,514 INFO L87 Difference]: Start difference. First operand 502 states and 624 transitions. Second operand has 14 states, 13 states have (on average 13.307692307692308) internal successors, (173), 14 states have internal predecessors, (173), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-01-10 02:02:50,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:02:50,172 INFO L93 Difference]: Finished difference Result 1089 states and 1355 transitions. [2025-01-10 02:02:50,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 02:02:50,172 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 13.307692307692308) internal successors, (173), 14 states have internal predecessors, (173), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 90 [2025-01-10 02:02:50,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:02:50,174 INFO L225 Difference]: With dead ends: 1089 [2025-01-10 02:02:50,174 INFO L226 Difference]: Without dead ends: 612 [2025-01-10 02:02:50,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=391, Unknown=0, NotChecked=0, Total=600 [2025-01-10 02:02:50,176 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 1059 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 02:02:50,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 350 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 02:02:50,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-01-10 02:02:50,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 576. [2025-01-10 02:02:50,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 503 states have (on average 1.333996023856859) internal successors, (671), 549 states have internal predecessors, (671), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-10 02:02:50,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 719 transitions. [2025-01-10 02:02:50,192 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 719 transitions. Word has length 90 [2025-01-10 02:02:50,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:02:50,192 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 719 transitions. [2025-01-10 02:02:50,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 13.307692307692308) internal successors, (173), 14 states have internal predecessors, (173), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2025-01-10 02:02:50,192 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 719 transitions. [2025-01-10 02:02:50,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-10 02:02:50,193 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:02:50,193 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:02:50,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 02:02:50,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:02:50,397 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2025-01-10 02:02:50,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:02:50,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1362072273, now seen corresponding path program 1 times [2025-01-10 02:02:50,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:02:50,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186383267] [2025-01-10 02:02:50,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:50,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:02:50,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-10 02:02:50,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-10 02:02:50,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:50,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:50,487 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-10 02:02:50,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:02:50,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186383267] [2025-01-10 02:02:50,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186383267] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:02:50,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343085799] [2025-01-10 02:02:50,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:02:50,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:02:50,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:02:50,492 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:02:50,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 02:02:50,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-10 02:02:50,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-10 02:02:50,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:02:50,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:02:50,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:02:50,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:03:08,634 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~R~0#1_46| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~R~0#1_46| |v_ULTIMATE.start_main_~R~0#1_46|))) (and (<= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1| 1) .cse0) (<= .cse0 9223372036854775807)))) is different from true [2025-01-10 02:03:08,657 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 2 not checked. [2025-01-10 02:03:08,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:03:08,779 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-10 02:03:08,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343085799] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:03:08,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:03:08,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-01-10 02:03:08,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953919375] [2025-01-10 02:03:08,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:03:08,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 02:03:08,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:03:08,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 02:03:08,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=106, Unknown=6, NotChecked=22, Total=182 [2025-01-10 02:03:08,780 INFO L87 Difference]: Start difference. First operand 576 states and 719 transitions. Second operand has 14 states, 13 states have (on average 12.692307692307692) internal successors, (165), 14 states have internal predecessors, (165), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-01-10 02:03:22,221 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 [0] [2025-01-10 02:03:27,182 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 [0] [2025-01-10 02:03:29,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:03:36,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:03:37,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:03:38,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:03:39,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:03:43,975 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 [0] [2025-01-10 02:03:45,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:03:49,048 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 [0] [2025-01-10 02:03:53,140 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 [0] [2025-01-10 02:03:57,170 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 [0] [2025-01-10 02:04:01,228 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 [0] [2025-01-10 02:04:05,241 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 [0] [2025-01-10 02:04:06,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:04:07,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:04:08,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:04:09,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:04:10,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:04:12,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:04:13,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:04:17,168 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 [0] [2025-01-10 02:04:23,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-10 02:04:27,168 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 [0]