./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-restricted-15/MinusUserDefined.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/MinusUserDefined.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 096bafbba8d51323312e8aef69baa45c66c17c65b2ec8717873d6ff292690721 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 09:01:35,613 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 09:01:35,694 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:01:35,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 09:01:35,701 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 09:01:35,726 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 09:01:35,727 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 09:01:35,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 09:01:35,728 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 09:01:35,729 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 09:01:35,729 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 09:01:35,729 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 09:01:35,730 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 09:01:35,730 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 09:01:35,730 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 09:01:35,730 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 09:01:35,730 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 09:01:35,730 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 09:01:35,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 09:01:35,730 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 09:01:35,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 09:01:35,730 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 09:01:35,731 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 09:01:35,731 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 09:01:35,731 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 09:01:35,731 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 09:01:35,731 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 09:01:35,731 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 09:01:35,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 09:01:35,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 09:01:35,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 09:01:35,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:01:35,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 09:01:35,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 09:01:35,731 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 09:01:35,732 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 09:01:35,732 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 09:01:35,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 09:01:35,733 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 09:01:35,733 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 09:01:35,733 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 09:01:35,733 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 09:01:35,733 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 -> 096bafbba8d51323312e8aef69baa45c66c17c65b2ec8717873d6ff292690721 [2025-02-08 09:01:36,023 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 09:01:36,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 09:01:36,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 09:01:36,038 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 09:01:36,038 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 09:01:36,040 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/MinusUserDefined.c [2025-02-08 09:01:37,323 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d52b4f6d/8e933767f9784aec821a696f867b9f1c/FLAG64a390705 [2025-02-08 09:01:37,607 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 09:01:37,610 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/MinusUserDefined.c [2025-02-08 09:01:37,618 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d52b4f6d/8e933767f9784aec821a696f867b9f1c/FLAG64a390705 [2025-02-08 09:01:37,639 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d52b4f6d/8e933767f9784aec821a696f867b9f1c [2025-02-08 09:01:37,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 09:01:37,645 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 09:01:37,646 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 09:01:37,646 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 09:01:37,652 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 09:01:37,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:01:37" (1/1) ... [2025-02-08 09:01:37,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65451a62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:01:37, skipping insertion in model container [2025-02-08 09:01:37,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 09:01:37" (1/1) ... [2025-02-08 09:01:37,668 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 09:01:37,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:01:37,808 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 09:01:37,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 09:01:37,833 INFO L204 MainTranslator]: Completed translation [2025-02-08 09:01:37,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:01:37 WrapperNode [2025-02-08 09:01:37,834 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 09:01:37,835 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 09:01:37,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 09:01:37,835 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 09:01:37,841 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:01:37" (1/1) ... [2025-02-08 09:01:37,845 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:01:37" (1/1) ... [2025-02-08 09:01:37,858 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2025-02-08 09:01:37,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 09:01:37,859 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 09:01:37,859 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 09:01:37,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 09:01:37,866 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:01:37" (1/1) ... [2025-02-08 09:01:37,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:01:37" (1/1) ... [2025-02-08 09:01:37,867 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:01:37" (1/1) ... [2025-02-08 09:01:37,872 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-08 09:01:37,872 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:01:37" (1/1) ... [2025-02-08 09:01:37,872 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:01:37" (1/1) ... [2025-02-08 09:01:37,873 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:01:37" (1/1) ... [2025-02-08 09:01:37,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:01:37" (1/1) ... [2025-02-08 09:01:37,878 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:01:37" (1/1) ... [2025-02-08 09:01:37,880 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:01:37" (1/1) ... [2025-02-08 09:01:37,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 09:01:37,885 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 09:01:37,885 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 09:01:37,885 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 09:01:37,886 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:01:37" (1/1) ... [2025-02-08 09:01:37,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 09:01:37,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:01:37,924 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:01:37,928 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:01:37,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 09:01:37,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 09:01:38,014 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 09:01:38,016 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 09:01:38,160 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-08 09:01:38,160 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 09:01:38,169 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 09:01:38,171 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 09:01:38,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:01:38 BoogieIcfgContainer [2025-02-08 09:01:38,172 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 09:01:38,174 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 09:01:38,175 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 09:01:38,181 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 09:01:38,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 09:01:37" (1/3) ... [2025-02-08 09:01:38,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c67ab6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:01:38, skipping insertion in model container [2025-02-08 09:01:38,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 09:01:37" (2/3) ... [2025-02-08 09:01:38,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c67ab6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 09:01:38, skipping insertion in model container [2025-02-08 09:01:38,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 09:01:38" (3/3) ... [2025-02-08 09:01:38,184 INFO L128 eAbstractionObserver]: Analyzing ICFG MinusUserDefined.c [2025-02-08 09:01:38,195 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 09:01:38,196 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG MinusUserDefined.c that has 1 procedures, 30 locations, 1 initial locations, 3 loop locations, and 12 error locations. [2025-02-08 09:01:38,249 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 09:01:38,259 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;@52b90e85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 09:01:38,259 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-02-08 09:01:38,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 29 states have internal predecessors, (32), 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:01:38,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 09:01:38,269 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:01:38,270 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 09:01:38,271 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 09:01:38,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:01:38,276 INFO L85 PathProgramCache]: Analyzing trace with hash 59516, now seen corresponding path program 1 times [2025-02-08 09:01:38,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:01:38,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230799085] [2025-02-08 09:01:38,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:01:38,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:01:38,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 09:01:38,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 09:01:38,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:01:38,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:01:38,431 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:01:38,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:01:38,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230799085] [2025-02-08 09:01:38,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230799085] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:01:38,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:01:38,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:01:38,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746616581] [2025-02-08 09:01:38,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:01:38,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:01:38,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:01:38,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:01:38,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:01:38,456 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 29 states have internal predecessors, (32), 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 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:01:38,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:01:38,503 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2025-02-08 09:01:38,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:01:38,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-08 09:01:38,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:01:38,509 INFO L225 Difference]: With dead ends: 34 [2025-02-08 09:01:38,509 INFO L226 Difference]: Without dead ends: 28 [2025-02-08 09:01:38,511 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:01:38,514 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:01:38,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 31 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:01:38,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-08 09:01:38,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-02-08 09:01:38,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.75) internal successors, (28), 25 states have internal predecessors, (28), 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:01:38,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-02-08 09:01:38,542 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 3 [2025-02-08 09:01:38,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:01:38,542 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-02-08 09:01:38,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:01:38,542 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2025-02-08 09:01:38,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 09:01:38,543 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:01:38,543 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 09:01:38,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 09:01:38,543 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 09:01:38,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:01:38,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1844990, now seen corresponding path program 1 times [2025-02-08 09:01:38,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:01:38,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066643747] [2025-02-08 09:01:38,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:01:38,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:01:38,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 09:01:38,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 09:01:38,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:01:38,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:01:38,571 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:01:38,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:01:38,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066643747] [2025-02-08 09:01:38,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066643747] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:01:38,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:01:38,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 09:01:38,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613831195] [2025-02-08 09:01:38,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:01:38,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:01:38,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:01:38,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:01:38,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:01:38,574 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:01:38,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:01:38,594 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2025-02-08 09:01:38,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:01:38,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-08 09:01:38,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:01:38,594 INFO L225 Difference]: With dead ends: 26 [2025-02-08 09:01:38,594 INFO L226 Difference]: Without dead ends: 24 [2025-02-08 09:01:38,595 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:01:38,595 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:01:38,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 17 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:01:38,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-08 09:01:38,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-02-08 09:01:38,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.625) internal successors, (26), 23 states have internal predecessors, (26), 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:01:38,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2025-02-08 09:01:38,599 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 4 [2025-02-08 09:01:38,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:01:38,599 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2025-02-08 09:01:38,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:01:38,600 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2025-02-08 09:01:38,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 09:01:38,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:01:38,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 09:01:38,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 09:01:38,600 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 09:01:38,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:01:38,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1845727, now seen corresponding path program 1 times [2025-02-08 09:01:38,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:01:38,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984091134] [2025-02-08 09:01:38,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:01:38,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:01:38,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 09:01:38,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 09:01:38,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:01:38,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:01:38,651 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:01:38,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:01:38,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984091134] [2025-02-08 09:01:38,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984091134] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:01:38,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:01:38,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 09:01:38,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396340531] [2025-02-08 09:01:38,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:01:38,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:01:38,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:01:38,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:01:38,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:01:38,653 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:01:38,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:01:38,699 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2025-02-08 09:01:38,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:01:38,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-08 09:01:38,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:01:38,702 INFO L225 Difference]: With dead ends: 34 [2025-02-08 09:01:38,703 INFO L226 Difference]: Without dead ends: 33 [2025-02-08 09:01:38,703 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:01:38,703 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:01:38,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 16 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:01:38,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-08 09:01:38,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2025-02-08 09:01:38,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 30 states have internal predecessors, (38), 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:01:38,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2025-02-08 09:01:38,716 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 4 [2025-02-08 09:01:38,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:01:38,717 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2025-02-08 09:01:38,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 09:01:38,717 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2025-02-08 09:01:38,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 09:01:38,718 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:01:38,718 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 09:01:38,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 09:01:38,718 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 09:01:38,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:01:38,722 INFO L85 PathProgramCache]: Analyzing trace with hash 57194682, now seen corresponding path program 1 times [2025-02-08 09:01:38,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:01:38,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963475464] [2025-02-08 09:01:38,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:01:38,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:01:38,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 09:01:38,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 09:01:38,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:01:38,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:01:38,765 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:01:38,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:01:38,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963475464] [2025-02-08 09:01:38,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963475464] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:01:38,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:01:38,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 09:01:38,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440732475] [2025-02-08 09:01:38,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:01:38,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:01:38,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:01:38,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:01:38,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:01:38,766 INFO L87 Difference]: Start difference. First operand 31 states and 38 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:01:38,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:01:38,795 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2025-02-08 09:01:38,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:01:38,796 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:01:38,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:01:38,796 INFO L225 Difference]: With dead ends: 31 [2025-02-08 09:01:38,797 INFO L226 Difference]: Without dead ends: 29 [2025-02-08 09:01:38,797 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:01:38,798 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:01:38,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 23 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:01:38,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-02-08 09:01:38,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-02-08 09:01:38,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.565217391304348) internal successors, (36), 28 states have internal predecessors, (36), 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:01:38,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2025-02-08 09:01:38,805 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 5 [2025-02-08 09:01:38,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:01:38,805 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2025-02-08 09:01:38,805 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:01:38,805 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2025-02-08 09:01:38,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 09:01:38,806 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:01:38,806 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 09:01:38,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 09:01:38,806 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 09:01:38,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:01:38,807 INFO L85 PathProgramCache]: Analyzing trace with hash 57217522, now seen corresponding path program 1 times [2025-02-08 09:01:38,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:01:38,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243233054] [2025-02-08 09:01:38,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:01:38,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:01:38,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 09:01:38,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 09:01:38,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:01:38,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:01:38,862 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:01:38,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:01:38,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243233054] [2025-02-08 09:01:38,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243233054] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:01:38,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:01:38,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:01:38,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797540978] [2025-02-08 09:01:38,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:01:38,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:01:38,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:01:38,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:01:38,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:01:38,865 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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:01:38,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:01:38,914 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2025-02-08 09:01:38,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:01:38,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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:01:38,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:01:38,915 INFO L225 Difference]: With dead ends: 29 [2025-02-08 09:01:38,915 INFO L226 Difference]: Without dead ends: 28 [2025-02-08 09:01:38,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:01:38,916 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:01:38,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:01:38,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-08 09:01:38,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-02-08 09:01:38,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 27 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:01:38,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2025-02-08 09:01:38,923 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 5 [2025-02-08 09:01:38,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:01:38,924 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-02-08 09:01:38,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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:01:38,924 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2025-02-08 09:01:38,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 09:01:38,924 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:01:38,924 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 09:01:38,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 09:01:38,925 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 09:01:38,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:01:38,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1773035132, now seen corresponding path program 1 times [2025-02-08 09:01:38,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:01:38,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933994277] [2025-02-08 09:01:38,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:01:38,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:01:38,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 09:01:38,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 09:01:38,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:01:38,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:01:38,961 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:01:38,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:01:38,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933994277] [2025-02-08 09:01:38,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933994277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:01:38,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:01:38,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 09:01:38,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764562389] [2025-02-08 09:01:38,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:01:38,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:01:38,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:01:38,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:01:38,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:01:38,963 INFO L87 Difference]: Start difference. First operand 28 states and 34 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:01:38,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:01:38,987 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2025-02-08 09:01:38,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:01:38,988 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:01:38,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:01:38,988 INFO L225 Difference]: With dead ends: 28 [2025-02-08 09:01:38,989 INFO L226 Difference]: Without dead ends: 26 [2025-02-08 09:01:38,989 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:01:38,990 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:01:38,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 10 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:01:38,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-08 09:01:38,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-02-08 09:01:38,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 23 states have (on average 1.391304347826087) internal successors, (32), 25 states have internal predecessors, (32), 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:01:38,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2025-02-08 09:01:38,995 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 6 [2025-02-08 09:01:38,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:01:38,995 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2025-02-08 09:01:38,995 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:01:38,996 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2025-02-08 09:01:38,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 09:01:38,996 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:01:38,996 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 09:01:38,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 09:01:38,996 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 09:01:38,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:01:38,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1773743165, now seen corresponding path program 1 times [2025-02-08 09:01:38,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:01:38,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737284772] [2025-02-08 09:01:38,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:01:38,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:01:39,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 09:01:39,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 09:01:39,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:01:39,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:01:39,021 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:01:39,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:01:39,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737284772] [2025-02-08 09:01:39,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737284772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:01:39,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:01:39,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 09:01:39,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83445601] [2025-02-08 09:01:39,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:01:39,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:01:39,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:01:39,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:01:39,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:01:39,023 INFO L87 Difference]: Start difference. First operand 26 states and 32 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:01:39,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:01:39,032 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2025-02-08 09:01:39,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:01:39,033 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:01:39,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:01:39,033 INFO L225 Difference]: With dead ends: 26 [2025-02-08 09:01:39,033 INFO L226 Difference]: Without dead ends: 25 [2025-02-08 09:01:39,034 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:01:39,034 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:01:39,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 17 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:01:39,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-08 09:01:39,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-02-08 09:01:39,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 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:01:39,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2025-02-08 09:01:39,039 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 6 [2025-02-08 09:01:39,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:01:39,039 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2025-02-08 09:01:39,039 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:01:39,040 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2025-02-08 09:01:39,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 09:01:39,040 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:01:39,040 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:01:39,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 09:01:39,040 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 09:01:39,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:01:39,041 INFO L85 PathProgramCache]: Analyzing trace with hash -848536752, now seen corresponding path program 1 times [2025-02-08 09:01:39,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:01:39,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826608227] [2025-02-08 09:01:39,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:01:39,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:01:39,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 09:01:39,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 09:01:39,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:01:39,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:01:39,082 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:01:39,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:01:39,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826608227] [2025-02-08 09:01:39,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826608227] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:01:39,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:01:39,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 09:01:39,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513057183] [2025-02-08 09:01:39,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:01:39,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 09:01:39,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:01:39,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 09:01:39,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 09:01:39,088 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:01:39,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:01:39,105 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2025-02-08 09:01:39,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 09:01:39,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2025-02-08 09:01:39,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:01:39,106 INFO L225 Difference]: With dead ends: 37 [2025-02-08 09:01:39,106 INFO L226 Difference]: Without dead ends: 36 [2025-02-08 09:01:39,107 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:01:39,109 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 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:01:39,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:01:39,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-08 09:01:39,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2025-02-08 09:01:39,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 states have internal predecessors, (41), 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:01:39,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2025-02-08 09:01:39,119 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 7 [2025-02-08 09:01:39,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:01:39,120 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2025-02-08 09:01:39,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:01:39,120 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2025-02-08 09:01:39,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 09:01:39,122 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:01:39,122 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 09:01:39,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 09:01:39,123 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 09:01:39,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:01:39,123 INFO L85 PathProgramCache]: Analyzing trace with hash 981809889, now seen corresponding path program 1 times [2025-02-08 09:01:39,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:01:39,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506682338] [2025-02-08 09:01:39,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:01:39,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:01:39,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 09:01:39,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 09:01:39,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:01:39,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:01:39,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:01:39,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:01:39,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506682338] [2025-02-08 09:01:39,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506682338] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 09:01:39,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 09:01:39,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 09:01:39,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450544620] [2025-02-08 09:01:39,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 09:01:39,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 09:01:39,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:01:39,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 09:01:39,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:01:39,204 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:01:39,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:01:39,240 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2025-02-08 09:01:39,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 09:01:39,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2025-02-08 09:01:39,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:01:39,241 INFO L225 Difference]: With dead ends: 40 [2025-02-08 09:01:39,241 INFO L226 Difference]: Without dead ends: 39 [2025-02-08 09:01:39,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 09:01:39,242 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:01:39,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 29 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:01:39,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-08 09:01:39,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 22. [2025-02-08 09:01:39,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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:01:39,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2025-02-08 09:01:39,249 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 9 [2025-02-08 09:01:39,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:01:39,249 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2025-02-08 09:01:39,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:01:39,250 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2025-02-08 09:01:39,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 09:01:39,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:01:39,250 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 09:01:39,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 09:01:39,250 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 09:01:39,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:01:39,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1219267861, now seen corresponding path program 1 times [2025-02-08 09:01:39,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:01:39,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502230080] [2025-02-08 09:01:39,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:01:39,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:01:39,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 09:01:39,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 09:01:39,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:01:39,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:01:39,294 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:01:39,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:01:39,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502230080] [2025-02-08 09:01:39,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502230080] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:01:39,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185467400] [2025-02-08 09:01:39,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 09:01:39,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:01:39,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:01:39,299 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:01:39,301 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:01:39,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 09:01:39,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 09:01:39,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:01:39,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:01:39,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 09:01:39,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:01:39,389 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:01:39,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:01:39,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:01:39,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185467400] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:01:39,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:01:39,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-02-08 09:01:39,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418617570] [2025-02-08 09:01:39,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:01:39,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 09:01:39,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:01:39,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 09:01:39,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 09:01:39,438 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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:01:39,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:01:39,476 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2025-02-08 09:01:39,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 09:01:39,477 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 13 [2025-02-08 09:01:39,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:01:39,478 INFO L225 Difference]: With dead ends: 53 [2025-02-08 09:01:39,479 INFO L226 Difference]: Without dead ends: 52 [2025-02-08 09:01:39,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 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:01:39,480 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:01:39,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 53 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:01:39,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-08 09:01:39,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-02-08 09:01:39,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 51 states have internal predecessors, (57), 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:01:39,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2025-02-08 09:01:39,492 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 13 [2025-02-08 09:01:39,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:01:39,493 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2025-02-08 09:01:39,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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:01:39,493 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2025-02-08 09:01:39,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 09:01:39,494 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:01:39,494 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1] [2025-02-08 09:01:39,502 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:01:39,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-08 09:01:39,695 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 09:01:39,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:01:39,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1624601572, now seen corresponding path program 2 times [2025-02-08 09:01:39,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:01:39,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707948809] [2025-02-08 09:01:39,696 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:01:39,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:01:39,703 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-08 09:01:39,711 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 09:01:39,711 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:01:39,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:01:39,810 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:01:39,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:01:39,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707948809] [2025-02-08 09:01:39,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707948809] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:01:39,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522777007] [2025-02-08 09:01:39,811 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 09:01:39,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:01:39,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:01:39,813 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:01:39,816 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:01:39,841 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-08 09:01:39,850 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 09:01:39,851 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 09:01:39,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:01:39,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 09:01:39,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:01:39,909 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:01:39,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:01:40,042 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:01:40,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522777007] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:01:40,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:01:40,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 09:01:40,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581471081] [2025-02-08 09:01:40,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:01:40,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 09:01:40,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:01:40,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 09:01:40,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-02-08 09:01:40,044 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 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:01:40,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:01:40,099 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2025-02-08 09:01:40,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 09:01:40,099 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 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 31 [2025-02-08 09:01:40,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:01:40,100 INFO L225 Difference]: With dead ends: 113 [2025-02-08 09:01:40,100 INFO L226 Difference]: Without dead ends: 112 [2025-02-08 09:01:40,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 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:01:40,101 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 111 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 09:01:40,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 107 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 09:01:40,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-08 09:01:40,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-02-08 09:01:40,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.1081081081081081) internal successors, (123), 111 states have internal predecessors, (123), 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:01:40,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2025-02-08 09:01:40,115 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 31 [2025-02-08 09:01:40,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:01:40,116 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2025-02-08 09:01:40,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 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:01:40,116 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2025-02-08 09:01:40,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-08 09:01:40,118 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:01:40,118 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 1, 1, 1] [2025-02-08 09:01:40,126 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:01:40,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:01:40,323 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 09:01:40,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:01:40,324 INFO L85 PathProgramCache]: Analyzing trace with hash -260583358, now seen corresponding path program 3 times [2025-02-08 09:01:40,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:01:40,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928351612] [2025-02-08 09:01:40,324 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 09:01:40,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:01:40,335 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 11 equivalence classes. [2025-02-08 09:01:40,351 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 09:01:40,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-08 09:01:40,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:01:40,616 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:01:40,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:01:40,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928351612] [2025-02-08 09:01:40,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928351612] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:01:40,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743032193] [2025-02-08 09:01:40,617 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 09:01:40,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:01:40,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:01:40,619 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:01:40,621 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:01:40,647 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 11 equivalence classes. [2025-02-08 09:01:40,670 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 09:01:40,670 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-02-08 09:01:40,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:01:40,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 09:01:40,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:01:40,784 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:01:40,784 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:01:41,107 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:01:41,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743032193] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:01:41,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:01:41,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-02-08 09:01:41,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495803297] [2025-02-08 09:01:41,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:01:41,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 09:01:41,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:01:41,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 09:01:41,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-02-08 09:01:41,109 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand has 24 states, 23 states have (on average 5.826086956521739) internal successors, (134), 23 states have internal predecessors, (134), 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:01:41,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:01:41,244 INFO L93 Difference]: Finished difference Result 233 states and 267 transitions. [2025-02-08 09:01:41,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 09:01:41,245 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.826086956521739) internal successors, (134), 23 states have internal predecessors, (134), 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 67 [2025-02-08 09:01:41,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:01:41,246 INFO L225 Difference]: With dead ends: 233 [2025-02-08 09:01:41,246 INFO L226 Difference]: Without dead ends: 232 [2025-02-08 09:01:41,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-02-08 09:01:41,247 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 256 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:01:41,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 215 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:01:41,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-08 09:01:41,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-08 09:01:41,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.103896103896104) internal successors, (255), 231 states have internal predecessors, (255), 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:01:41,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 255 transitions. [2025-02-08 09:01:41,291 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 255 transitions. Word has length 67 [2025-02-08 09:01:41,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:01:41,291 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 255 transitions. [2025-02-08 09:01:41,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.826086956521739) internal successors, (134), 23 states have internal predecessors, (134), 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:01:41,291 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 255 transitions. [2025-02-08 09:01:41,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-08 09:01:41,296 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:01:41,296 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 1, 1, 1] [2025-02-08 09:01:41,304 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:01:41,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:01:41,497 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 09:01:41,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:01:41,498 INFO L85 PathProgramCache]: Analyzing trace with hash 2042692606, now seen corresponding path program 4 times [2025-02-08 09:01:41,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:01:41,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749764324] [2025-02-08 09:01:41,498 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 09:01:41,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:01:41,514 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 139 statements into 2 equivalence classes. [2025-02-08 09:01:41,535 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 139 of 139 statements. [2025-02-08 09:01:41,537 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 09:01:41,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:01:42,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1496 backedges. 0 proven. 1496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:01:42,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:01:42,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749764324] [2025-02-08 09:01:42,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749764324] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:01:42,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680151227] [2025-02-08 09:01:42,224 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 09:01:42,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:01:42,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:01:42,227 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:01:42,228 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:01:42,263 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 139 statements into 2 equivalence classes. [2025-02-08 09:01:42,303 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 139 of 139 statements. [2025-02-08 09:01:42,303 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 09:01:42,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:01:42,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 09:01:42,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:01:42,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1496 backedges. 0 proven. 1496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:01:42,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:01:43,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1496 backedges. 0 proven. 1496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:01:43,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680151227] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:01:43,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:01:43,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2025-02-08 09:01:43,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614654475] [2025-02-08 09:01:43,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:01:43,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-08 09:01:43,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:01:43,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-08 09:01:43,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-02-08 09:01:43,549 INFO L87 Difference]: Start difference. First operand 232 states and 255 transitions. Second operand has 48 states, 47 states have (on average 5.914893617021277) internal successors, (278), 47 states have internal predecessors, (278), 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:01:43,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:01:43,991 INFO L93 Difference]: Finished difference Result 473 states and 543 transitions. [2025-02-08 09:01:43,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-02-08 09:01:43,992 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 5.914893617021277) internal successors, (278), 47 states have internal predecessors, (278), 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 139 [2025-02-08 09:01:43,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:01:43,995 INFO L225 Difference]: With dead ends: 473 [2025-02-08 09:01:43,995 INFO L226 Difference]: Without dead ends: 472 [2025-02-08 09:01:43,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-02-08 09:01:43,997 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 696 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 09:01:43,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 431 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 09:01:43,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-02-08 09:01:44,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2025-02-08 09:01:44,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 1.1019108280254777) internal successors, (519), 471 states have internal predecessors, (519), 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:01:44,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 519 transitions. [2025-02-08 09:01:44,038 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 519 transitions. Word has length 139 [2025-02-08 09:01:44,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:01:44,039 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 519 transitions. [2025-02-08 09:01:44,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 5.914893617021277) internal successors, (278), 47 states have internal predecessors, (278), 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:01:44,040 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 519 transitions. [2025-02-08 09:01:44,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2025-02-08 09:01:44,048 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:01:44,048 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 46, 46, 1, 1, 1] [2025-02-08 09:01:44,056 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:01:44,248 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,SelfDestructingSolverStorable12 [2025-02-08 09:01:44,249 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 09:01:44,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:01:44,249 INFO L85 PathProgramCache]: Analyzing trace with hash 2056738678, now seen corresponding path program 5 times [2025-02-08 09:01:44,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:01:44,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405512705] [2025-02-08 09:01:44,250 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 09:01:44,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:01:44,273 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 283 statements into 47 equivalence classes. [2025-02-08 09:01:44,357 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 283 of 283 statements. [2025-02-08 09:01:44,357 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-02-08 09:01:44,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:01:46,475 INFO L134 CoverageAnalysis]: Checked inductivity of 6440 backedges. 0 proven. 6440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:01:46,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:01:46,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405512705] [2025-02-08 09:01:46,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405512705] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:01:46,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118834007] [2025-02-08 09:01:46,476 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 09:01:46,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:01:46,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:01:46,478 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:01:46,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 09:01:46,512 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 283 statements into 47 equivalence classes. [2025-02-08 09:01:46,611 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 283 of 283 statements. [2025-02-08 09:01:46,611 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-02-08 09:01:46,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:01:46,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-08 09:01:46,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:01:46,991 INFO L134 CoverageAnalysis]: Checked inductivity of 6440 backedges. 0 proven. 6440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:01:46,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:01:49,645 INFO L134 CoverageAnalysis]: Checked inductivity of 6440 backedges. 0 proven. 6440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:01:49,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118834007] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:01:49,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:01:49,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 94 [2025-02-08 09:01:49,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526749815] [2025-02-08 09:01:49,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:01:49,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-02-08 09:01:49,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:01:49,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-02-08 09:01:49,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-02-08 09:01:49,655 INFO L87 Difference]: Start difference. First operand 472 states and 519 transitions. Second operand has 96 states, 95 states have (on average 5.957894736842105) internal successors, (566), 95 states have internal predecessors, (566), 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:01:51,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:01:51,228 INFO L93 Difference]: Finished difference Result 953 states and 1095 transitions. [2025-02-08 09:01:51,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-02-08 09:01:51,229 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 5.957894736842105) internal successors, (566), 95 states have internal predecessors, (566), 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 283 [2025-02-08 09:01:51,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:01:51,233 INFO L225 Difference]: With dead ends: 953 [2025-02-08 09:01:51,233 INFO L226 Difference]: Without dead ends: 952 [2025-02-08 09:01:51,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 611 GetRequests, 517 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-02-08 09:01:51,236 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 1781 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1781 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 09:01:51,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1781 Valid, 863 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 09:01:51,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2025-02-08 09:01:51,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 952. [2025-02-08 09:01:51,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 951 states have (on average 1.1009463722397477) internal successors, (1047), 951 states have internal predecessors, (1047), 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:01:51,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1047 transitions. [2025-02-08 09:01:51,271 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1047 transitions. Word has length 283 [2025-02-08 09:01:51,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:01:51,272 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 1047 transitions. [2025-02-08 09:01:51,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 5.957894736842105) internal successors, (566), 95 states have internal predecessors, (566), 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:01:51,272 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1047 transitions. [2025-02-08 09:01:51,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-02-08 09:01:51,280 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:01:51,280 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 95, 94, 94, 1, 1, 1] [2025-02-08 09:01:51,288 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:01:51,481 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,SelfDestructingSolverStorable13 [2025-02-08 09:01:51,481 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 09:01:51,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:01:51,482 INFO L85 PathProgramCache]: Analyzing trace with hash -387731866, now seen corresponding path program 6 times [2025-02-08 09:01:51,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:01:51,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915165037] [2025-02-08 09:01:51,482 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 09:01:51,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:01:51,497 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 571 statements into 95 equivalence classes. [2025-02-08 09:01:51,636 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 571 of 571 statements. [2025-02-08 09:01:51,636 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-02-08 09:01:51,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:01:58,083 INFO L134 CoverageAnalysis]: Checked inductivity of 26696 backedges. 0 proven. 26696 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:01:58,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:01:58,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915165037] [2025-02-08 09:01:58,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915165037] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:01:58,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811791414] [2025-02-08 09:01:58,083 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 09:01:58,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:01:58,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:01:58,085 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:01:58,086 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:01:58,133 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 571 statements into 95 equivalence classes. [2025-02-08 09:01:58,299 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 571 of 571 statements. [2025-02-08 09:01:58,299 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-02-08 09:01:58,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:01:58,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 956 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-02-08 09:01:58,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:01:58,947 INFO L134 CoverageAnalysis]: Checked inductivity of 26696 backedges. 0 proven. 26696 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:01:58,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 09:02:07,964 INFO L134 CoverageAnalysis]: Checked inductivity of 26696 backedges. 0 proven. 26696 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:02:07,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811791414] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 09:02:07,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 09:02:07,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 190 [2025-02-08 09:02:07,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48142399] [2025-02-08 09:02:07,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 09:02:07,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2025-02-08 09:02:07,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 09:02:07,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2025-02-08 09:02:07,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-02-08 09:02:07,987 INFO L87 Difference]: Start difference. First operand 952 states and 1047 transitions. Second operand has 192 states, 191 states have (on average 5.979057591623037) internal successors, (1142), 191 states have internal predecessors, (1142), 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:25,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 09:02:25,390 INFO L93 Difference]: Finished difference Result 1913 states and 2199 transitions. [2025-02-08 09:02:25,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-02-08 09:02:25,391 INFO L78 Accepts]: Start accepts. Automaton has has 192 states, 191 states have (on average 5.979057591623037) internal successors, (1142), 191 states have internal predecessors, (1142), 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 571 [2025-02-08 09:02:25,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 09:02:25,398 INFO L225 Difference]: With dead ends: 1913 [2025-02-08 09:02:25,398 INFO L226 Difference]: Without dead ends: 1912 [2025-02-08 09:02:25,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1235 GetRequests, 1045 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2025-02-08 09:02:25,402 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 4121 mSDsluCounter, 1710 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4121 SdHoareTripleChecker+Valid, 1727 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 09:02:25,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4121 Valid, 1727 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 09:02:25,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2025-02-08 09:02:25,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1912. [2025-02-08 09:02:25,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1912 states, 1911 states have (on average 1.1004709576138147) internal successors, (2103), 1911 states have internal predecessors, (2103), 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:25,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 2103 transitions. [2025-02-08 09:02:25,468 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 2103 transitions. Word has length 571 [2025-02-08 09:02:25,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 09:02:25,469 INFO L471 AbstractCegarLoop]: Abstraction has 1912 states and 2103 transitions. [2025-02-08 09:02:25,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 192 states, 191 states have (on average 5.979057591623037) internal successors, (1142), 191 states have internal predecessors, (1142), 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:25,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2103 transitions. [2025-02-08 09:02:25,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1148 [2025-02-08 09:02:25,505 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 09:02:25,505 INFO L218 NwaCegarLoop]: trace histogram [191, 191, 191, 191, 190, 190, 1, 1, 1] [2025-02-08 09:02:25,515 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:02:25,706 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,SelfDestructingSolverStorable14 [2025-02-08 09:02:25,706 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-02-08 09:02:25,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 09:02:25,707 INFO L85 PathProgramCache]: Analyzing trace with hash 880483398, now seen corresponding path program 7 times [2025-02-08 09:02:25,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 09:02:25,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454689788] [2025-02-08 09:02:25,707 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 09:02:25,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 09:02:25,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1147 statements into 1 equivalence classes. [2025-02-08 09:02:25,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1147 of 1147 statements. [2025-02-08 09:02:25,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:02:25,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:02:49,597 INFO L134 CoverageAnalysis]: Checked inductivity of 108680 backedges. 0 proven. 108680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:02:49,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 09:02:49,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454689788] [2025-02-08 09:02:49,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454689788] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 09:02:49,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669206486] [2025-02-08 09:02:49,597 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 09:02:49,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 09:02:49,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 09:02:49,600 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:02:49,602 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:02:49,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1147 statements into 1 equivalence classes. [2025-02-08 09:02:49,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1147 of 1147 statements. [2025-02-08 09:02:49,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 09:02:49,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 09:02:49,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 1916 conjuncts, 192 conjuncts are in the unsatisfiable core [2025-02-08 09:02:49,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 09:02:50,871 INFO L134 CoverageAnalysis]: Checked inductivity of 108680 backedges. 0 proven. 108680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 09:02:50,871 INFO L312 TraceCheckSpWp]: Computing backward predicates...