./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc 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_unwindbound1.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 a4e999359b895f3090fa3a0a394d4e8b87ebbe801b1ab5ed9c028edec94c7c83 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 14:00:48,361 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 14:00:48,425 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 14:00:48,430 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 14:00:48,434 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 14:00:48,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 14:00:48,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 14:00:48,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 14:00:48,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 14:00:48,467 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 14:00:48,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 14:00:48,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 14:00:48,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 14:00:48,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 14:00:48,468 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 14:00:48,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 14:00:48,469 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 14:00:48,469 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 14:00:48,469 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 14:00:48,469 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 14:00:48,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 14:00:48,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 14:00:48,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 14:00:48,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 14:00:48,470 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 14:00:48,470 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 14:00:48,470 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 14:00:48,470 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 14:00:48,470 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 14:00:48,470 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 14:00:48,471 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 14:00:48,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 14:00:48,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 14:00:48,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 14:00:48,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:00:48,471 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 14:00:48,471 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 14:00:48,471 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 14:00:48,472 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 14:00:48,472 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 14:00:48,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 14:00:48,472 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 14:00:48,472 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 14:00:48,472 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 14:00:48,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 14:00:48,472 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 -> a4e999359b895f3090fa3a0a394d4e8b87ebbe801b1ab5ed9c028edec94c7c83 [2025-02-06 14:00:48,739 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 14:00:48,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 14:00:48,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 14:00:48,751 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 14:00:48,751 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 14:00:48,753 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_unwindbound1.c [2025-02-06 14:00:49,968 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/964fa17bd/d931724cf44548369fbea90637d20cb3/FLAG54ae8cd29 [2025-02-06 14:00:50,225 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 14:00:50,226 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound1.c [2025-02-06 14:00:50,239 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/964fa17bd/d931724cf44548369fbea90637d20cb3/FLAG54ae8cd29 [2025-02-06 14:00:50,554 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/964fa17bd/d931724cf44548369fbea90637d20cb3 [2025-02-06 14:00:50,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 14:00:50,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 14:00:50,560 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 14:00:50,560 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 14:00:50,563 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 14:00:50,564 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:00:50" (1/1) ... [2025-02-06 14:00:50,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1998856b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:00:50, skipping insertion in model container [2025-02-06 14:00:50,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:00:50" (1/1) ... [2025-02-06 14:00:50,576 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 14:00:50,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:00:50,717 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 14:00:50,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:00:50,743 INFO L204 MainTranslator]: Completed translation [2025-02-06 14:00:50,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:00:50 WrapperNode [2025-02-06 14:00:50,744 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 14:00:50,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 14:00:50,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 14:00:50,744 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 14:00:50,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:00:50" (1/1) ... [2025-02-06 14:00:50,753 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:00:50" (1/1) ... [2025-02-06 14:00:50,772 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 169 [2025-02-06 14:00:50,773 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 14:00:50,773 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 14:00:50,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 14:00:50,773 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 14:00:50,780 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:00:50" (1/1) ... [2025-02-06 14:00:50,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:00:50" (1/1) ... [2025-02-06 14:00:50,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:00:50" (1/1) ... [2025-02-06 14:00:50,790 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 14:00:50,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:00:50" (1/1) ... [2025-02-06 14:00:50,790 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:00:50" (1/1) ... [2025-02-06 14:00:50,793 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:00:50" (1/1) ... [2025-02-06 14:00:50,794 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:00:50" (1/1) ... [2025-02-06 14:00:50,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:00:50" (1/1) ... [2025-02-06 14:00:50,797 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:00:50" (1/1) ... [2025-02-06 14:00:50,801 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 14:00:50,802 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 14:00:50,805 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 14:00:50,805 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 14:00:50,806 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:00:50" (1/1) ... [2025-02-06 14:00:50,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:00:50,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:00:50,839 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 14:00:50,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 14:00:50,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 14:00:50,863 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 14:00:50,863 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 14:00:50,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 14:00:50,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 14:00:50,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 14:00:50,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 14:00:50,863 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 14:00:50,909 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 14:00:50,910 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 14:00:51,476 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2025-02-06 14:00:51,477 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 14:00:51,496 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 14:00:51,496 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 14:00:51,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:00:51 BoogieIcfgContainer [2025-02-06 14:00:51,497 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 14:00:51,499 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 14:00:51,499 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 14:00:51,503 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 14:00:51,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:00:50" (1/3) ... [2025-02-06 14:00:51,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e8483e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:00:51, skipping insertion in model container [2025-02-06 14:00:51,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:00:50" (2/3) ... [2025-02-06 14:00:51,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e8483e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:00:51, skipping insertion in model container [2025-02-06 14:00:51,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:00:51" (3/3) ... [2025-02-06 14:00:51,505 INFO L128 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound1.c [2025-02-06 14:00:51,523 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 14:00:51,525 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fermat1-ll_unwindbound1.c that has 3 procedures, 227 locations, 1 initial locations, 3 loop locations, and 98 error locations. [2025-02-06 14:00:51,586 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 14:00:51,597 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;@6f2fbdae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 14:00:51,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 98 error locations. [2025-02-06 14:00:51,602 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 120 states have (on average 1.9083333333333334) internal successors, (229), 218 states have internal predecessors, (229), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 14:00:51,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 14:00:51,606 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:00:51,607 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 14:00:51,607 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 14:00:51,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:00:51,612 INFO L85 PathProgramCache]: Analyzing trace with hash 252190, now seen corresponding path program 1 times [2025-02-06 14:00:51,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:00:51,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784879975] [2025-02-06 14:00:51,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:00:51,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:00:51,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 14:00:51,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 14:00:51,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:00:51,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:00:51,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:00:51,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:00:51,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784879975] [2025-02-06 14:00:51,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784879975] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:00:51,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:00:51,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:00:51,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097050405] [2025-02-06 14:00:51,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:00:51,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:00:51,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:00:51,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:00:51,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:00:51,761 INFO L87 Difference]: Start difference. First operand has 227 states, 120 states have (on average 1.9083333333333334) internal successors, (229), 218 states have internal predecessors, (229), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:00:51,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:00:51,854 INFO L93 Difference]: Finished difference Result 427 states and 471 transitions. [2025-02-06 14:00:51,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:00:51,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-06 14:00:51,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:00:51,863 INFO L225 Difference]: With dead ends: 427 [2025-02-06 14:00:51,863 INFO L226 Difference]: Without dead ends: 206 [2025-02-06 14:00:51,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:00:51,870 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 13 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 394 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-02-06 14:00:51,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 394 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:00:51,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-02-06 14:00:51,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2025-02-06 14:00:51,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 115 states have (on average 1.7739130434782608) internal successors, (204), 198 states have internal predecessors, (204), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 14:00:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 214 transitions. [2025-02-06 14:00:51,931 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 214 transitions. Word has length 3 [2025-02-06 14:00:51,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:00:51,932 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 214 transitions. [2025-02-06 14:00:51,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:00:51,932 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 214 transitions. [2025-02-06 14:00:51,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 14:00:51,933 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:00:51,933 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 14:00:51,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 14:00:51,937 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 14:00:51,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:00:51,937 INFO L85 PathProgramCache]: Analyzing trace with hash 7818079, now seen corresponding path program 1 times [2025-02-06 14:00:51,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:00:51,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148385451] [2025-02-06 14:00:51,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:00:51,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:00:51,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 14:00:51,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 14:00:51,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:00:51,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:00:51,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:00:51,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:00:51,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148385451] [2025-02-06 14:00:51,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148385451] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:00:51,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:00:51,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:00:51,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332981308] [2025-02-06 14:00:51,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:00:51,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:00:51,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:00:51,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:00:51,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:00:51,975 INFO L87 Difference]: Start difference. First operand 206 states and 214 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:00:52,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:00:52,043 INFO L93 Difference]: Finished difference Result 206 states and 214 transitions. [2025-02-06 14:00:52,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:00:52,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-06 14:00:52,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:00:52,045 INFO L225 Difference]: With dead ends: 206 [2025-02-06 14:00:52,046 INFO L226 Difference]: Without dead ends: 202 [2025-02-06 14:00:52,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:00:52,048 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 12 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:00:52,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 381 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:00:52,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-06 14:00:52,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-02-06 14:00:52,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 115 states have (on average 1.7391304347826086) internal successors, (200), 194 states have internal predecessors, (200), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 14:00:52,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 210 transitions. [2025-02-06 14:00:52,064 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 210 transitions. Word has length 4 [2025-02-06 14:00:52,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:00:52,064 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 210 transitions. [2025-02-06 14:00:52,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:00:52,064 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 210 transitions. [2025-02-06 14:00:52,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 14:00:52,064 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:00:52,064 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:00:52,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 14:00:52,065 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 14:00:52,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:00:52,065 INFO L85 PathProgramCache]: Analyzing trace with hash 325866139, now seen corresponding path program 1 times [2025-02-06 14:00:52,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:00:52,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944876618] [2025-02-06 14:00:52,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:00:52,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:00:52,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 14:00:52,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 14:00:52,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:00:52,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:00:52,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1565973229] [2025-02-06 14:00:52,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:00:52,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:00:52,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:00:52,083 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:00:52,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 14:00:52,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 14:00:52,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 14:00:52,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:00:52,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:00:52,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 14:00:52,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:00:52,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:00:52,171 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:00:52,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:00:52,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944876618] [2025-02-06 14:00:52,172 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:00:52,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565973229] [2025-02-06 14:00:52,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565973229] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:00:52,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:00:52,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:00:52,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245377502] [2025-02-06 14:00:52,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:00:52,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:00:52,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:00:52,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:00:52,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:00:52,174 INFO L87 Difference]: Start difference. First operand 202 states and 210 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:00:52,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:00:52,219 INFO L93 Difference]: Finished difference Result 202 states and 210 transitions. [2025-02-06 14:00:52,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:00:52,219 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 14:00:52,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:00:52,220 INFO L225 Difference]: With dead ends: 202 [2025-02-06 14:00:52,220 INFO L226 Difference]: Without dead ends: 200 [2025-02-06 14:00:52,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:00:52,221 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 8 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:00:52,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 381 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:00:52,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-02-06 14:00:52,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-02-06 14:00:52,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 115 states have (on average 1.7217391304347827) internal successors, (198), 192 states have internal predecessors, (198), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 14:00:52,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 208 transitions. [2025-02-06 14:00:52,233 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 208 transitions. Word has length 8 [2025-02-06 14:00:52,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:00:52,234 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 208 transitions. [2025-02-06 14:00:52,234 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:00:52,234 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 208 transitions. [2025-02-06 14:00:52,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 14:00:52,234 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:00:52,235 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:00:52,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 14:00:52,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:00:52,441 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 14:00:52,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:00:52,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1205435852, now seen corresponding path program 1 times [2025-02-06 14:00:52,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:00:52,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966472860] [2025-02-06 14:00:52,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:00:52,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:00:52,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 14:00:52,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 14:00:52,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:00:52,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:00:52,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1925297065] [2025-02-06 14:00:52,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:00:52,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:00:52,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:00:52,491 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:00:52,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 14:00:52,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 14:00:52,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 14:00:52,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:00:52,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:00:52,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 14:00:52,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:00:52,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:00:52,598 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:00:52,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:00:52,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966472860] [2025-02-06 14:00:52,598 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:00:52,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925297065] [2025-02-06 14:00:52,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925297065] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:00:52,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:00:52,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:00:52,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759875245] [2025-02-06 14:00:52,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:00:52,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:00:52,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:00:52,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:00:52,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:00:52,600 INFO L87 Difference]: Start difference. First operand 200 states and 208 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:00:52,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:00:52,653 INFO L93 Difference]: Finished difference Result 200 states and 208 transitions. [2025-02-06 14:00:52,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:00:52,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-02-06 14:00:52,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:00:52,656 INFO L225 Difference]: With dead ends: 200 [2025-02-06 14:00:52,656 INFO L226 Difference]: Without dead ends: 198 [2025-02-06 14:00:52,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:00:52,658 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 162 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:00:52,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 188 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:00:52,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-02-06 14:00:52,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2025-02-06 14:00:52,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 115 states have (on average 1.7043478260869565) internal successors, (196), 190 states have internal predecessors, (196), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 14:00:52,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 206 transitions. [2025-02-06 14:00:52,677 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 206 transitions. Word has length 25 [2025-02-06 14:00:52,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:00:52,678 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 206 transitions. [2025-02-06 14:00:52,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:00:52,678 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 206 transitions. [2025-02-06 14:00:52,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 14:00:52,678 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:00:52,678 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:00:52,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 14:00:52,884 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-02-06 14:00:52,884 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 14:00:52,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:00:52,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1286194415, now seen corresponding path program 1 times [2025-02-06 14:00:52,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:00:52,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113231668] [2025-02-06 14:00:52,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:00:52,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:00:52,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 14:00:52,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 14:00:52,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:00:52,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:00:53,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 14:00:53,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:00:53,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113231668] [2025-02-06 14:00:53,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113231668] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:00:53,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796295983] [2025-02-06 14:00:53,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:00:53,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:00:53,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:00:53,142 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:00:53,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 14:00:53,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 14:00:53,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 14:00:53,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:00:53,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:00:53,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 14:00:53,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:00:53,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 14:00:53,330 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:00:53,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796295983] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:00:53,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:00:53,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-06 14:00:53,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109005291] [2025-02-06 14:00:53,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:00:53,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:00:53,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:00:53,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:00:53,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:00:53,331 INFO L87 Difference]: Start difference. First operand 198 states and 206 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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-02-06 14:00:53,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:00:53,478 INFO L93 Difference]: Finished difference Result 198 states and 206 transitions. [2025-02-06 14:00:53,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:00:53,479 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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 26 [2025-02-06 14:00:53,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:00:53,480 INFO L225 Difference]: With dead ends: 198 [2025-02-06 14:00:53,480 INFO L226 Difference]: Without dead ends: 196 [2025-02-06 14:00:53,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:00:53,481 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 161 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:00:53,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 675 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:00:53,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-02-06 14:00:53,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-02-06 14:00:53,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 115 states have (on average 1.6869565217391305) internal successors, (194), 188 states have internal predecessors, (194), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 14:00:53,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 204 transitions. [2025-02-06 14:00:53,493 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 204 transitions. Word has length 26 [2025-02-06 14:00:53,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:00:53,493 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 204 transitions. [2025-02-06 14:00:53,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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-02-06 14:00:53,493 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 204 transitions. [2025-02-06 14:00:53,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 14:00:53,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:00:53,496 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:00:53,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 14:00:53,698 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-02-06 14:00:53,698 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 14:00:53,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:00:53,699 INFO L85 PathProgramCache]: Analyzing trace with hash -917743283, now seen corresponding path program 1 times [2025-02-06 14:00:53,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:00:53,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256778434] [2025-02-06 14:00:53,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:00:53,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:00:53,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 14:00:53,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 14:00:53,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:00:53,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:00:53,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:00:53,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:00:53,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256778434] [2025-02-06 14:00:53,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256778434] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:00:53,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:00:53,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:00:53,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450248478] [2025-02-06 14:00:53,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:00:53,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:00:53,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:00:53,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:00:53,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:00:53,779 INFO L87 Difference]: Start difference. First operand 196 states and 204 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:00:53,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:00:53,822 INFO L93 Difference]: Finished difference Result 275 states and 284 transitions. [2025-02-06 14:00:53,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:00:53,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-02-06 14:00:53,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:00:53,823 INFO L225 Difference]: With dead ends: 275 [2025-02-06 14:00:53,823 INFO L226 Difference]: Without dead ends: 274 [2025-02-06 14:00:53,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:00:53,824 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 84 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:00:53,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 567 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:00:53,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-02-06 14:00:53,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 223. [2025-02-06 14:00:53,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 140 states have (on average 1.6928571428571428) internal successors, (237), 214 states have internal predecessors, (237), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 14:00:53,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 249 transitions. [2025-02-06 14:00:53,836 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 249 transitions. Word has length 28 [2025-02-06 14:00:53,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:00:53,836 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 249 transitions. [2025-02-06 14:00:53,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:00:53,836 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 249 transitions. [2025-02-06 14:00:53,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 14:00:53,837 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:00:53,837 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:00:53,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 14:00:53,837 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 14:00:53,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:00:53,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1614729456, now seen corresponding path program 1 times [2025-02-06 14:00:53,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:00:53,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901266751] [2025-02-06 14:00:53,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:00:53,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:00:53,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 14:00:53,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 14:00:53,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:00:53,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:00:53,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:00:53,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:00:53,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901266751] [2025-02-06 14:00:53,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901266751] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:00:53,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:00:53,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:00:53,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115756527] [2025-02-06 14:00:53,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:00:53,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:00:53,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:00:53,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:00:53,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:00:53,900 INFO L87 Difference]: Start difference. First operand 223 states and 249 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:00:53,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:00:53,936 INFO L93 Difference]: Finished difference Result 252 states and 276 transitions. [2025-02-06 14:00:53,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:00:53,937 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-02-06 14:00:53,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:00:53,939 INFO L225 Difference]: With dead ends: 252 [2025-02-06 14:00:53,939 INFO L226 Difference]: Without dead ends: 223 [2025-02-06 14:00:53,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:00:53,940 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 8 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:00:53,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 570 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:00:53,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-02-06 14:00:53,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2025-02-06 14:00:53,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 140 states have (on average 1.6785714285714286) internal successors, (235), 214 states have internal predecessors, (235), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 14:00:53,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 247 transitions. [2025-02-06 14:00:53,955 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 247 transitions. Word has length 29 [2025-02-06 14:00:53,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:00:53,955 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 247 transitions. [2025-02-06 14:00:53,956 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:00:53,956 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 247 transitions. [2025-02-06 14:00:53,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 14:00:53,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:00:53,959 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:00:53,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 14:00:53,960 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 14:00:53,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:00:53,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1271818318, now seen corresponding path program 1 times [2025-02-06 14:00:53,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:00:53,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618661072] [2025-02-06 14:00:53,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:00:53,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:00:53,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 14:00:54,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 14:00:54,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:00:54,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:00:54,055 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:00:54,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:00:54,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618661072] [2025-02-06 14:00:54,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618661072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:00:54,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:00:54,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:00:54,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078618173] [2025-02-06 14:00:54,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:00:54,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:00:54,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:00:54,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:00:54,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:00:54,058 INFO L87 Difference]: Start difference. First operand 223 states and 247 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:00:54,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:00:54,134 INFO L93 Difference]: Finished difference Result 275 states and 301 transitions. [2025-02-06 14:00:54,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:00:54,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-02-06 14:00:54,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:00:54,136 INFO L225 Difference]: With dead ends: 275 [2025-02-06 14:00:54,137 INFO L226 Difference]: Without dead ends: 272 [2025-02-06 14:00:54,138 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-02-06 14:00:54,138 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 141 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:00:54,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 274 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:00:54,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-02-06 14:00:54,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 238. [2025-02-06 14:00:54,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 155 states have (on average 1.664516129032258) internal successors, (258), 229 states have internal predecessors, (258), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 14:00:54,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 270 transitions. [2025-02-06 14:00:54,152 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 270 transitions. Word has length 31 [2025-02-06 14:00:54,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:00:54,153 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 270 transitions. [2025-02-06 14:00:54,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:00:54,153 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 270 transitions. [2025-02-06 14:00:54,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 14:00:54,154 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:00:54,154 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:00:54,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 14:00:54,155 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 14:00:54,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:00:54,156 INFO L85 PathProgramCache]: Analyzing trace with hash 771662345, now seen corresponding path program 1 times [2025-02-06 14:00:54,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:00:54,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269420315] [2025-02-06 14:00:54,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:00:54,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:00:54,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 14:00:54,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 14:00:54,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:00:54,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:00:54,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:00:54,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:00:54,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269420315] [2025-02-06 14:00:54,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269420315] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:00:54,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:00:54,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:00:54,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617994937] [2025-02-06 14:00:54,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:00:54,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:00:54,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:00:54,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:00:54,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:00:54,207 INFO L87 Difference]: Start difference. First operand 238 states and 270 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:00:54,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:00:54,339 INFO L93 Difference]: Finished difference Result 278 states and 303 transitions. [2025-02-06 14:00:54,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:00:54,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-02-06 14:00:54,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:00:54,341 INFO L225 Difference]: With dead ends: 278 [2025-02-06 14:00:54,341 INFO L226 Difference]: Without dead ends: 275 [2025-02-06 14:00:54,341 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-02-06 14:00:54,342 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 151 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:00:54,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 431 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:00:54,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-02-06 14:00:54,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 241. [2025-02-06 14:00:54,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 158 states have (on average 1.6455696202531647) internal successors, (260), 232 states have internal predecessors, (260), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 14:00:54,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 272 transitions. [2025-02-06 14:00:54,358 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 272 transitions. Word has length 32 [2025-02-06 14:00:54,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:00:54,359 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 272 transitions. [2025-02-06 14:00:54,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:00:54,359 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 272 transitions. [2025-02-06 14:00:54,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-06 14:00:54,360 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:00:54,360 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:00:54,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 14:00:54,360 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 14:00:54,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:00:54,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1848270932, now seen corresponding path program 1 times [2025-02-06 14:00:54,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:00:54,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530615148] [2025-02-06 14:00:54,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:00:54,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:00:54,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 14:00:54,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 14:00:54,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:00:54,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:00:54,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [51265909] [2025-02-06 14:00:54,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:00:54,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:00:54,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:00:54,383 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:00:54,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 14:00:54,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 14:00:54,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 14:00:54,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:00:54,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:00:54,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 14:00:54,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:00:54,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:00:54,468 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:00:54,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:00:54,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530615148] [2025-02-06 14:00:54,469 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:00:54,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51265909] [2025-02-06 14:00:54,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51265909] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:00:54,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:00:54,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:00:54,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353832246] [2025-02-06 14:00:54,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:00:54,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:00:54,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:00:54,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:00:54,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:00:54,470 INFO L87 Difference]: Start difference. First operand 241 states and 272 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:00:54,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:00:54,585 INFO L93 Difference]: Finished difference Result 390 states and 436 transitions. [2025-02-06 14:00:54,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:00:54,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2025-02-06 14:00:54,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:00:54,588 INFO L225 Difference]: With dead ends: 390 [2025-02-06 14:00:54,588 INFO L226 Difference]: Without dead ends: 387 [2025-02-06 14:00:54,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:00:54,589 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 139 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:00:54,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 368 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:00:54,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-02-06 14:00:54,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 313. [2025-02-06 14:00:54,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 227 states have (on average 1.669603524229075) internal successors, (379), 301 states have internal predecessors, (379), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 14:00:54,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 397 transitions. [2025-02-06 14:00:54,612 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 397 transitions. Word has length 33 [2025-02-06 14:00:54,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:00:54,612 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 397 transitions. [2025-02-06 14:00:54,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:00:54,612 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 397 transitions. [2025-02-06 14:00:54,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-06 14:00:54,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:00:54,613 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:00:54,620 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-02-06 14:00:54,813 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,SelfDestructingSolverStorable9 [2025-02-06 14:00:54,814 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 14:00:54,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:00:54,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1461823897, now seen corresponding path program 1 times [2025-02-06 14:00:54,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:00:54,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894331538] [2025-02-06 14:00:54,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:00:54,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:00:54,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 14:00:54,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 14:00:54,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:00:54,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:00:54,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 14:00:54,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:00:54,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894331538] [2025-02-06 14:00:54,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894331538] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:00:54,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506321187] [2025-02-06 14:00:54,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:00:54,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:00:54,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:00:54,953 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-02-06 14:00:54,957 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-02-06 14:00:54,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 14:00:54,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 14:00:54,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:00:54,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:00:54,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 14:00:54,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:00:55,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 14:00:55,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:00:55,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 14:00:55,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506321187] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:00:55,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:00:55,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-02-06 14:00:55,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069955635] [2025-02-06 14:00:55,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:00:55,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 14:00:55,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:00:55,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 14:00:55,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-02-06 14:00:55,450 INFO L87 Difference]: Start difference. First operand 313 states and 397 transitions. Second operand has 14 states, 13 states have (on average 6.0) internal successors, (78), 14 states have internal predecessors, (78), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 14:00:55,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:00:55,843 INFO L93 Difference]: Finished difference Result 430 states and 471 transitions. [2025-02-06 14:00:55,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 14:00:55,843 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.0) internal successors, (78), 14 states have internal predecessors, (78), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2025-02-06 14:00:55,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:00:55,845 INFO L225 Difference]: With dead ends: 430 [2025-02-06 14:00:55,846 INFO L226 Difference]: Without dead ends: 427 [2025-02-06 14:00:55,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-02-06 14:00:55,846 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 689 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 14:00:55,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1091 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 14:00:55,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-02-06 14:00:55,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 319. [2025-02-06 14:00:55,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 233 states have (on average 1.648068669527897) internal successors, (384), 307 states have internal predecessors, (384), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 14:00:55,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 402 transitions. [2025-02-06 14:00:55,866 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 402 transitions. Word has length 34 [2025-02-06 14:00:55,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:00:55,866 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 402 transitions. [2025-02-06 14:00:55,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.0) internal successors, (78), 14 states have internal predecessors, (78), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 14:00:55,867 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 402 transitions. [2025-02-06 14:00:55,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 14:00:55,867 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:00:55,867 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:00:55,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 14:00:56,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 14:00:56,072 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 14:00:56,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:00:56,072 INFO L85 PathProgramCache]: Analyzing trace with hash -358454587, now seen corresponding path program 1 times [2025-02-06 14:00:56,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:00:56,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021227586] [2025-02-06 14:00:56,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:00:56,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:00:56,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 14:00:56,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 14:00:56,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:00:56,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:00:56,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [58506216] [2025-02-06 14:00:56,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:00:56,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:00:56,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:00:56,093 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-02-06 14:00:56,097 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-02-06 14:00:56,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 14:00:56,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 14:00:56,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:00:56,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:00:56,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 14:00:56,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:00:56,333 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 14:00:56,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:00:56,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:00:56,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021227586] [2025-02-06 14:00:56,445 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:00:56,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58506216] [2025-02-06 14:00:56,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58506216] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:00:56,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:00:56,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-02-06 14:00:56,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419465313] [2025-02-06 14:00:56,446 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-06 14:00:56,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:00:56,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:00:56,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:00:56,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:00:56,447 INFO L87 Difference]: Start difference. First operand 319 states and 402 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 14:00:59,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:00:59,029 INFO L93 Difference]: Finished difference Result 499 states and 616 transitions. [2025-02-06 14:00:59,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 14:00:59,029 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2025-02-06 14:00:59,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:00:59,032 INFO L225 Difference]: With dead ends: 499 [2025-02-06 14:00:59,032 INFO L226 Difference]: Without dead ends: 472 [2025-02-06 14:00:59,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-02-06 14:00:59,033 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 428 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-06 14:00:59,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 520 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-06 14:00:59,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-02-06 14:00:59,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 438. [2025-02-06 14:00:59,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 349 states have (on average 1.5501432664756447) internal successors, (541), 423 states have internal predecessors, (541), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 14:00:59,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 565 transitions. [2025-02-06 14:00:59,062 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 565 transitions. Word has length 36 [2025-02-06 14:00:59,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:00:59,062 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 565 transitions. [2025-02-06 14:00:59,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 14:00:59,062 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 565 transitions. [2025-02-06 14:00:59,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-06 14:00:59,063 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:00:59,063 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:00:59,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 14:00:59,264 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,SelfDestructingSolverStorable11 [2025-02-06 14:00:59,264 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 14:00:59,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:00:59,265 INFO L85 PathProgramCache]: Analyzing trace with hash -877469917, now seen corresponding path program 1 times [2025-02-06 14:00:59,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:00:59,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943499281] [2025-02-06 14:00:59,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:00:59,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:00:59,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 14:00:59,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 14:00:59,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:00:59,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 14:00:59,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1890222906] [2025-02-06 14:00:59,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:00:59,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:00:59,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:00:59,281 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-02-06 14:00:59,284 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-02-06 14:00:59,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 14:00:59,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 14:00:59,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:00:59,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:00:59,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 14:00:59,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:00:59,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:00:59,351 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:00:59,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:00:59,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943499281] [2025-02-06 14:00:59,351 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 14:00:59,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890222906] [2025-02-06 14:00:59,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890222906] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:00:59,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:00:59,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:00:59,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183459921] [2025-02-06 14:00:59,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:00:59,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:00:59,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:00:59,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:00:59,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:00:59,353 INFO L87 Difference]: Start difference. First operand 438 states and 565 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:00:59,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:00:59,572 INFO L93 Difference]: Finished difference Result 630 states and 798 transitions. [2025-02-06 14:00:59,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:00:59,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2025-02-06 14:00:59,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:00:59,575 INFO L225 Difference]: With dead ends: 630 [2025-02-06 14:00:59,575 INFO L226 Difference]: Without dead ends: 589 [2025-02-06 14:00:59,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:00:59,576 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 117 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:00:59,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 271 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:00:59,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-02-06 14:00:59,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 557. [2025-02-06 14:00:59,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 465 states have (on average 1.4903225806451612) internal successors, (693), 539 states have internal predecessors, (693), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 14:00:59,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 723 transitions. [2025-02-06 14:00:59,603 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 723 transitions. Word has length 38 [2025-02-06 14:00:59,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:00:59,603 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 723 transitions. [2025-02-06 14:00:59,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:00:59,603 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 723 transitions. [2025-02-06 14:00:59,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-06 14:00:59,604 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:00:59,604 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:00:59,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 14:00:59,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:00:59,805 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 14:00:59,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:00:59,805 INFO L85 PathProgramCache]: Analyzing trace with hash -632926895, now seen corresponding path program 1 times [2025-02-06 14:00:59,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:00:59,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501910275] [2025-02-06 14:00:59,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:00:59,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:00:59,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 14:00:59,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 14:00:59,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:00:59,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:00:59,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:00:59,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:00:59,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501910275] [2025-02-06 14:00:59,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501910275] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:00:59,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:00:59,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 14:00:59,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228596925] [2025-02-06 14:00:59,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:00:59,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:00:59,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:00:59,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:00:59,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:00:59,916 INFO L87 Difference]: Start difference. First operand 557 states and 723 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:01:00,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:01:00,008 INFO L93 Difference]: Finished difference Result 1076 states and 1409 transitions. [2025-02-06 14:01:00,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:01:00,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2025-02-06 14:01:00,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:01:00,012 INFO L225 Difference]: With dead ends: 1076 [2025-02-06 14:01:00,012 INFO L226 Difference]: Without dead ends: 568 [2025-02-06 14:01:00,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:01:00,016 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 22 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:01:00,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 942 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:01:00,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-02-06 14:01:00,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 562. [2025-02-06 14:01:00,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 470 states have (on average 1.4872340425531916) internal successors, (699), 543 states have internal predecessors, (699), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 14:01:00,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 729 transitions. [2025-02-06 14:01:00,045 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 729 transitions. Word has length 56 [2025-02-06 14:01:00,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:01:00,045 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 729 transitions. [2025-02-06 14:01:00,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:01:00,046 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 729 transitions. [2025-02-06 14:01:00,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-06 14:01:00,046 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:01:00,046 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:01:00,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 14:01:00,047 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 14:01:00,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:01:00,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1854102845, now seen corresponding path program 1 times [2025-02-06 14:01:00,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:01:00,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109840723] [2025-02-06 14:01:00,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:01:00,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:01:00,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 14:01:00,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 14:01:00,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:01:00,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:01:00,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:01:00,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:01:00,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109840723] [2025-02-06 14:01:00,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109840723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:01:00,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:01:00,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:01:00,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23624267] [2025-02-06 14:01:00,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:01:00,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:01:00,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:01:00,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:01:00,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:01:00,125 INFO L87 Difference]: Start difference. First operand 562 states and 729 transitions. Second operand has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:01:00,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:01:00,208 INFO L93 Difference]: Finished difference Result 626 states and 799 transitions. [2025-02-06 14:01:00,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 14:01:00,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 57 [2025-02-06 14:01:00,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:01:00,212 INFO L225 Difference]: With dead ends: 626 [2025-02-06 14:01:00,213 INFO L226 Difference]: Without dead ends: 625 [2025-02-06 14:01:00,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:01:00,215 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 78 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:01:00,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 772 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:01:00,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2025-02-06 14:01:00,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 566. [2025-02-06 14:01:00,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 473 states have (on average 1.4735729386892178) internal successors, (697), 546 states have internal predecessors, (697), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 14:01:00,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 727 transitions. [2025-02-06 14:01:00,248 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 727 transitions. Word has length 57 [2025-02-06 14:01:00,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:01:00,248 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 727 transitions. [2025-02-06 14:01:00,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:01:00,248 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 727 transitions. [2025-02-06 14:01:00,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 14:01:00,251 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:01:00,251 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:01:00,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 14:01:00,251 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 14:01:00,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:01:00,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1996431826, now seen corresponding path program 1 times [2025-02-06 14:01:00,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:01:00,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622936342] [2025-02-06 14:01:00,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:01:00,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:01:00,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 14:01:00,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 14:01:00,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:01:00,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:01:00,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:01:00,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:01:00,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622936342] [2025-02-06 14:01:00,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622936342] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:01:00,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:01:00,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:01:00,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634134977] [2025-02-06 14:01:00,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:01:00,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:01:00,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:01:00,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:01:00,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:01:00,344 INFO L87 Difference]: Start difference. First operand 566 states and 727 transitions. Second operand has 5 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:01:00,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:01:00,415 INFO L93 Difference]: Finished difference Result 1112 states and 1451 transitions. [2025-02-06 14:01:00,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:01:00,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 60 [2025-02-06 14:01:00,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:01:00,419 INFO L225 Difference]: With dead ends: 1112 [2025-02-06 14:01:00,420 INFO L226 Difference]: Without dead ends: 600 [2025-02-06 14:01:00,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:01:00,422 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 10 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:01:00,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 779 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:01:00,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-02-06 14:01:00,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 582. [2025-02-06 14:01:00,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 489 states have (on average 1.456032719836401) internal successors, (712), 562 states have internal predecessors, (712), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 14:01:00,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 742 transitions. [2025-02-06 14:01:00,453 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 742 transitions. Word has length 60 [2025-02-06 14:01:00,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:01:00,453 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 742 transitions. [2025-02-06 14:01:00,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.75) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:01:00,453 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 742 transitions. [2025-02-06 14:01:00,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-06 14:01:00,454 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:01:00,454 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:01:00,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 14:01:00,454 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 14:01:00,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:01:00,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1759844407, now seen corresponding path program 1 times [2025-02-06 14:01:00,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:01:00,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120978652] [2025-02-06 14:01:00,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:01:00,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:01:00,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-06 14:01:00,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 14:01:00,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:01:00,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:01:00,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:01:00,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:01:00,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120978652] [2025-02-06 14:01:00,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120978652] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:01:00,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:01:00,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 14:01:00,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658374046] [2025-02-06 14:01:00,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:01:00,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 14:01:00,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:01:00,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 14:01:00,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 14:01:00,543 INFO L87 Difference]: Start difference. First operand 582 states and 742 transitions. Second operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:01:00,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:01:00,681 INFO L93 Difference]: Finished difference Result 720 states and 906 transitions. [2025-02-06 14:01:00,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 14:01:00,681 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 61 [2025-02-06 14:01:00,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:01:00,685 INFO L225 Difference]: With dead ends: 720 [2025-02-06 14:01:00,685 INFO L226 Difference]: Without dead ends: 719 [2025-02-06 14:01:00,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-06 14:01:00,686 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 133 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:01:00,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1133 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 14:01:00,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2025-02-06 14:01:00,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 624. [2025-02-06 14:01:00,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 528 states have (on average 1.4526515151515151) internal successors, (767), 601 states have internal predecessors, (767), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 14:01:00,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 801 transitions. [2025-02-06 14:01:00,720 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 801 transitions. Word has length 61 [2025-02-06 14:01:00,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:01:00,720 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 801 transitions. [2025-02-06 14:01:00,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:01:00,720 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 801 transitions. [2025-02-06 14:01:00,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-06 14:01:00,721 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:01:00,721 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-06 14:01:00,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 14:01:00,721 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 14:01:00,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:01:00,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1141110379, now seen corresponding path program 1 times [2025-02-06 14:01:00,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:01:00,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876675763] [2025-02-06 14:01:00,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:01:00,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:01:00,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 14:01:00,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 14:01:00,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:01:00,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:01:00,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:01:00,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:01:00,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876675763] [2025-02-06 14:01:00,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876675763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:01:00,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:01:00,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:01:00,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213141392] [2025-02-06 14:01:00,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:01:00,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 14:01:00,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:01:00,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 14:01:00,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:01:00,808 INFO L87 Difference]: Start difference. First operand 624 states and 801 transitions. Second operand has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:01:00,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:01:00,844 INFO L93 Difference]: Finished difference Result 633 states and 811 transitions. [2025-02-06 14:01:00,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:01:00,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 64 [2025-02-06 14:01:00,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:01:00,845 INFO L225 Difference]: With dead ends: 633 [2025-02-06 14:01:00,845 INFO L226 Difference]: Without dead ends: 62 [2025-02-06 14:01:00,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:01:00,848 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 5 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:01:00,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 211 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:01:00,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-06 14:01:00,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-02-06 14:01:00,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 56 states have (on average 1.0) internal successors, (56), 56 states have internal predecessors, (56), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 14:01:00,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2025-02-06 14:01:00,855 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 64 [2025-02-06 14:01:00,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:01:00,855 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2025-02-06 14:01:00,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 14:01:00,855 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2025-02-06 14:01:00,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-06 14:01:00,856 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:01:00,856 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:01:00,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 14:01:00,856 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-02-06 14:01:00,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:01:00,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1014683538, now seen corresponding path program 1 times [2025-02-06 14:01:00,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:01:00,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146685224] [2025-02-06 14:01:00,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:01:00,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:01:00,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 14:01:00,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 14:01:00,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:01:00,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:01:00,968 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 14:01:00,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:01:00,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146685224] [2025-02-06 14:01:00,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146685224] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:01:00,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:01:00,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 14:01:00,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073809276] [2025-02-06 14:01:00,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:01:00,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 14:01:00,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:01:00,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 14:01:00,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 14:01:00,970 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:01:01,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:01:01,078 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2025-02-06 14:01:01,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 14:01:01,078 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2025-02-06 14:01:01,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:01:01,079 INFO L225 Difference]: With dead ends: 62 [2025-02-06 14:01:01,079 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 14:01:01,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-02-06 14:01:01,080 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 39 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 14:01:01,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 224 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 14:01:01,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 14:01:01,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 14:01:01,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:01:01,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 14:01:01,081 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2025-02-06 14:01:01,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:01:01,081 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 14:01:01,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:01:01,081 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 14:01:01,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 14:01:01,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 98 remaining) [2025-02-06 14:01:01,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 98 remaining) [2025-02-06 14:01:01,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 98 remaining) [2025-02-06 14:01:01,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 98 remaining) [2025-02-06 14:01:01,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 98 remaining) [2025-02-06 14:01:01,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 98 remaining) [2025-02-06 14:01:01,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 98 remaining) [2025-02-06 14:01:01,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 98 remaining) [2025-02-06 14:01:01,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 98 remaining) [2025-02-06 14:01:01,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 98 remaining) [2025-02-06 14:01:01,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 98 remaining) [2025-02-06 14:01:01,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 98 remaining) [2025-02-06 14:01:01,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 98 remaining) [2025-02-06 14:01:01,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 98 remaining) [2025-02-06 14:01:01,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 98 remaining) [2025-02-06 14:01:01,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 98 remaining) [2025-02-06 14:01:01,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 98 remaining) [2025-02-06 14:01:01,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 98 remaining) [2025-02-06 14:01:01,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 98 remaining) [2025-02-06 14:01:01,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 98 remaining) [2025-02-06 14:01:01,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 98 remaining) [2025-02-06 14:01:01,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 98 remaining) [2025-02-06 14:01:01,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 98 remaining) [2025-02-06 14:01:01,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 98 remaining) [2025-02-06 14:01:01,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 98 remaining) [2025-02-06 14:01:01,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 98 remaining) [2025-02-06 14:01:01,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 98 remaining) [2025-02-06 14:01:01,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 98 remaining) [2025-02-06 14:01:01,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 98 remaining) [2025-02-06 14:01:01,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 98 remaining) [2025-02-06 14:01:01,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 98 remaining) [2025-02-06 14:01:01,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 98 remaining) [2025-02-06 14:01:01,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 98 remaining) [2025-02-06 14:01:01,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 98 remaining) [2025-02-06 14:01:01,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 98 remaining) [2025-02-06 14:01:01,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 98 remaining) [2025-02-06 14:01:01,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 98 remaining) [2025-02-06 14:01:01,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 98 remaining) [2025-02-06 14:01:01,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 98 remaining) [2025-02-06 14:01:01,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 98 remaining) [2025-02-06 14:01:01,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 98 remaining) [2025-02-06 14:01:01,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 98 remaining) [2025-02-06 14:01:01,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 98 remaining) [2025-02-06 14:01:01,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 98 remaining) [2025-02-06 14:01:01,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 98 remaining) [2025-02-06 14:01:01,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 98 remaining) [2025-02-06 14:01:01,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 98 remaining) [2025-02-06 14:01:01,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 98 remaining) [2025-02-06 14:01:01,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 98 remaining) [2025-02-06 14:01:01,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 98 remaining) [2025-02-06 14:01:01,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 98 remaining) [2025-02-06 14:01:01,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 98 remaining) [2025-02-06 14:01:01,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 98 remaining) [2025-02-06 14:01:01,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 98 remaining) [2025-02-06 14:01:01,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 98 remaining) [2025-02-06 14:01:01,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 98 remaining) [2025-02-06 14:01:01,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 98 remaining) [2025-02-06 14:01:01,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 98 remaining) [2025-02-06 14:01:01,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 98 remaining) [2025-02-06 14:01:01,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 98 remaining) [2025-02-06 14:01:01,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 98 remaining) [2025-02-06 14:01:01,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 98 remaining) [2025-02-06 14:01:01,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 98 remaining) [2025-02-06 14:01:01,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 98 remaining) [2025-02-06 14:01:01,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 98 remaining) [2025-02-06 14:01:01,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 98 remaining) [2025-02-06 14:01:01,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 98 remaining) [2025-02-06 14:01:01,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 98 remaining) [2025-02-06 14:01:01,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 98 remaining) [2025-02-06 14:01:01,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 98 remaining) [2025-02-06 14:01:01,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 98 remaining) [2025-02-06 14:01:01,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 98 remaining) [2025-02-06 14:01:01,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 98 remaining) [2025-02-06 14:01:01,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 98 remaining) [2025-02-06 14:01:01,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 98 remaining) [2025-02-06 14:01:01,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 98 remaining) [2025-02-06 14:01:01,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 98 remaining) [2025-02-06 14:01:01,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 98 remaining) [2025-02-06 14:01:01,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 98 remaining) [2025-02-06 14:01:01,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 98 remaining) [2025-02-06 14:01:01,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 98 remaining) [2025-02-06 14:01:01,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 98 remaining) [2025-02-06 14:01:01,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 98 remaining) [2025-02-06 14:01:01,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 98 remaining) [2025-02-06 14:01:01,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 98 remaining) [2025-02-06 14:01:01,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 98 remaining) [2025-02-06 14:01:01,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 98 remaining) [2025-02-06 14:01:01,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 98 remaining) [2025-02-06 14:01:01,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 98 remaining) [2025-02-06 14:01:01,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 98 remaining) [2025-02-06 14:01:01,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 98 remaining) [2025-02-06 14:01:01,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 98 remaining) [2025-02-06 14:01:01,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 98 remaining) [2025-02-06 14:01:01,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 98 remaining) [2025-02-06 14:01:01,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 98 remaining) [2025-02-06 14:01:01,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 98 remaining) [2025-02-06 14:01:01,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 98 remaining) [2025-02-06 14:01:01,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 98 remaining) [2025-02-06 14:01:01,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 14:01:01,095 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:01:01,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 14:01:01,604 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 14:01:01,617 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-02-06 14:01:01,617 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-02-06 14:01:01,622 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-02-06 14:01:01,624 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-02-06 14:01:01,625 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-02-06 14:01:01,625 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-02-06 14:01:01,626 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-02-06 14:01:01,628 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-02-06 14:01:01,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:01:01 BoogieIcfgContainer [2025-02-06 14:01:01,629 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 14:01:01,630 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 14:01:01,631 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 14:01:01,632 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 14:01:01,632 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:00:51" (3/4) ... [2025-02-06 14:01:01,635 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 14:01:01,640 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-06 14:01:01,641 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-02-06 14:01:01,647 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-02-06 14:01:01,647 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 14:01:01,647 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 14:01:01,648 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 14:01:01,746 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 14:01:01,748 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 14:01:01,748 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 14:01:01,749 INFO L158 Benchmark]: Toolchain (without parser) took 11191.11ms. Allocated memory is still 167.8MB. Free memory was 123.9MB in the beginning and 44.5MB in the end (delta: 79.4MB). Peak memory consumption was 77.9MB. Max. memory is 16.1GB. [2025-02-06 14:01:01,749 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:01:01,749 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.16ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 112.0MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:01:01,750 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.55ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 110.1MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:01:01,751 INFO L158 Benchmark]: Boogie Preprocessor took 27.97ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 108.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 14:01:01,751 INFO L158 Benchmark]: IcfgBuilder took 694.93ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 80.0MB in the end (delta: 28.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 14:01:01,751 INFO L158 Benchmark]: TraceAbstraction took 10130.51ms. Allocated memory is still 167.8MB. Free memory was 80.0MB in the beginning and 52.8MB in the end (delta: 27.2MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2025-02-06 14:01:01,751 INFO L158 Benchmark]: Witness Printer took 118.25ms. Allocated memory is still 167.8MB. Free memory was 52.8MB in the beginning and 44.5MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 14:01:01,753 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.16ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 112.0MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.55ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 110.1MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.97ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 108.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 694.93ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 80.0MB in the end (delta: 28.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10130.51ms. Allocated memory is still 167.8MB. Free memory was 80.0MB in the beginning and 52.8MB in the end (delta: 27.2MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. * Witness Printer took 118.25ms. Allocated memory is still 167.8MB. Free memory was 52.8MB in the beginning and 44.5MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 227 locations, 98 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2433 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2400 mSDsluCounter, 10172 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6884 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1979 IncrementalHoareTripleChecker+Invalid, 2096 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 3288 mSDtfsCounter, 1979 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 332 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=624occurred in iteration=17, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 545 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 890 NumberOfCodeBlocks, 890 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 762 ConstructedInterpolants, 15 QuantifiedInterpolants, 2923 SizeOfPredicates, 2 NumberOfNonLiveVariables, 467 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 22 InterpolantComputations, 17 PerfectInterpolantSequences, 66/81 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 98 specifications checked. All of them hold - InvariantResult [Line: 34]: Location Invariant Derived location invariant: ((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (v == 1)) && (A <= 2147483647)) && (counter == 2)) - InvariantResult [Line: 34]: Location Invariant Derived location invariant: ((((((((2 <= counter) && (((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0)) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && (counter <= 3)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (v == 1)) && (A <= 2147483647)) || ((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (v == 1)) && (counter == 0)) && (A <= 2147483647))) - InvariantResult [Line: 39]: Location Invariant Derived location invariant: ((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (v == 1)) && (A <= 2147483647)) && (counter == 1)) RESULT: Ultimate proved your program to be correct! [2025-02-06 14:01:01,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE