./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-restricted-15/b.09_assume.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-restricted-15/b.09_assume.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash ecd53fc1983ec7221b54e3467b23316f260ef4286a86531362dd236dd661ea1a --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 09:02:48,792 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 09:02:48,844 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-08 09:02:48,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 09:02:48,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 09:02:48,874 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 09:02:48,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 09:02:48,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 09:02:48,876 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 09:02:48,876 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 09:02:48,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 09:02:48,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 09:02:48,877 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 09:02:48,877 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 09:02:48,877 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 09:02:48,877 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 09:02:48,877 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 09:02:48,878 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 09:02:48,878 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 09:02:48,878 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 09:02:48,878 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 09:02:48,878 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 09:02:48,878 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 09:02:48,878 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 09:02:48,878 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 09:02:48,879 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 09:02:48,879 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 09:02:48,879 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 09:02:48,879 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 09:02:48,879 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 09:02:48,879 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 09:02:48,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:02:48,879 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 09:02:48,879 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 09:02:48,880 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 09:02:48,880 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 09:02:48,880 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 09:02:48,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 09:02:48,880 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 09:02:48,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 09:02:48,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 09:02:48,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 09:02:48,880 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ecd53fc1983ec7221b54e3467b23316f260ef4286a86531362dd236dd661ea1a [2025-02-08 09:02:49,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 09:02:49,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 09:02:49,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 09:02:49,111 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 09:02:49,111 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 09:02:49,113 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/b.09_assume.c [2025-02-08 09:02:50,199 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/33b700e98/6047f698f82f41d1981ff70b58e40cd1/FLAG5aa5cfafb [2025-02-08 09:02:50,414 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 09:02:50,416 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/b.09_assume.c [2025-02-08 09:02:50,421 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/33b700e98/6047f698f82f41d1981ff70b58e40cd1/FLAG5aa5cfafb [2025-02-08 09:02:50,433 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/33b700e98/6047f698f82f41d1981ff70b58e40cd1 [2025-02-08 09:02:50,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 09:02:50,436 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 09:02:50,437 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 09:02:50,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 09:02:50,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 09:02:50,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:02:50" (1/1) ... [2025-02-08 09:02:50,441 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dcff55c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:02:50, skipping insertion in model container [2025-02-08 09:02:50,441 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:02:50" (1/1) ... [2025-02-08 09:02:50,450 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 09:02:50,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:02:50,550 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 09:02:50,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:02:50,570 INFO L204 MainTranslator]: Completed translation [2025-02-08 09:02:50,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:02:50 WrapperNode [2025-02-08 09:02:50,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 09:02:50,572 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 09:02:50,572 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 09:02:50,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 09:02:50,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:02:50" (1/1) ... [2025-02-08 09:02:50,578 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:02:50" (1/1) ... [2025-02-08 09:02:50,587 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2025-02-08 09:02:50,589 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 09:02:50,589 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 09:02:50,589 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 09:02:50,589 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 09:02:50,594 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:02:50" (1/1) ... [2025-02-08 09:02:50,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:02:50" (1/1) ... [2025-02-08 09:02:50,595 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:02:50" (1/1) ... [2025-02-08 09:02:50,599 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-08 09:02:50,600 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:02:50" (1/1) ... [2025-02-08 09:02:50,600 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:02:50" (1/1) ... [2025-02-08 09:02:50,602 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:02:50" (1/1) ... [2025-02-08 09:02:50,602 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:02:50" (1/1) ... [2025-02-08 09:02:50,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:02:50" (1/1) ... [2025-02-08 09:02:50,605 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:02:50" (1/1) ... [2025-02-08 09:02:50,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 09:02:50,606 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 09:02:50,606 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 09:02:50,606 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 09:02:50,607 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:02:50" (1/1) ... [2025-02-08 09:02:50,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:02:50,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:02:50,636 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 09:02:50,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 09:02:50,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 09:02:50,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 09:02:50,716 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 09:02:50,717 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 09:02:50,789 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-08 09:02:50,790 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 09:02:50,798 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 09:02:50,798 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 09:02:50,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:02:50 BoogieIcfgContainer [2025-02-08 09:02:50,798 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 09:02:50,801 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 09:02:50,801 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 09:02:50,804 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 09:02:50,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 09:02:50" (1/3) ... [2025-02-08 09:02:50,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d8a4e87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:02:50, skipping insertion in model container [2025-02-08 09:02:50,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:02:50" (2/3) ... [2025-02-08 09:02:50,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d8a4e87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:02:50, skipping insertion in model container [2025-02-08 09:02:50,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:02:50" (3/3) ... [2025-02-08 09:02:50,808 INFO L128 eAbstractionObserver]: Analyzing ICFG b.09_assume.c [2025-02-08 09:02:50,819 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 09:02:50,821 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG b.09_assume.c that has 1 procedures, 15 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-02-08 09:02:50,866 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 09:02:50,874 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;@3f4de6ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 09:02:50,875 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 09:02:50,878 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 10 states have (on average 1.7) internal successors, (17), 14 states have internal predecessors, (17), 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-08 09:02:50,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 09:02:50,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:02:50,882 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 09:02:50,882 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:02:50,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:02:50,886 INFO L85 PathProgramCache]: Analyzing trace with hash 42879979, now seen corresponding path program 1 times [2025-02-08 09:02:50,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:02:50,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019819536] [2025-02-08 09:02:50,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:02:50,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:02:50,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 09:02:50,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 09:02:50,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:02:50,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:02:51,012 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-08 09:02:51,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:02:51,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019819536] [2025-02-08 09:02:51,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019819536] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:02:51,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:02:51,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 09:02:51,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461616636] [2025-02-08 09:02:51,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:02:51,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:02:51,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:02:51,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:02:51,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:02:51,036 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.7) internal successors, (17), 14 states have internal predecessors, (17), 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:02:51,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:02:51,057 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2025-02-08 09:02:51,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:02:51,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 09:02:51,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:02:51,063 INFO L225 Difference]: With dead ends: 15 [2025-02-08 09:02:51,063 INFO L226 Difference]: Without dead ends: 11 [2025-02-08 09:02:51,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:02:51,067 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:02:51,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 14 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:02:51,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-02-08 09:02:51,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-02-08 09:02:51,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 1.5) internal successors, (12), 10 states have internal predecessors, (12), 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-08 09:02:51,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2025-02-08 09:02:51,095 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 5 [2025-02-08 09:02:51,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:02:51,095 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2025-02-08 09:02:51,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:02:51,095 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2025-02-08 09:02:51,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 09:02:51,095 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:02:51,095 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 09:02:51,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 09:02:51,097 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:02:51,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:02:51,097 INFO L85 PathProgramCache]: Analyzing trace with hash 42880139, now seen corresponding path program 1 times [2025-02-08 09:02:51,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:02:51,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851270392] [2025-02-08 09:02:51,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:02:51,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:02:51,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 09:02:51,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 09:02:51,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:02:51,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:02:51,142 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-08 09:02:51,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:02:51,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851270392] [2025-02-08 09:02:51,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851270392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:02:51,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:02:51,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:02:51,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696963230] [2025-02-08 09:02:51,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:02:51,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:02:51,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:02:51,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:02:51,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:02:51,144 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:02:51,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:02:51,164 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2025-02-08 09:02:51,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:02:51,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 09:02:51,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:02:51,165 INFO L225 Difference]: With dead ends: 11 [2025-02-08 09:02:51,165 INFO L226 Difference]: Without dead ends: 10 [2025-02-08 09:02:51,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:02:51,166 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:02:51,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 10 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:02:51,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-02-08 09:02:51,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-02-08 09:02:51,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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-08 09:02:51,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2025-02-08 09:02:51,168 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 5 [2025-02-08 09:02:51,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:02:51,168 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-02-08 09:02:51,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:02:51,168 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2025-02-08 09:02:51,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 09:02:51,168 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:02:51,168 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 09:02:51,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 09:02:51,168 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:02:51,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:02:51,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1329279320, now seen corresponding path program 1 times [2025-02-08 09:02:51,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:02:51,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039745713] [2025-02-08 09:02:51,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:02:51,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:02:51,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 09:02:51,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 09:02:51,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:02:51,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:02:51,206 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-08 09:02:51,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:02:51,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039745713] [2025-02-08 09:02:51,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039745713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:02:51,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:02:51,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 09:02:51,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018389546] [2025-02-08 09:02:51,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:02:51,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:02:51,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:02:51,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:02:51,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:02:51,207 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-08 09:02:51,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:02:51,221 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2025-02-08 09:02:51,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:02:51,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2025-02-08 09:02:51,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:02:51,222 INFO L225 Difference]: With dead ends: 18 [2025-02-08 09:02:51,222 INFO L226 Difference]: Without dead ends: 17 [2025-02-08 09:02:51,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:02:51,223 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 4 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:02:51,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 15 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:02:51,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-02-08 09:02:51,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2025-02-08 09:02:51,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 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-08 09:02:51,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2025-02-08 09:02:51,225 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 6 [2025-02-08 09:02:51,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:02:51,226 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2025-02-08 09:02:51,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-08 09:02:51,226 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2025-02-08 09:02:51,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 09:02:51,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:02:51,226 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 09:02:51,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 09:02:51,226 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:02:51,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:02:51,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1329284285, now seen corresponding path program 1 times [2025-02-08 09:02:51,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:02:51,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064666063] [2025-02-08 09:02:51,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:02:51,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:02:51,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 09:02:51,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 09:02:51,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:02:51,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:02:51,251 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-08 09:02:51,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:02:51,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064666063] [2025-02-08 09:02:51,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064666063] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:02:51,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:02:51,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 09:02:51,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125468550] [2025-02-08 09:02:51,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:02:51,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:02:51,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:02:51,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:02:51,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:02:51,252 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-08 09:02:51,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:02:51,263 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2025-02-08 09:02:51,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:02:51,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2025-02-08 09:02:51,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:02:51,264 INFO L225 Difference]: With dead ends: 16 [2025-02-08 09:02:51,264 INFO L226 Difference]: Without dead ends: 15 [2025-02-08 09:02:51,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:02:51,264 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 3 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:02:51,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 5 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:02:51,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-02-08 09:02:51,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-02-08 09:02:51,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-08 09:02:51,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2025-02-08 09:02:51,270 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 6 [2025-02-08 09:02:51,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:02:51,271 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-02-08 09:02:51,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-08 09:02:51,271 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2025-02-08 09:02:51,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 09:02:51,272 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:02:51,272 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2025-02-08 09:02:51,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 09:02:51,272 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:02:51,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:02:51,272 INFO L85 PathProgramCache]: Analyzing trace with hash -251018992, now seen corresponding path program 1 times [2025-02-08 09:02:51,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:02:51,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085316647] [2025-02-08 09:02:51,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:02:51,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:02:51,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 09:02:51,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 09:02:51,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:02:51,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:02:51,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:02:51,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:02:51,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085316647] [2025-02-08 09:02:51,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085316647] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:02:51,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:02:51,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:02:51,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952049883] [2025-02-08 09:02:51,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:02:51,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:02:51,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:02:51,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:02:51,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:02:51,329 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-08 09:02:51,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:02:51,341 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2025-02-08 09:02:51,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:02:51,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2025-02-08 09:02:51,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:02:51,342 INFO L225 Difference]: With dead ends: 22 [2025-02-08 09:02:51,342 INFO L226 Difference]: Without dead ends: 15 [2025-02-08 09:02:51,342 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-08 09:02:51,344 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:02:51,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:02:51,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-02-08 09:02:51,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-02-08 09:02:51,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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-08 09:02:51,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2025-02-08 09:02:51,346 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2025-02-08 09:02:51,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:02:51,346 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2025-02-08 09:02:51,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-08 09:02:51,347 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2025-02-08 09:02:51,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 09:02:51,347 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:02:51,347 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:02:51,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 09:02:51,347 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:02:51,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:02:51,347 INFO L85 PathProgramCache]: Analyzing trace with hash -706312237, now seen corresponding path program 1 times [2025-02-08 09:02:51,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:02:51,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115366420] [2025-02-08 09:02:51,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:02:51,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:02:51,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 09:02:51,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 09:02:51,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:02:51,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:02:51,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:02:51,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:02:51,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115366420] [2025-02-08 09:02:51,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115366420] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:02:51,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350594130] [2025-02-08 09:02:51,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:02:51,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:02:51,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:02:51,405 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:02:51,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 09:02:51,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 09:02:51,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 09:02:51,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:02:51,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:02:51,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 09:02:51,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:02:51,472 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:02:51,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:02:51,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:02:51,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350594130] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:02:51,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:02:51,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-02-08 09:02:51,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390145607] [2025-02-08 09:02:51,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:02:51,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 09:02:51,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:02:51,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 09:02:51,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 09:02:51,512 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-08 09:02:51,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:02:51,534 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2025-02-08 09:02:51,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 09:02:51,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 12 [2025-02-08 09:02:51,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:02:51,535 INFO L225 Difference]: With dead ends: 34 [2025-02-08 09:02:51,535 INFO L226 Difference]: Without dead ends: 33 [2025-02-08 09:02:51,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 09:02:51,536 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:02:51,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 24 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:02:51,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-08 09:02:51,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-08 09:02:51,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 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-08 09:02:51,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2025-02-08 09:02:51,540 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 12 [2025-02-08 09:02:51,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:02:51,540 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2025-02-08 09:02:51,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-08 09:02:51,541 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2025-02-08 09:02:51,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-08 09:02:51,541 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:02:51,541 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1] [2025-02-08 09:02:51,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 09:02:51,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:02:51,745 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:02:51,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:02:51,746 INFO L85 PathProgramCache]: Analyzing trace with hash 231020996, now seen corresponding path program 2 times [2025-02-08 09:02:51,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:02:51,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122591373] [2025-02-08 09:02:51,746 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:02:51,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:02:51,753 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 09:02:51,763 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 09:02:51,763 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:02:51,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:02:51,871 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:02:51,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:02:51,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122591373] [2025-02-08 09:02:51,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122591373] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:02:51,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192208089] [2025-02-08 09:02:51,872 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:02:51,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:02:51,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:02:51,874 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:02:51,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 09:02:51,896 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 09:02:51,910 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 09:02:51,911 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:02:51,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:02:51,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 09:02:51,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:02:51,974 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:02:51,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:02:52,075 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:02:52,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192208089] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:02:52,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:02:52,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 09:02:52,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667464140] [2025-02-08 09:02:52,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:02:52,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 09:02:52,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:02:52,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 09:02:52,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-02-08 09:02:52,076 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 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-08 09:02:52,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:02:52,123 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2025-02-08 09:02:52,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 09:02:52,124 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 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 30 [2025-02-08 09:02:52,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:02:52,124 INFO L225 Difference]: With dead ends: 70 [2025-02-08 09:02:52,124 INFO L226 Difference]: Without dead ends: 69 [2025-02-08 09:02:52,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-02-08 09:02:52,125 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:02:52,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 48 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:02:52,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-08 09:02:52,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-02-08 09:02:52,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 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-08 09:02:52,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2025-02-08 09:02:52,130 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 30 [2025-02-08 09:02:52,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:02:52,130 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2025-02-08 09:02:52,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 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-08 09:02:52,130 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2025-02-08 09:02:52,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-08 09:02:52,131 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:02:52,131 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1] [2025-02-08 09:02:52,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 09:02:52,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:02:52,335 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:02:52,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:02:52,336 INFO L85 PathProgramCache]: Analyzing trace with hash 428842726, now seen corresponding path program 3 times [2025-02-08 09:02:52,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:02:52,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186875065] [2025-02-08 09:02:52,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 09:02:52,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:02:52,348 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 66 statements into 11 equivalence classes. [2025-02-08 09:02:52,370 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 09:02:52,370 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-08 09:02:52,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:02:52,597 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:02:52,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:02:52,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186875065] [2025-02-08 09:02:52,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186875065] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:02:52,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615336984] [2025-02-08 09:02:52,597 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 09:02:52,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:02:52,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:02:52,599 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:02:52,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 09:02:52,628 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 66 statements into 11 equivalence classes. [2025-02-08 09:02:52,646 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 66 of 66 statements. [2025-02-08 09:02:52,646 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-08 09:02:52,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:02:52,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 09:02:52,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:02:52,757 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:02:52,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:02:53,000 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:02:53,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615336984] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:02:53,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:02:53,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-02-08 09:02:53,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234891407] [2025-02-08 09:02:53,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:02:53,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 09:02:53,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:02:53,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 09:02:53,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-02-08 09:02:53,003 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 24 states, 23 states have (on average 5.739130434782608) internal successors, (132), 23 states have internal predecessors, (132), 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-08 09:02:53,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:02:53,067 INFO L93 Difference]: Finished difference Result 142 states and 154 transitions. [2025-02-08 09:02:53,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 09:02:53,068 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.739130434782608) internal successors, (132), 23 states have internal predecessors, (132), 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 66 [2025-02-08 09:02:53,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:02:53,069 INFO L225 Difference]: With dead ends: 142 [2025-02-08 09:02:53,069 INFO L226 Difference]: Without dead ends: 141 [2025-02-08 09:02:53,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-02-08 09:02:53,069 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:02:53,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 96 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:02:53,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-02-08 09:02:53,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-02-08 09:02:53,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.0142857142857142) internal successors, (142), 140 states have internal predecessors, (142), 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-08 09:02:53,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2025-02-08 09:02:53,077 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 66 [2025-02-08 09:02:53,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:02:53,078 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2025-02-08 09:02:53,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.739130434782608) internal successors, (132), 23 states have internal predecessors, (132), 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-08 09:02:53,078 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2025-02-08 09:02:53,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-08 09:02:53,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:02:53,080 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 1, 1, 1, 1] [2025-02-08 09:02:53,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 09:02:53,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:02:53,281 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:02:53,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:02:53,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1172827690, now seen corresponding path program 4 times [2025-02-08 09:02:53,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:02:53,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455794607] [2025-02-08 09:02:53,282 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 09:02:53,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:02:53,291 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 138 statements into 2 equivalence classes. [2025-02-08 09:02:53,316 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 138 of 138 statements. [2025-02-08 09:02:53,316 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 09:02:53,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:02:53,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 1474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:02:53,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:02:53,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455794607] [2025-02-08 09:02:53,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455794607] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:02:53,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281854253] [2025-02-08 09:02:53,839 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 09:02:53,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:02:53,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:02:53,843 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 09:02:53,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 09:02:53,870 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 138 statements into 2 equivalence classes. [2025-02-08 09:02:53,897 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 138 of 138 statements. [2025-02-08 09:02:53,897 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 09:02:53,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:02:53,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 09:02:53,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:02:54,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 1474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:02:54,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:02:54,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 1474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:02:54,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281854253] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:02:54,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:02:54,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2025-02-08 09:02:54,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877576105] [2025-02-08 09:02:54,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:02:54,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-08 09:02:54,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:02:54,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-08 09:02:54,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-02-08 09:02:54,815 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand has 48 states, 47 states have (on average 5.872340425531915) internal successors, (276), 47 states have internal predecessors, (276), 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-08 09:02:54,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:02:54,929 INFO L93 Difference]: Finished difference Result 286 states and 310 transitions. [2025-02-08 09:02:54,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-02-08 09:02:54,930 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 5.872340425531915) internal successors, (276), 47 states have internal predecessors, (276), 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 138 [2025-02-08 09:02:54,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:02:54,931 INFO L225 Difference]: With dead ends: 286 [2025-02-08 09:02:54,931 INFO L226 Difference]: Without dead ends: 285 [2025-02-08 09:02:54,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-02-08 09:02:54,932 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:02:54,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 192 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:02:54,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-02-08 09:02:54,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2025-02-08 09:02:54,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 1.0070422535211268) internal successors, (286), 284 states have internal predecessors, (286), 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-08 09:02:54,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 286 transitions. [2025-02-08 09:02:54,949 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 286 transitions. Word has length 138 [2025-02-08 09:02:54,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:02:54,950 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 286 transitions. [2025-02-08 09:02:54,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 5.872340425531915) internal successors, (276), 47 states have internal predecessors, (276), 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-08 09:02:54,952 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 286 transitions. [2025-02-08 09:02:54,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-02-08 09:02:54,958 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:02:54,958 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 1, 1, 1, 1] [2025-02-08 09:02:54,964 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-08 09:02:55,158 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,SelfDestructingSolverStorable8 [2025-02-08 09:02:55,159 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:02:55,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:02:55,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1644977998, now seen corresponding path program 5 times [2025-02-08 09:02:55,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:02:55,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319115628] [2025-02-08 09:02:55,159 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 09:02:55,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:02:55,169 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 282 statements into 47 equivalence classes. [2025-02-08 09:02:55,256 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 282 of 282 statements. [2025-02-08 09:02:55,256 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-02-08 09:02:55,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:02:57,005 INFO L134 CoverageAnalysis]: Checked inductivity of 6394 backedges. 0 proven. 6394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:02:57,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:02:57,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319115628] [2025-02-08 09:02:57,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319115628] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:02:57,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615556522] [2025-02-08 09:02:57,005 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 09:02:57,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:02:57,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:02:57,009 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-08 09:02:57,010 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-08 09:02:57,034 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 282 statements into 47 equivalence classes. [2025-02-08 09:02:57,101 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 282 of 282 statements. [2025-02-08 09:02:57,101 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-02-08 09:02:57,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:02:57,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-08 09:02:57,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:02:57,381 INFO L134 CoverageAnalysis]: Checked inductivity of 6394 backedges. 0 proven. 6394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:02:57,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:02:59,490 INFO L134 CoverageAnalysis]: Checked inductivity of 6394 backedges. 0 proven. 6394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:02:59,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615556522] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:02:59,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:02:59,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 94 [2025-02-08 09:02:59,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207514904] [2025-02-08 09:02:59,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:02:59,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-02-08 09:02:59,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:02:59,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-02-08 09:02:59,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-02-08 09:02:59,496 INFO L87 Difference]: Start difference. First operand 285 states and 286 transitions. Second operand has 96 states, 95 states have (on average 5.936842105263158) internal successors, (564), 95 states have internal predecessors, (564), 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-08 09:02:59,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:02:59,758 INFO L93 Difference]: Finished difference Result 574 states and 622 transitions. [2025-02-08 09:02:59,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-02-08 09:02:59,759 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 5.936842105263158) internal successors, (564), 95 states have internal predecessors, (564), 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 282 [2025-02-08 09:02:59,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:02:59,761 INFO L225 Difference]: With dead ends: 574 [2025-02-08 09:02:59,762 INFO L226 Difference]: Without dead ends: 573 [2025-02-08 09:02:59,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-02-08 09:02:59,765 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 09:02:59,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 384 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 09:02:59,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-02-08 09:02:59,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2025-02-08 09:02:59,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 572 states have (on average 1.0034965034965035) internal successors, (574), 572 states have internal predecessors, (574), 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-08 09:02:59,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 574 transitions. [2025-02-08 09:02:59,781 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 574 transitions. Word has length 282 [2025-02-08 09:02:59,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:02:59,782 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 574 transitions. [2025-02-08 09:02:59,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 5.936842105263158) internal successors, (564), 95 states have internal predecessors, (564), 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-08 09:02:59,782 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 574 transitions. [2025-02-08 09:02:59,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2025-02-08 09:02:59,791 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:02:59,791 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 94, 94, 94, 94, 1, 1, 1, 1] [2025-02-08 09:02:59,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 09:02:59,995 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,SelfDestructingSolverStorable9 [2025-02-08 09:02:59,995 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:02:59,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:02:59,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1410902590, now seen corresponding path program 6 times [2025-02-08 09:02:59,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:02:59,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407379577] [2025-02-08 09:02:59,996 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 09:02:59,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:03:00,014 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 570 statements into 95 equivalence classes. [2025-02-08 09:03:00,152 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 570 of 570 statements. [2025-02-08 09:03:00,152 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-02-08 09:03:00,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:03:05,115 INFO L134 CoverageAnalysis]: Checked inductivity of 26602 backedges. 0 proven. 26602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:03:05,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:03:05,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407379577] [2025-02-08 09:03:05,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407379577] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:03:05,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401639565] [2025-02-08 09:03:05,116 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 09:03:05,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:03:05,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:03:05,117 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-08 09:03:05,118 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-08 09:03:05,153 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 570 statements into 95 equivalence classes. [2025-02-08 09:03:05,317 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 570 of 570 statements. [2025-02-08 09:03:05,317 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-02-08 09:03:05,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:03:05,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-02-08 09:03:05,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:03:05,827 INFO L134 CoverageAnalysis]: Checked inductivity of 26602 backedges. 0 proven. 26602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:03:05,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:03:13,143 INFO L134 CoverageAnalysis]: Checked inductivity of 26602 backedges. 0 proven. 26602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:03:13,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401639565] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:03:13,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:03:13,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 190 [2025-02-08 09:03:13,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884824594] [2025-02-08 09:03:13,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:03:13,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-02-08 09:03:13,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:03:13,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-02-08 09:03:13,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-02-08 09:03:13,155 INFO L87 Difference]: Start difference. First operand 573 states and 574 transitions. Second operand has 192 states, 191 states have (on average 5.968586387434555) internal successors, (1140), 191 states have internal predecessors, (1140), 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-08 09:03:14,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:03:14,174 INFO L93 Difference]: Finished difference Result 1150 states and 1246 transitions. [2025-02-08 09:03:14,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-02-08 09:03:14,175 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 191 states have (on average 5.968586387434555) internal successors, (1140), 191 states have internal predecessors, (1140), 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 570 [2025-02-08 09:03:14,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:03:14,180 INFO L225 Difference]: With dead ends: 1150 [2025-02-08 09:03:14,180 INFO L226 Difference]: Without dead ends: 1149 [2025-02-08 09:03:14,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1233 GetRequests, 1043 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-02-08 09:03:14,185 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 09:03:14,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 768 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 09:03:14,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2025-02-08 09:03:14,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1149. [2025-02-08 09:03:14,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1148 states have (on average 1.0017421602787457) internal successors, (1150), 1148 states have internal predecessors, (1150), 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-08 09:03:14,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1150 transitions. [2025-02-08 09:03:14,211 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1150 transitions. Word has length 570 [2025-02-08 09:03:14,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:03:14,212 INFO L471 AbstractCegarLoop]: Abstraction has 1149 states and 1150 transitions. [2025-02-08 09:03:14,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 191 states have (on average 5.968586387434555) internal successors, (1140), 191 states have internal predecessors, (1140), 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-08 09:03:14,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1150 transitions. [2025-02-08 09:03:14,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1147 [2025-02-08 09:03:14,229 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:03:14,229 INFO L218 NwaCegarLoop]: trace histogram [191, 191, 190, 190, 190, 190, 1, 1, 1, 1] [2025-02-08 09:03:14,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 09:03:14,430 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,SelfDestructingSolverStorable10 [2025-02-08 09:03:14,430 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:03:14,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:03:14,431 INFO L85 PathProgramCache]: Analyzing trace with hash 583008226, now seen corresponding path program 7 times [2025-02-08 09:03:14,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:03:14,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734997033] [2025-02-08 09:03:14,431 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 09:03:14,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:03:14,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1146 statements into 1 equivalence classes. [2025-02-08 09:03:14,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1146 of 1146 statements. [2025-02-08 09:03:14,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:03:14,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:03:35,654 INFO L134 CoverageAnalysis]: Checked inductivity of 108490 backedges. 0 proven. 108490 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:03:35,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:03:35,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734997033] [2025-02-08 09:03:35,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734997033] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:03:35,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554662485] [2025-02-08 09:03:35,654 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 09:03:35,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:03:35,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:03:35,656 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-08 09:03:35,659 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-08 09:03:35,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1146 statements into 1 equivalence classes. [2025-02-08 09:03:35,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1146 of 1146 statements. [2025-02-08 09:03:35,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:03:35,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:03:35,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 1915 conjuncts, 192 conjuncts are in the unsatisfiable core [2025-02-08 09:03:35,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:03:36,705 INFO L134 CoverageAnalysis]: Checked inductivity of 108490 backedges. 0 proven. 108490 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:03:36,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:04:04,620 INFO L134 CoverageAnalysis]: Checked inductivity of 108490 backedges. 0 proven. 108490 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:04:04,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554662485] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:04:04,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:04:04,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [191, 191, 191] total 382 [2025-02-08 09:04:04,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273884074] [2025-02-08 09:04:04,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:04:04,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 384 states [2025-02-08 09:04:04,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:04:04,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 384 interpolants. [2025-02-08 09:04:04,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73536, Invalid=73536, Unknown=0, NotChecked=0, Total=147072 [2025-02-08 09:04:04,640 INFO L87 Difference]: Start difference. First operand 1149 states and 1150 transitions. Second operand has 384 states, 383 states have (on average 5.984334203655353) internal successors, (2292), 383 states have internal predecessors, (2292), 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-08 09:04:09,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:04:09,777 INFO L93 Difference]: Finished difference Result 2302 states and 2494 transitions. [2025-02-08 09:04:09,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 384 states. [2025-02-08 09:04:09,779 INFO L78 Accepts]: Start accepts. Automaton has has 384 states, 383 states have (on average 5.984334203655353) internal successors, (2292), 383 states have internal predecessors, (2292), 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 1146 [2025-02-08 09:04:09,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:04:09,785 INFO L225 Difference]: With dead ends: 2302 [2025-02-08 09:04:09,785 INFO L226 Difference]: Without dead ends: 2301 [2025-02-08 09:04:09,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2481 GetRequests, 2099 SyntacticMatches, 0 SemanticMatches, 382 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.1s TimeCoverageRelationStatistics Valid=73536, Invalid=73536, Unknown=0, NotChecked=0, Total=147072 [2025-02-08 09:04:09,790 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 09:04:09,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1536 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 09:04:09,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2301 states. [2025-02-08 09:04:09,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2301 to 2301. [2025-02-08 09:04:09,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2301 states, 2300 states have (on average 1.0008695652173913) internal successors, (2302), 2300 states have internal predecessors, (2302), 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-08 09:04:09,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2301 states to 2301 states and 2302 transitions. [2025-02-08 09:04:09,825 INFO L78 Accepts]: Start accepts. Automaton has 2301 states and 2302 transitions. Word has length 1146 [2025-02-08 09:04:09,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:04:09,826 INFO L471 AbstractCegarLoop]: Abstraction has 2301 states and 2302 transitions. [2025-02-08 09:04:09,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 384 states, 383 states have (on average 5.984334203655353) internal successors, (2292), 383 states have internal predecessors, (2292), 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-08 09:04:09,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2301 states and 2302 transitions. [2025-02-08 09:04:09,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2299 [2025-02-08 09:04:09,861 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:04:09,861 INFO L218 NwaCegarLoop]: trace histogram [383, 383, 382, 382, 382, 382, 1, 1, 1, 1] [2025-02-08 09:04:09,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 09:04:10,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:04:10,062 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-02-08 09:04:10,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:04:10,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1741269982, now seen corresponding path program 8 times [2025-02-08 09:04:10,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:04:10,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817776598] [2025-02-08 09:04:10,063 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:04:10,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:04:10,098 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2298 statements into 2 equivalence classes. [2025-02-08 09:04:10,525 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 2298 of 2298 statements. [2025-02-08 09:04:10,525 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:04:10,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat