./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/xcsp/AllInterval-009.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/xcsp/AllInterval-009.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 467fcaafa9af0a00772f5009c99943c6cb7078cb0bca94a00a243b41a6183129 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:35:33,958 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:35:34,004 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:35:34,008 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:35:34,008 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:35:34,027 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:35:34,027 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:35:34,027 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:35:34,028 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:35:34,028 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:35:34,028 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:35:34,028 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:35:34,028 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:35:34,028 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:35:34,028 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:35:34,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:35:34,028 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:35:34,029 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:35:34,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:35:34,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:35:34,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:35:34,029 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:35:34,029 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:35:34,029 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:35:34,029 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:35:34,029 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:35:34,029 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:35:34,029 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:35:34,029 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:35:34,029 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:35:34,030 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:35:34,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:35:34,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:35:34,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:35:34,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:35:34,030 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:35:34,030 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:35:34,030 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:35:34,030 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:35:34,030 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:35:34,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:35:34,030 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:35:34,030 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:35:34,031 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:35:34,031 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:35:34,031 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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 467fcaafa9af0a00772f5009c99943c6cb7078cb0bca94a00a243b41a6183129 [2025-03-04 11:35:34,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:35:34,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:35:34,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:35:34,246 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:35:34,246 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:35:34,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/xcsp/AllInterval-009.c [2025-03-04 11:35:35,389 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91582f802/aac5b0ee7f9e499098f72a147cdbbc1e/FLAG34a20555f [2025-03-04 11:35:35,619 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:35:35,624 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-009.c [2025-03-04 11:35:35,635 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91582f802/aac5b0ee7f9e499098f72a147cdbbc1e/FLAG34a20555f [2025-03-04 11:35:35,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91582f802/aac5b0ee7f9e499098f72a147cdbbc1e [2025-03-04 11:35:35,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:35:35,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:35:35,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:35:35,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:35:35,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:35:35,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:35:35" (1/1) ... [2025-03-04 11:35:35,660 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b7fbed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:35, skipping insertion in model container [2025-03-04 11:35:35,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:35:35" (1/1) ... [2025-03-04 11:35:35,675 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:35:35,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:35:35,806 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:35:35,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:35:35,855 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:35:35,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:35 WrapperNode [2025-03-04 11:35:35,856 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:35:35,857 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:35:35,857 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:35:35,857 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:35:35,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:35" (1/1) ... [2025-03-04 11:35:35,871 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:35" (1/1) ... [2025-03-04 11:35:35,892 INFO L138 Inliner]: procedures = 13, calls = 114, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 289 [2025-03-04 11:35:35,893 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:35:35,894 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:35:35,894 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:35:35,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:35:35,900 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:35" (1/1) ... [2025-03-04 11:35:35,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:35" (1/1) ... [2025-03-04 11:35:35,901 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:35" (1/1) ... [2025-03-04 11:35:35,914 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 11:35:35,915 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:35" (1/1) ... [2025-03-04 11:35:35,915 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:35" (1/1) ... [2025-03-04 11:35:35,919 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:35" (1/1) ... [2025-03-04 11:35:35,919 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:35" (1/1) ... [2025-03-04 11:35:35,920 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:35" (1/1) ... [2025-03-04 11:35:35,922 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:35" (1/1) ... [2025-03-04 11:35:35,923 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:35:35,924 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:35:35,924 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:35:35,924 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:35:35,924 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:35" (1/1) ... [2025-03-04 11:35:35,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:35:35,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:35,953 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:35:35,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:35:35,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:35:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:35:35,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:35:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:35:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2025-03-04 11:35:35,973 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2025-03-04 11:35:36,024 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:35:36,026 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:35:36,338 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2025-03-04 11:35:36,338 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:35:36,348 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:35:36,348 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:35:36,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:35:36 BoogieIcfgContainer [2025-03-04 11:35:36,348 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:35:36,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:35:36,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:35:36,357 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:35:36,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:35:35" (1/3) ... [2025-03-04 11:35:36,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25d519f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:35:36, skipping insertion in model container [2025-03-04 11:35:36,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:35" (2/3) ... [2025-03-04 11:35:36,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25d519f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:35:36, skipping insertion in model container [2025-03-04 11:35:36,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:35:36" (3/3) ... [2025-03-04 11:35:36,359 INFO L128 eAbstractionObserver]: Analyzing ICFG AllInterval-009.c [2025-03-04 11:35:36,371 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:35:36,373 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG AllInterval-009.c that has 2 procedures, 215 locations, 1 initial locations, 0 loop locations, and 32 error locations. [2025-03-04 11:35:36,412 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:35:36,423 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;@c9c5387, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:35:36,423 INFO L334 AbstractCegarLoop]: Starting to check reachability of 32 error locations. [2025-03-04 11:35:36,429 INFO L276 IsEmpty]: Start isEmpty. Operand has 215 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 107 states have internal predecessors, (116), 106 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 106 states have call predecessors, (106), 106 states have call successors, (106) [2025-03-04 11:35:36,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2025-03-04 11:35:36,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:36,445 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:36,446 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-03-04 11:35:36,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:36,450 INFO L85 PathProgramCache]: Analyzing trace with hash 2017997376, now seen corresponding path program 1 times [2025-03-04 11:35:36,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:36,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158380087] [2025-03-04 11:35:36,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:36,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:36,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 511 statements into 1 equivalence classes. [2025-03-04 11:35:36,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 511 of 511 statements. [2025-03-04 11:35:36,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:36,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:36,901 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 194 refuted. 0 times theorem prover too weak. 18818 trivial. 0 not checked. [2025-03-04 11:35:36,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:36,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158380087] [2025-03-04 11:35:36,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158380087] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:36,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481962390] [2025-03-04 11:35:36,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:36,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:36,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:36,906 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:36,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:35:36,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 511 statements into 1 equivalence classes. [2025-03-04 11:35:37,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 511 of 511 statements. [2025-03-04 11:35:37,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:37,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:37,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 943 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 11:35:37,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:37,208 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 18818 trivial. 0 not checked. [2025-03-04 11:35:37,208 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:35:37,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481962390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:37,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:35:37,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 11:35:37,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173025899] [2025-03-04 11:35:37,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:37,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 11:35:37,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:37,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 11:35:37,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:35:37,233 INFO L87 Difference]: Start difference. First operand has 215 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 107 states have internal predecessors, (116), 106 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 106 states have call predecessors, (106), 106 states have call successors, (106) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (98), 2 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 2 states have call successors, (98) [2025-03-04 11:35:37,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:37,277 INFO L93 Difference]: Finished difference Result 423 states and 755 transitions. [2025-03-04 11:35:37,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 11:35:37,280 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (98), 2 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 2 states have call successors, (98) Word has length 511 [2025-03-04 11:35:37,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:37,289 INFO L225 Difference]: With dead ends: 423 [2025-03-04 11:35:37,289 INFO L226 Difference]: Without dead ends: 208 [2025-03-04 11:35:37,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 512 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:35:37,298 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:37,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:37,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-04 11:35:37,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2025-03-04 11:35:37,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 70 states have (on average 1.542857142857143) internal successors, (108), 101 states have internal predecessors, (108), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 11:35:37,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 318 transitions. [2025-03-04 11:35:37,380 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 318 transitions. Word has length 511 [2025-03-04 11:35:37,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:37,380 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 318 transitions. [2025-03-04 11:35:37,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (98), 2 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 2 states have call successors, (98) [2025-03-04 11:35:37,381 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 318 transitions. [2025-03-04 11:35:37,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2025-03-04 11:35:37,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:37,393 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:37,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:37,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 11:35:37,594 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-03-04 11:35:37,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:37,597 INFO L85 PathProgramCache]: Analyzing trace with hash 877080992, now seen corresponding path program 1 times [2025-03-04 11:35:37,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:37,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748968670] [2025-03-04 11:35:37,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:37,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:37,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 511 statements into 1 equivalence classes. [2025-03-04 11:35:37,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 511 of 511 statements. [2025-03-04 11:35:37,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:37,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:38,558 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 6 proven. 570 refuted. 0 times theorem prover too weak. 18436 trivial. 0 not checked. [2025-03-04 11:35:38,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:38,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748968670] [2025-03-04 11:35:38,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748968670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:38,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010649231] [2025-03-04 11:35:38,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:38,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:38,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:38,564 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:38,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:35:38,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 511 statements into 1 equivalence classes. [2025-03-04 11:35:38,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 511 of 511 statements. [2025-03-04 11:35:38,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:38,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:38,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 943 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:35:38,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:39,391 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 291 refuted. 0 times theorem prover too weak. 18721 trivial. 0 not checked. [2025-03-04 11:35:39,391 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:39,938 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 291 refuted. 0 times theorem prover too weak. 18721 trivial. 0 not checked. [2025-03-04 11:35:39,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010649231] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:39,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:39,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 11:35:39,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450482091] [2025-03-04 11:35:39,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:39,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:35:39,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:39,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:35:39,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:35:39,948 INFO L87 Difference]: Start difference. First operand 208 states and 318 transitions. Second operand has 10 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 6 states have call successors, (291), 1 states have call predecessors, (291), 2 states have return successors, (292), 5 states have call predecessors, (292), 6 states have call successors, (292) [2025-03-04 11:35:40,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:40,429 INFO L93 Difference]: Finished difference Result 208 states and 318 transitions. [2025-03-04 11:35:40,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:35:40,430 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 6 states have call successors, (291), 1 states have call predecessors, (291), 2 states have return successors, (292), 5 states have call predecessors, (292), 6 states have call successors, (292) Word has length 511 [2025-03-04 11:35:40,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:40,433 INFO L225 Difference]: With dead ends: 208 [2025-03-04 11:35:40,433 INFO L226 Difference]: Without dead ends: 207 [2025-03-04 11:35:40,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1028 GetRequests, 1019 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:35:40,434 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 2 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:40,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1054 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:35:40,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-04 11:35:40,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2025-03-04 11:35:40,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 70 states have (on average 1.5285714285714285) internal successors, (107), 100 states have internal predecessors, (107), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 11:35:40,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 317 transitions. [2025-03-04 11:35:40,458 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 317 transitions. Word has length 511 [2025-03-04 11:35:40,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:40,460 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 317 transitions. [2025-03-04 11:35:40,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 6 states have call successors, (291), 1 states have call predecessors, (291), 2 states have return successors, (292), 5 states have call predecessors, (292), 6 states have call successors, (292) [2025-03-04 11:35:40,461 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 317 transitions. [2025-03-04 11:35:40,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2025-03-04 11:35:40,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:40,463 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:40,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:40,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-04 11:35:40,664 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-03-04 11:35:40,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:40,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1419707042, now seen corresponding path program 1 times [2025-03-04 11:35:40,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:40,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370649615] [2025-03-04 11:35:40,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:40,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:40,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 512 statements into 1 equivalence classes. [2025-03-04 11:35:40,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 512 of 512 statements. [2025-03-04 11:35:40,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:40,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:41,105 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 6 proven. 285 refuted. 0 times theorem prover too weak. 18721 trivial. 0 not checked. [2025-03-04 11:35:41,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:41,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370649615] [2025-03-04 11:35:41,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370649615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:41,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809766971] [2025-03-04 11:35:41,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:41,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:41,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:41,108 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:41,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:35:41,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 512 statements into 1 equivalence classes. [2025-03-04 11:35:41,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 512 of 512 statements. [2025-03-04 11:35:41,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:41,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:41,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 944 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:35:41,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:41,624 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 6 proven. 285 refuted. 0 times theorem prover too weak. 18721 trivial. 0 not checked. [2025-03-04 11:35:41,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:42,043 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 6 proven. 285 refuted. 0 times theorem prover too weak. 18721 trivial. 0 not checked. [2025-03-04 11:35:42,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809766971] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:42,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:42,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-04 11:35:42,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079714097] [2025-03-04 11:35:42,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:42,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:35:42,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:42,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:35:42,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:35:42,046 INFO L87 Difference]: Start difference. First operand 207 states and 317 transitions. Second operand has 10 states, 8 states have (on average 8.625) internal successors, (69), 10 states have internal predecessors, (69), 5 states have call successors, (289), 1 states have call predecessors, (289), 2 states have return successors, (290), 4 states have call predecessors, (290), 5 states have call successors, (290) [2025-03-04 11:35:42,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:42,580 INFO L93 Difference]: Finished difference Result 207 states and 317 transitions. [2025-03-04 11:35:42,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:35:42,581 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 8.625) internal successors, (69), 10 states have internal predecessors, (69), 5 states have call successors, (289), 1 states have call predecessors, (289), 2 states have return successors, (290), 4 states have call predecessors, (290), 5 states have call successors, (290) Word has length 512 [2025-03-04 11:35:42,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:42,584 INFO L225 Difference]: With dead ends: 207 [2025-03-04 11:35:42,584 INFO L226 Difference]: Without dead ends: 206 [2025-03-04 11:35:42,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1028 GetRequests, 1019 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:35:42,585 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:42,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1256 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:35:42,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-04 11:35:42,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2025-03-04 11:35:42,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 70 states have (on average 1.5142857142857142) internal successors, (106), 99 states have internal predecessors, (106), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 11:35:42,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 316 transitions. [2025-03-04 11:35:42,614 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 316 transitions. Word has length 512 [2025-03-04 11:35:42,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:42,619 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 316 transitions. [2025-03-04 11:35:42,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 8.625) internal successors, (69), 10 states have internal predecessors, (69), 5 states have call successors, (289), 1 states have call predecessors, (289), 2 states have return successors, (290), 4 states have call predecessors, (290), 5 states have call successors, (290) [2025-03-04 11:35:42,620 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 316 transitions. [2025-03-04 11:35:42,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2025-03-04 11:35:42,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:42,624 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:42,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 11:35:42,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:42,825 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-03-04 11:35:42,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:42,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1461130688, now seen corresponding path program 1 times [2025-03-04 11:35:42,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:42,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014928242] [2025-03-04 11:35:42,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:42,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:42,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-03-04 11:35:42,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-03-04 11:35:42,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:42,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:42,969 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-04 11:35:42,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:42,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014928242] [2025-03-04 11:35:42,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014928242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:42,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:42,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:35:42,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348627943] [2025-03-04 11:35:42,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:42,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:35:42,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:42,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:35:42,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:42,973 INFO L87 Difference]: Start difference. First operand 206 states and 316 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-04 11:35:43,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:43,035 INFO L93 Difference]: Finished difference Result 206 states and 316 transitions. [2025-03-04 11:35:43,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:35:43,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 514 [2025-03-04 11:35:43,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:43,038 INFO L225 Difference]: With dead ends: 206 [2025-03-04 11:35:43,039 INFO L226 Difference]: Without dead ends: 198 [2025-03-04 11:35:43,039 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-03-04 11:35:43,039 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 8 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:43,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 538 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:43,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-04 11:35:43,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2025-03-04 11:35:43,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 70 states have (on average 1.4) internal successors, (98), 91 states have internal predecessors, (98), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 11:35:43,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 308 transitions. [2025-03-04 11:35:43,072 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 308 transitions. Word has length 514 [2025-03-04 11:35:43,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:43,074 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 308 transitions. [2025-03-04 11:35:43,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-04 11:35:43,075 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 308 transitions. [2025-03-04 11:35:43,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2025-03-04 11:35:43,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:43,079 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:43,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:35:43,079 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-03-04 11:35:43,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:43,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1949588989, now seen corresponding path program 1 times [2025-03-04 11:35:43,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:43,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743106868] [2025-03-04 11:35:43,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:43,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:43,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 515 statements into 1 equivalence classes. [2025-03-04 11:35:43,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 515 of 515 statements. [2025-03-04 11:35:43,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:43,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:43,545 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 6 proven. 570 refuted. 0 times theorem prover too weak. 18436 trivial. 0 not checked. [2025-03-04 11:35:43,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:43,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743106868] [2025-03-04 11:35:43,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743106868] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:43,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022686290] [2025-03-04 11:35:43,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:43,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:43,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:43,550 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:43,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:35:43,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 515 statements into 1 equivalence classes. [2025-03-04 11:35:43,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 515 of 515 statements. [2025-03-04 11:35:43,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:43,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:43,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 949 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:35:43,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:44,011 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 291 refuted. 0 times theorem prover too weak. 18721 trivial. 0 not checked. [2025-03-04 11:35:44,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:44,428 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 291 refuted. 0 times theorem prover too weak. 18721 trivial. 0 not checked. [2025-03-04 11:35:44,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022686290] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:44,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:44,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-04 11:35:44,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133468801] [2025-03-04 11:35:44,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:44,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 11:35:44,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:44,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 11:35:44,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:35:44,431 INFO L87 Difference]: Start difference. First operand 198 states and 308 transitions. Second operand has 11 states, 10 states have (on average 7.6) internal successors, (76), 11 states have internal predecessors, (76), 5 states have call successors, (290), 1 states have call predecessors, (290), 2 states have return successors, (290), 4 states have call predecessors, (290), 5 states have call successors, (290) [2025-03-04 11:35:44,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:44,849 INFO L93 Difference]: Finished difference Result 198 states and 308 transitions. [2025-03-04 11:35:44,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:35:44,850 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.6) internal successors, (76), 11 states have internal predecessors, (76), 5 states have call successors, (290), 1 states have call predecessors, (290), 2 states have return successors, (290), 4 states have call predecessors, (290), 5 states have call successors, (290) Word has length 515 [2025-03-04 11:35:44,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:44,852 INFO L225 Difference]: With dead ends: 198 [2025-03-04 11:35:44,852 INFO L226 Difference]: Without dead ends: 197 [2025-03-04 11:35:44,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1037 GetRequests, 1026 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:35:44,853 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 0 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:44,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 950 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:35:44,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-04 11:35:44,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2025-03-04 11:35:44,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 90 states have internal predecessors, (97), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 11:35:44,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 307 transitions. [2025-03-04 11:35:44,868 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 307 transitions. Word has length 515 [2025-03-04 11:35:44,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:44,871 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 307 transitions. [2025-03-04 11:35:44,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.6) internal successors, (76), 11 states have internal predecessors, (76), 5 states have call successors, (290), 1 states have call predecessors, (290), 2 states have return successors, (290), 4 states have call predecessors, (290), 5 states have call successors, (290) [2025-03-04 11:35:44,872 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 307 transitions. [2025-03-04 11:35:44,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-03-04 11:35:44,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:44,874 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:44,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:45,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:45,075 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-03-04 11:35:45,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:45,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1749457061, now seen corresponding path program 1 times [2025-03-04 11:35:45,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:45,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722615945] [2025-03-04 11:35:45,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:45,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:45,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-03-04 11:35:45,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-03-04 11:35:45,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:45,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:45,355 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 6 proven. 288 refuted. 0 times theorem prover too weak. 19110 trivial. 0 not checked. [2025-03-04 11:35:45,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:45,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722615945] [2025-03-04 11:35:45,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722615945] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:45,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127756404] [2025-03-04 11:35:45,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:45,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:45,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:45,358 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:45,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:35:45,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-03-04 11:35:45,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-03-04 11:35:45,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:45,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:45,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 961 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:35:45,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:45,797 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 6 proven. 288 refuted. 0 times theorem prover too weak. 19110 trivial. 0 not checked. [2025-03-04 11:35:45,797 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:46,204 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 6 proven. 288 refuted. 0 times theorem prover too weak. 19110 trivial. 0 not checked. [2025-03-04 11:35:46,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127756404] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:46,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:46,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 11:35:46,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687133578] [2025-03-04 11:35:46,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:46,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:35:46,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:46,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:35:46,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:35:46,208 INFO L87 Difference]: Start difference. First operand 197 states and 307 transitions. Second operand has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 6 states have call successors, (290), 1 states have call predecessors, (290), 2 states have return successors, (291), 6 states have call predecessors, (291), 6 states have call successors, (291) [2025-03-04 11:35:46,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:46,699 INFO L93 Difference]: Finished difference Result 197 states and 307 transitions. [2025-03-04 11:35:46,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:35:46,701 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 6 states have call successors, (290), 1 states have call predecessors, (290), 2 states have return successors, (291), 6 states have call predecessors, (291), 6 states have call successors, (291) Word has length 520 [2025-03-04 11:35:46,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:46,704 INFO L225 Difference]: With dead ends: 197 [2025-03-04 11:35:46,704 INFO L226 Difference]: Without dead ends: 196 [2025-03-04 11:35:46,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1043 GetRequests, 1035 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:35:46,705 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 8 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:46,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1136 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:35:46,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-04 11:35:46,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-03-04 11:35:46,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 89 states have internal predecessors, (96), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 11:35:46,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 306 transitions. [2025-03-04 11:35:46,723 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 306 transitions. Word has length 520 [2025-03-04 11:35:46,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:46,723 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 306 transitions. [2025-03-04 11:35:46,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 6 states have call successors, (290), 1 states have call predecessors, (290), 2 states have return successors, (291), 6 states have call predecessors, (291), 6 states have call successors, (291) [2025-03-04 11:35:46,724 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 306 transitions. [2025-03-04 11:35:46,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-03-04 11:35:46,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:46,727 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:46,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:46,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:46,927 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-03-04 11:35:46,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:46,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1601406011, now seen corresponding path program 1 times [2025-03-04 11:35:46,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:46,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873845603] [2025-03-04 11:35:46,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:46,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:46,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-03-04 11:35:46,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-03-04 11:35:46,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:46,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:47,239 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 12 proven. 282 refuted. 0 times theorem prover too weak. 19110 trivial. 0 not checked. [2025-03-04 11:35:47,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:47,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873845603] [2025-03-04 11:35:47,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873845603] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:47,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754490128] [2025-03-04 11:35:47,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:47,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:47,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:47,241 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:47,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:35:47,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-03-04 11:35:47,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-03-04 11:35:47,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:47,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:47,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:35:47,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:47,656 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 12 proven. 282 refuted. 0 times theorem prover too weak. 19110 trivial. 0 not checked. [2025-03-04 11:35:47,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:48,032 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 12 proven. 282 refuted. 0 times theorem prover too weak. 19110 trivial. 0 not checked. [2025-03-04 11:35:48,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754490128] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:48,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:48,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2025-03-04 11:35:48,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730606896] [2025-03-04 11:35:48,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:48,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 11:35:48,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:48,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 11:35:48,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:35:48,036 INFO L87 Difference]: Start difference. First operand 196 states and 306 transitions. Second operand has 13 states, 11 states have (on average 7.363636363636363) internal successors, (81), 13 states have internal predecessors, (81), 8 states have call successors, (292), 1 states have call predecessors, (292), 2 states have return successors, (293), 7 states have call predecessors, (293), 8 states have call successors, (293) [2025-03-04 11:35:48,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:48,517 INFO L93 Difference]: Finished difference Result 196 states and 306 transitions. [2025-03-04 11:35:48,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:35:48,518 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.363636363636363) internal successors, (81), 13 states have internal predecessors, (81), 8 states have call successors, (292), 1 states have call predecessors, (292), 2 states have return successors, (293), 7 states have call predecessors, (293), 8 states have call successors, (293) Word has length 521 [2025-03-04 11:35:48,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:48,521 INFO L225 Difference]: With dead ends: 196 [2025-03-04 11:35:48,521 INFO L226 Difference]: Without dead ends: 195 [2025-03-04 11:35:48,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1051 GetRequests, 1036 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:35:48,522 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 29 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:48,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1261 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:35:48,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-04 11:35:48,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2025-03-04 11:35:48,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 88 states have internal predecessors, (95), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 11:35:48,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 305 transitions. [2025-03-04 11:35:48,543 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 305 transitions. Word has length 521 [2025-03-04 11:35:48,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:48,544 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 305 transitions. [2025-03-04 11:35:48,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.363636363636363) internal successors, (81), 13 states have internal predecessors, (81), 8 states have call successors, (292), 1 states have call predecessors, (292), 2 states have return successors, (293), 7 states have call predecessors, (293), 8 states have call successors, (293) [2025-03-04 11:35:48,545 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 305 transitions. [2025-03-04 11:35:48,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2025-03-04 11:35:48,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:48,548 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:48,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:48,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:48,749 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-03-04 11:35:48,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:48,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1010197704, now seen corresponding path program 1 times [2025-03-04 11:35:48,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:48,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738940602] [2025-03-04 11:35:48,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:48,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:48,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 524 statements into 1 equivalence classes. [2025-03-04 11:35:48,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 524 of 524 statements. [2025-03-04 11:35:48,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:48,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:49,138 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 18 proven. 564 refuted. 0 times theorem prover too weak. 18822 trivial. 0 not checked. [2025-03-04 11:35:49,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:49,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738940602] [2025-03-04 11:35:49,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738940602] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:49,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742451630] [2025-03-04 11:35:49,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:49,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:49,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:49,141 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:49,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:35:49,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 524 statements into 1 equivalence classes. [2025-03-04 11:35:49,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 524 of 524 statements. [2025-03-04 11:35:49,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:49,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:49,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 967 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:35:49,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:49,578 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 6 proven. 288 refuted. 0 times theorem prover too weak. 19110 trivial. 0 not checked. [2025-03-04 11:35:49,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:49,942 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 6 proven. 288 refuted. 0 times theorem prover too weak. 19110 trivial. 0 not checked. [2025-03-04 11:35:49,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742451630] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:49,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:49,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-04 11:35:49,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71378297] [2025-03-04 11:35:49,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:49,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 11:35:49,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:49,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 11:35:49,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:35:49,945 INFO L87 Difference]: Start difference. First operand 195 states and 305 transitions. Second operand has 11 states, 10 states have (on average 8.6) internal successors, (86), 11 states have internal predecessors, (86), 5 states have call successors, (289), 1 states have call predecessors, (289), 2 states have return successors, (289), 5 states have call predecessors, (289), 5 states have call successors, (289) [2025-03-04 11:35:50,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:50,552 INFO L93 Difference]: Finished difference Result 195 states and 305 transitions. [2025-03-04 11:35:50,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:35:50,553 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.6) internal successors, (86), 11 states have internal predecessors, (86), 5 states have call successors, (289), 1 states have call predecessors, (289), 2 states have return successors, (289), 5 states have call predecessors, (289), 5 states have call successors, (289) Word has length 524 [2025-03-04 11:35:50,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:50,555 INFO L225 Difference]: With dead ends: 195 [2025-03-04 11:35:50,555 INFO L226 Difference]: Without dead ends: 194 [2025-03-04 11:35:50,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1055 GetRequests, 1044 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:35:50,556 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 6 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1378 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:50,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1378 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 11:35:50,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-04 11:35:50,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-03-04 11:35:50,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 87 states have internal predecessors, (94), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 11:35:50,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 304 transitions. [2025-03-04 11:35:50,570 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 304 transitions. Word has length 524 [2025-03-04 11:35:50,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:50,570 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 304 transitions. [2025-03-04 11:35:50,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.6) internal successors, (86), 11 states have internal predecessors, (86), 5 states have call successors, (289), 1 states have call predecessors, (289), 2 states have return successors, (289), 5 states have call predecessors, (289), 5 states have call successors, (289) [2025-03-04 11:35:50,571 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 304 transitions. [2025-03-04 11:35:50,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2025-03-04 11:35:50,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:50,574 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:50,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:50,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:50,774 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-03-04 11:35:50,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:50,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1252044012, now seen corresponding path program 1 times [2025-03-04 11:35:50,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:50,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599739489] [2025-03-04 11:35:50,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:50,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:50,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-03-04 11:35:50,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-03-04 11:35:50,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:50,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:51,006 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 12 proven. 285 refuted. 0 times theorem prover too weak. 19503 trivial. 0 not checked. [2025-03-04 11:35:51,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:51,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599739489] [2025-03-04 11:35:51,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599739489] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:51,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441344809] [2025-03-04 11:35:51,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:51,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:51,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:51,009 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:51,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:35:51,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-03-04 11:35:51,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-03-04 11:35:51,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:51,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:51,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:35:51,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:51,442 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 12 proven. 285 refuted. 0 times theorem prover too weak. 19503 trivial. 0 not checked. [2025-03-04 11:35:51,442 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:51,807 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 12 proven. 285 refuted. 0 times theorem prover too weak. 19503 trivial. 0 not checked. [2025-03-04 11:35:51,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441344809] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:51,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:51,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 11:35:51,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679418093] [2025-03-04 11:35:51,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:51,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:35:51,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:51,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:35:51,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:35:51,810 INFO L87 Difference]: Start difference. First operand 194 states and 304 transitions. Second operand has 10 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 states have internal predecessors, (87), 6 states have call successors, (289), 1 states have call predecessors, (289), 2 states have return successors, (290), 6 states have call predecessors, (290), 6 states have call successors, (290) [2025-03-04 11:35:52,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:52,082 INFO L93 Difference]: Finished difference Result 194 states and 304 transitions. [2025-03-04 11:35:52,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:35:52,083 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 states have internal predecessors, (87), 6 states have call successors, (289), 1 states have call predecessors, (289), 2 states have return successors, (290), 6 states have call predecessors, (290), 6 states have call successors, (290) Word has length 529 [2025-03-04 11:35:52,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:52,085 INFO L225 Difference]: With dead ends: 194 [2025-03-04 11:35:52,085 INFO L226 Difference]: Without dead ends: 193 [2025-03-04 11:35:52,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1061 GetRequests, 1053 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:35:52,086 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 14 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:52,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 760 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:35:52,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-04 11:35:52,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-03-04 11:35:52,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 86 states have internal predecessors, (93), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 11:35:52,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 303 transitions. [2025-03-04 11:35:52,112 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 303 transitions. Word has length 529 [2025-03-04 11:35:52,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:52,112 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 303 transitions. [2025-03-04 11:35:52,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.666666666666666) internal successors, (87), 8 states have internal predecessors, (87), 6 states have call successors, (289), 1 states have call predecessors, (289), 2 states have return successors, (290), 6 states have call predecessors, (290), 6 states have call successors, (290) [2025-03-04 11:35:52,113 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 303 transitions. [2025-03-04 11:35:52,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-03-04 11:35:52,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:52,116 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:52,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 11:35:52,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-04 11:35:52,317 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-03-04 11:35:52,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:52,317 INFO L85 PathProgramCache]: Analyzing trace with hash 158658750, now seen corresponding path program 1 times [2025-03-04 11:35:52,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:52,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72025644] [2025-03-04 11:35:52,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:52,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:52,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-03-04 11:35:52,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-03-04 11:35:52,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:52,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:52,531 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 18 proven. 279 refuted. 0 times theorem prover too weak. 19503 trivial. 0 not checked. [2025-03-04 11:35:52,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:52,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72025644] [2025-03-04 11:35:52,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72025644] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:52,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460330769] [2025-03-04 11:35:52,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:52,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:52,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:52,534 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:52,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:35:52,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-03-04 11:35:52,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-03-04 11:35:52,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:52,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:52,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 980 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:35:52,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:52,937 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 18 proven. 279 refuted. 0 times theorem prover too weak. 19503 trivial. 0 not checked. [2025-03-04 11:35:52,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:53,327 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 18 proven. 279 refuted. 0 times theorem prover too weak. 19503 trivial. 0 not checked. [2025-03-04 11:35:53,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460330769] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:53,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:53,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 11:35:53,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475367638] [2025-03-04 11:35:53,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:53,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:35:53,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:53,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:35:53,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:53,331 INFO L87 Difference]: Start difference. First operand 193 states and 303 transitions. Second operand has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (193), 1 states have call predecessors, (193), 2 states have return successors, (194), 4 states have call predecessors, (194), 4 states have call successors, (194) [2025-03-04 11:35:53,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:53,626 INFO L93 Difference]: Finished difference Result 193 states and 303 transitions. [2025-03-04 11:35:53,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:35:53,627 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (193), 1 states have call predecessors, (193), 2 states have return successors, (194), 4 states have call predecessors, (194), 4 states have call successors, (194) Word has length 530 [2025-03-04 11:35:53,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:53,629 INFO L225 Difference]: With dead ends: 193 [2025-03-04 11:35:53,629 INFO L226 Difference]: Without dead ends: 192 [2025-03-04 11:35:53,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1063 GetRequests, 1056 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:53,629 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 18 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:53,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 598 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:35:53,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-04 11:35:53,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2025-03-04 11:35:53,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 85 states have internal predecessors, (92), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 11:35:53,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 302 transitions. [2025-03-04 11:35:53,646 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 302 transitions. Word has length 530 [2025-03-04 11:35:53,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:53,647 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 302 transitions. [2025-03-04 11:35:53,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (193), 1 states have call predecessors, (193), 2 states have return successors, (194), 4 states have call predecessors, (194), 4 states have call successors, (194) [2025-03-04 11:35:53,647 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 302 transitions. [2025-03-04 11:35:53,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-03-04 11:35:53,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:53,651 INFO L218 NwaCegarLoop]: trace histogram [100, 100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:53,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 11:35:53,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 11:35:53,851 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-03-04 11:35:53,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:53,852 INFO L85 PathProgramCache]: Analyzing trace with hash 2138836297, now seen corresponding path program 1 times [2025-03-04 11:35:53,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:53,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849353419] [2025-03-04 11:35:53,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:53,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:53,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-03-04 11:35:53,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-03-04 11:35:53,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:53,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:54,071 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 12 proven. 285 refuted. 0 times theorem prover too weak. 19503 trivial. 0 not checked. [2025-03-04 11:35:54,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:54,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849353419] [2025-03-04 11:35:54,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849353419] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:54,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270030367] [2025-03-04 11:35:54,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:54,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:54,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:54,073 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:54,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 11:35:54,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-03-04 11:35:54,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-03-04 11:35:54,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:54,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:54,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 11:35:54,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:54,623 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 369 proven. 783 refuted. 0 times theorem prover too weak. 18648 trivial. 0 not checked. [2025-03-04 11:35:54,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 19800 backedges. 369 proven. 783 refuted. 0 times theorem prover too weak. 18648 trivial. 0 not checked. [2025-03-04 11:35:55,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270030367] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:55,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:55,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 20 [2025-03-04 11:35:55,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242819823] [2025-03-04 11:35:55,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:55,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 11:35:55,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:55,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 11:35:55,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-03-04 11:35:55,093 INFO L87 Difference]: Start difference. First operand 192 states and 302 transitions. Second operand has 21 states, 19 states have (on average 5.052631578947368) internal successors, (96), 20 states have internal predecessors, (96), 11 states have call successors, (294), 1 states have call predecessors, (294), 2 states have return successors, (296), 10 states have call predecessors, (296), 11 states have call successors, (296) [2025-03-04 11:35:55,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:55,891 INFO L93 Difference]: Finished difference Result 196 states and 307 transitions. [2025-03-04 11:35:55,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 11:35:55,892 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 5.052631578947368) internal successors, (96), 20 states have internal predecessors, (96), 11 states have call successors, (294), 1 states have call predecessors, (294), 2 states have return successors, (296), 10 states have call predecessors, (296), 11 states have call successors, (296) Word has length 533 [2025-03-04 11:35:55,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:55,894 INFO L225 Difference]: With dead ends: 196 [2025-03-04 11:35:55,894 INFO L226 Difference]: Without dead ends: 195 [2025-03-04 11:35:55,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1077 GetRequests, 1050 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2025-03-04 11:35:55,894 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 93 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 1429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:55,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 1625 Invalid, 1619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 1429 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 11:35:55,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-04 11:35:55,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 191. [2025-03-04 11:35:55,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 70 states have (on average 1.3) internal successors, (91), 84 states have internal predecessors, (91), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 11:35:55,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 301 transitions. [2025-03-04 11:35:55,916 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 301 transitions. Word has length 533 [2025-03-04 11:35:55,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:55,916 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 301 transitions. [2025-03-04 11:35:55,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 5.052631578947368) internal successors, (96), 20 states have internal predecessors, (96), 11 states have call successors, (294), 1 states have call predecessors, (294), 2 states have return successors, (296), 10 states have call predecessors, (296), 11 states have call successors, (296) [2025-03-04 11:35:55,917 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 301 transitions. [2025-03-04 11:35:55,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-03-04 11:35:55,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:55,920 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:55,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:56,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 11:35:56,121 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-03-04 11:35:56,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:56,122 INFO L85 PathProgramCache]: Analyzing trace with hash -994552985, now seen corresponding path program 1 times [2025-03-04 11:35:56,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:56,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476620949] [2025-03-04 11:35:56,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:56,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:56,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-03-04 11:35:56,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-03-04 11:35:56,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:56,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:56,311 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 18 proven. 282 refuted. 0 times theorem prover too weak. 19900 trivial. 0 not checked. [2025-03-04 11:35:56,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:56,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476620949] [2025-03-04 11:35:56,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476620949] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:56,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982263583] [2025-03-04 11:35:56,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:56,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:56,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:56,315 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:56,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 11:35:56,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-03-04 11:35:56,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-03-04 11:35:56,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:56,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:56,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 997 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:35:56,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:56,728 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 18 proven. 282 refuted. 0 times theorem prover too weak. 19900 trivial. 0 not checked. [2025-03-04 11:35:56,728 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:57,028 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 18 proven. 282 refuted. 0 times theorem prover too weak. 19900 trivial. 0 not checked. [2025-03-04 11:35:57,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982263583] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:57,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:57,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 11:35:57,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888749607] [2025-03-04 11:35:57,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:57,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:35:57,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:57,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:35:57,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:35:57,030 INFO L87 Difference]: Start difference. First operand 191 states and 301 transitions. Second operand has 10 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 6 states have call successors, (288), 1 states have call predecessors, (288), 2 states have return successors, (289), 6 states have call predecessors, (289), 6 states have call successors, (289) [2025-03-04 11:35:57,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:57,392 INFO L93 Difference]: Finished difference Result 191 states and 301 transitions. [2025-03-04 11:35:57,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:35:57,393 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 6 states have call successors, (288), 1 states have call predecessors, (288), 2 states have return successors, (289), 6 states have call predecessors, (289), 6 states have call successors, (289) Word has length 538 [2025-03-04 11:35:57,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:57,395 INFO L225 Difference]: With dead ends: 191 [2025-03-04 11:35:57,395 INFO L226 Difference]: Without dead ends: 190 [2025-03-04 11:35:57,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1079 GetRequests, 1071 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:35:57,396 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 30 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:57,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 958 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:35:57,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-04 11:35:57,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2025-03-04 11:35:57,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 83 states have internal predecessors, (90), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 11:35:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 300 transitions. [2025-03-04 11:35:57,414 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 300 transitions. Word has length 538 [2025-03-04 11:35:57,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:57,415 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 300 transitions. [2025-03-04 11:35:57,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 6 states have call successors, (288), 1 states have call predecessors, (288), 2 states have return successors, (289), 6 states have call predecessors, (289), 6 states have call successors, (289) [2025-03-04 11:35:57,415 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 300 transitions. [2025-03-04 11:35:57,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2025-03-04 11:35:57,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:57,418 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:57,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:57,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 11:35:57,622 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-03-04 11:35:57,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:57,623 INFO L85 PathProgramCache]: Analyzing trace with hash -766371433, now seen corresponding path program 1 times [2025-03-04 11:35:57,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:57,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423018619] [2025-03-04 11:35:57,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:57,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:57,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-03-04 11:35:57,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-03-04 11:35:57,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:57,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:57,863 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 24 proven. 276 refuted. 0 times theorem prover too weak. 19900 trivial. 0 not checked. [2025-03-04 11:35:57,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:57,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423018619] [2025-03-04 11:35:57,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423018619] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:57,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679454326] [2025-03-04 11:35:57,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:57,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:57,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:57,866 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:57,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 11:35:57,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-03-04 11:35:58,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-03-04 11:35:58,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:58,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:58,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:35:58,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:58,299 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 24 proven. 276 refuted. 0 times theorem prover too weak. 19900 trivial. 0 not checked. [2025-03-04 11:35:58,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:58,658 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 24 proven. 276 refuted. 0 times theorem prover too weak. 19900 trivial. 0 not checked. [2025-03-04 11:35:58,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679454326] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:58,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:58,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2025-03-04 11:35:58,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537089741] [2025-03-04 11:35:58,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:58,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 11:35:58,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:58,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 11:35:58,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:35:58,663 INFO L87 Difference]: Start difference. First operand 190 states and 300 transitions. Second operand has 11 states, 10 states have (on average 9.8) internal successors, (98), 11 states have internal predecessors, (98), 6 states have call successors, (289), 1 states have call predecessors, (289), 2 states have return successors, (290), 6 states have call predecessors, (290), 6 states have call successors, (290) [2025-03-04 11:35:59,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:59,222 INFO L93 Difference]: Finished difference Result 190 states and 300 transitions. [2025-03-04 11:35:59,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:35:59,223 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.8) internal successors, (98), 11 states have internal predecessors, (98), 6 states have call successors, (289), 1 states have call predecessors, (289), 2 states have return successors, (290), 6 states have call predecessors, (290), 6 states have call successors, (290) Word has length 539 [2025-03-04 11:35:59,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:59,224 INFO L225 Difference]: With dead ends: 190 [2025-03-04 11:35:59,224 INFO L226 Difference]: Without dead ends: 189 [2025-03-04 11:35:59,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1087 GetRequests, 1073 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:35:59,225 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 57 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:59,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1134 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:35:59,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-04 11:35:59,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2025-03-04 11:35:59,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 82 states have internal predecessors, (89), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 11:35:59,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 299 transitions. [2025-03-04 11:35:59,241 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 299 transitions. Word has length 539 [2025-03-04 11:35:59,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:59,241 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 299 transitions. [2025-03-04 11:35:59,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.8) internal successors, (98), 11 states have internal predecessors, (98), 6 states have call successors, (289), 1 states have call predecessors, (289), 2 states have return successors, (290), 6 states have call predecessors, (290), 6 states have call successors, (290) [2025-03-04 11:35:59,242 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 299 transitions. [2025-03-04 11:35:59,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2025-03-04 11:35:59,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:59,244 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:59,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 11:35:59,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 11:35:59,445 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-03-04 11:35:59,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:59,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1074813764, now seen corresponding path program 1 times [2025-03-04 11:35:59,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:59,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178261542] [2025-03-04 11:35:59,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:59,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:59,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-03-04 11:35:59,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-03-04 11:35:59,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:59,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:59,706 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 42 proven. 552 refuted. 0 times theorem prover too weak. 19606 trivial. 0 not checked. [2025-03-04 11:35:59,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:59,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178261542] [2025-03-04 11:35:59,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178261542] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:59,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284678047] [2025-03-04 11:35:59,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:59,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:59,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:59,709 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:59,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 11:35:59,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-03-04 11:35:59,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-03-04 11:35:59,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:59,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:59,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 1003 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:35:59,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:00,086 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 18 proven. 282 refuted. 0 times theorem prover too weak. 19900 trivial. 0 not checked. [2025-03-04 11:36:00,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:00,448 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 18 proven. 282 refuted. 0 times theorem prover too weak. 19900 trivial. 0 not checked. [2025-03-04 11:36:00,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284678047] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:00,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:00,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-04 11:36:00,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285333046] [2025-03-04 11:36:00,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:00,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 11:36:00,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:00,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 11:36:00,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:36:00,451 INFO L87 Difference]: Start difference. First operand 189 states and 299 transitions. Second operand has 11 states, 10 states have (on average 10.6) internal successors, (106), 11 states have internal predecessors, (106), 5 states have call successors, (287), 1 states have call predecessors, (287), 2 states have return successors, (287), 5 states have call predecessors, (287), 5 states have call successors, (287) [2025-03-04 11:36:00,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:00,812 INFO L93 Difference]: Finished difference Result 189 states and 299 transitions. [2025-03-04 11:36:00,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:36:00,813 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.6) internal successors, (106), 11 states have internal predecessors, (106), 5 states have call successors, (287), 1 states have call predecessors, (287), 2 states have return successors, (287), 5 states have call predecessors, (287), 5 states have call successors, (287) Word has length 542 [2025-03-04 11:36:00,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:00,815 INFO L225 Difference]: With dead ends: 189 [2025-03-04 11:36:00,815 INFO L226 Difference]: Without dead ends: 188 [2025-03-04 11:36:00,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1091 GetRequests, 1080 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:36:00,815 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 18 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:00,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 981 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:36:00,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-04 11:36:00,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2025-03-04 11:36:00,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 81 states have internal predecessors, (88), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 11:36:00,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 298 transitions. [2025-03-04 11:36:00,832 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 298 transitions. Word has length 542 [2025-03-04 11:36:00,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:00,832 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 298 transitions. [2025-03-04 11:36:00,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.6) internal successors, (106), 11 states have internal predecessors, (106), 5 states have call successors, (287), 1 states have call predecessors, (287), 2 states have return successors, (287), 5 states have call predecessors, (287), 5 states have call successors, (287) [2025-03-04 11:36:00,833 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 298 transitions. [2025-03-04 11:36:00,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2025-03-04 11:36:00,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:00,836 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:36:00,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 11:36:01,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 11:36:01,036 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-03-04 11:36:01,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:01,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1663893560, now seen corresponding path program 1 times [2025-03-04 11:36:01,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:01,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135096251] [2025-03-04 11:36:01,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:01,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:01,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 547 statements into 1 equivalence classes. [2025-03-04 11:36:01,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 547 of 547 statements. [2025-03-04 11:36:01,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:01,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:01,298 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 24 proven. 279 refuted. 0 times theorem prover too weak. 20301 trivial. 0 not checked. [2025-03-04 11:36:01,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:01,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135096251] [2025-03-04 11:36:01,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135096251] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:01,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607590650] [2025-03-04 11:36:01,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:01,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:01,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:01,300 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:36:01,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 11:36:01,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 547 statements into 1 equivalence classes. [2025-03-04 11:36:01,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 547 of 547 statements. [2025-03-04 11:36:01,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:01,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:01,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 11:36:01,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:02,007 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 747 proven. 981 refuted. 0 times theorem prover too weak. 18876 trivial. 0 not checked. [2025-03-04 11:36:02,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:02,655 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 747 proven. 981 refuted. 0 times theorem prover too weak. 18876 trivial. 0 not checked. [2025-03-04 11:36:02,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607590650] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:02,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:02,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13, 15] total 28 [2025-03-04 11:36:02,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645426291] [2025-03-04 11:36:02,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:02,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 11:36:02,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:02,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 11:36:02,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2025-03-04 11:36:02,659 INFO L87 Difference]: Start difference. First operand 188 states and 298 transitions. Second operand has 29 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 15 states have call successors, (296), 1 states have call predecessors, (296), 2 states have return successors, (298), 15 states have call predecessors, (298), 15 states have call successors, (298) [2025-03-04 11:36:03,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:03,571 INFO L93 Difference]: Finished difference Result 196 states and 310 transitions. [2025-03-04 11:36:03,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 11:36:03,572 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 15 states have call successors, (296), 1 states have call predecessors, (296), 2 states have return successors, (298), 15 states have call predecessors, (298), 15 states have call successors, (298) Word has length 547 [2025-03-04 11:36:03,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:03,577 INFO L225 Difference]: With dead ends: 196 [2025-03-04 11:36:03,577 INFO L226 Difference]: Without dead ends: 195 [2025-03-04 11:36:03,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1109 GetRequests, 1070 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=262, Invalid=1378, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 11:36:03,578 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 139 mSDsluCounter, 2160 mSDsCounter, 0 mSdLazyCounter, 1625 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 2334 SdHoareTripleChecker+Invalid, 1724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:03,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 2334 Invalid, 1724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1625 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 11:36:03,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-04 11:36:03,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 187. [2025-03-04 11:36:03,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 80 states have internal predecessors, (87), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 11:36:03,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 297 transitions. [2025-03-04 11:36:03,602 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 297 transitions. Word has length 547 [2025-03-04 11:36:03,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:03,603 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 297 transitions. [2025-03-04 11:36:03,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 15 states have call successors, (296), 1 states have call predecessors, (296), 2 states have return successors, (298), 15 states have call predecessors, (298), 15 states have call successors, (298) [2025-03-04 11:36:03,604 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 297 transitions. [2025-03-04 11:36:03,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-03-04 11:36:03,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:03,608 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:36:03,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 11:36:03,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:03,812 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-03-04 11:36:03,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:03,813 INFO L85 PathProgramCache]: Analyzing trace with hash 41092826, now seen corresponding path program 1 times [2025-03-04 11:36:03,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:03,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908205138] [2025-03-04 11:36:03,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:03,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:03,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-03-04 11:36:03,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-03-04 11:36:03,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:03,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:04,081 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 30 proven. 273 refuted. 0 times theorem prover too weak. 20301 trivial. 0 not checked. [2025-03-04 11:36:04,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:04,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908205138] [2025-03-04 11:36:04,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908205138] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:04,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112320490] [2025-03-04 11:36:04,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:04,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:04,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:04,084 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:36:04,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 11:36:04,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-03-04 11:36:04,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-03-04 11:36:04,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:04,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:04,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:36:04,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:04,464 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 30 proven. 273 refuted. 0 times theorem prover too weak. 20301 trivial. 0 not checked. [2025-03-04 11:36:04,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:04,774 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 30 proven. 273 refuted. 0 times theorem prover too weak. 20301 trivial. 0 not checked. [2025-03-04 11:36:04,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112320490] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:04,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:04,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2025-03-04 11:36:04,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918819931] [2025-03-04 11:36:04,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:04,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 11:36:04,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:04,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 11:36:04,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:36:04,776 INFO L87 Difference]: Start difference. First operand 187 states and 297 transitions. Second operand has 13 states, 12 states have (on average 9.083333333333334) internal successors, (109), 13 states have internal predecessors, (109), 7 states have call successors, (290), 1 states have call predecessors, (290), 2 states have return successors, (291), 7 states have call predecessors, (291), 7 states have call successors, (291) [2025-03-04 11:36:05,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:05,334 INFO L93 Difference]: Finished difference Result 192 states and 304 transitions. [2025-03-04 11:36:05,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 11:36:05,335 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 9.083333333333334) internal successors, (109), 13 states have internal predecessors, (109), 7 states have call successors, (290), 1 states have call predecessors, (290), 2 states have return successors, (291), 7 states have call predecessors, (291), 7 states have call successors, (291) Word has length 548 [2025-03-04 11:36:05,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:05,336 INFO L225 Difference]: With dead ends: 192 [2025-03-04 11:36:05,336 INFO L226 Difference]: Without dead ends: 191 [2025-03-04 11:36:05,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1110 GetRequests, 1091 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:36:05,337 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 64 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:05,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1302 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:36:05,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-04 11:36:05,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 186. [2025-03-04 11:36:05,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 79 states have internal predecessors, (86), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 11:36:05,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 296 transitions. [2025-03-04 11:36:05,353 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 296 transitions. Word has length 548 [2025-03-04 11:36:05,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:05,354 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 296 transitions. [2025-03-04 11:36:05,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 9.083333333333334) internal successors, (109), 13 states have internal predecessors, (109), 7 states have call successors, (290), 1 states have call predecessors, (290), 2 states have return successors, (291), 7 states have call predecessors, (291), 7 states have call successors, (291) [2025-03-04 11:36:05,354 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 296 transitions. [2025-03-04 11:36:05,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2025-03-04 11:36:05,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:05,356 INFO L218 NwaCegarLoop]: trace histogram [102, 102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:36:05,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 11:36:05,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 11:36:05,557 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-03-04 11:36:05,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:05,558 INFO L85 PathProgramCache]: Analyzing trace with hash 130716821, now seen corresponding path program 1 times [2025-03-04 11:36:05,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:05,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149813497] [2025-03-04 11:36:05,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:05,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:05,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 551 statements into 1 equivalence classes. [2025-03-04 11:36:05,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 551 of 551 statements. [2025-03-04 11:36:05,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:05,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:05,816 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 54 proven. 546 refuted. 0 times theorem prover too weak. 20004 trivial. 0 not checked. [2025-03-04 11:36:05,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:05,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149813497] [2025-03-04 11:36:05,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149813497] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:05,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322984035] [2025-03-04 11:36:05,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:05,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:05,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:05,818 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:36:05,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 11:36:05,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 551 statements into 1 equivalence classes. [2025-03-04 11:36:05,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 551 of 551 statements. [2025-03-04 11:36:05,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:05,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:05,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:36:05,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:06,186 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 24 proven. 279 refuted. 0 times theorem prover too weak. 20301 trivial. 0 not checked. [2025-03-04 11:36:06,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:06,492 INFO L134 CoverageAnalysis]: Checked inductivity of 20604 backedges. 24 proven. 279 refuted. 0 times theorem prover too weak. 20301 trivial. 0 not checked. [2025-03-04 11:36:06,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322984035] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:06,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:06,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-04 11:36:06,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446078134] [2025-03-04 11:36:06,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:06,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 11:36:06,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:06,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 11:36:06,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:36:06,495 INFO L87 Difference]: Start difference. First operand 186 states and 296 transitions. Second operand has 11 states, 10 states have (on average 11.6) internal successors, (116), 11 states have internal predecessors, (116), 5 states have call successors, (286), 1 states have call predecessors, (286), 2 states have return successors, (286), 5 states have call predecessors, (286), 5 states have call successors, (286) [2025-03-04 11:36:06,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:06,849 INFO L93 Difference]: Finished difference Result 186 states and 296 transitions. [2025-03-04 11:36:06,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:36:06,850 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.6) internal successors, (116), 11 states have internal predecessors, (116), 5 states have call successors, (286), 1 states have call predecessors, (286), 2 states have return successors, (286), 5 states have call predecessors, (286), 5 states have call successors, (286) Word has length 551 [2025-03-04 11:36:06,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:06,852 INFO L225 Difference]: With dead ends: 186 [2025-03-04 11:36:06,852 INFO L226 Difference]: Without dead ends: 185 [2025-03-04 11:36:06,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1109 GetRequests, 1098 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:36:06,852 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 24 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:06,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 939 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:36:06,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-04 11:36:06,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-03-04 11:36:06,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 78 states have internal predecessors, (85), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 11:36:06,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 295 transitions. [2025-03-04 11:36:06,871 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 295 transitions. Word has length 551 [2025-03-04 11:36:06,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:06,871 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 295 transitions. [2025-03-04 11:36:06,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.6) internal successors, (116), 11 states have internal predecessors, (116), 5 states have call successors, (286), 1 states have call predecessors, (286), 2 states have return successors, (286), 5 states have call predecessors, (286), 5 states have call successors, (286) [2025-03-04 11:36:06,872 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 295 transitions. [2025-03-04 11:36:06,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2025-03-04 11:36:06,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:06,874 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:36:06,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 11:36:07,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 11:36:07,075 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-03-04 11:36:07,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:07,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1060595571, now seen corresponding path program 1 times [2025-03-04 11:36:07,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:07,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694500769] [2025-03-04 11:36:07,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:07,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:07,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 556 statements into 1 equivalence classes. [2025-03-04 11:36:07,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 556 of 556 statements. [2025-03-04 11:36:07,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:07,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:07,289 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 30 proven. 276 refuted. 0 times theorem prover too weak. 20706 trivial. 0 not checked. [2025-03-04 11:36:07,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:07,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694500769] [2025-03-04 11:36:07,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694500769] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:07,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403888131] [2025-03-04 11:36:07,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:07,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:07,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:07,292 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:36:07,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 11:36:07,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 556 statements into 1 equivalence classes. [2025-03-04 11:36:07,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 556 of 556 statements. [2025-03-04 11:36:07,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:07,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:07,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 1033 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 11:36:07,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:08,036 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 777 proven. 969 refuted. 0 times theorem prover too weak. 19266 trivial. 0 not checked. [2025-03-04 11:36:08,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:08,567 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 777 proven. 969 refuted. 0 times theorem prover too weak. 19266 trivial. 0 not checked. [2025-03-04 11:36:08,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403888131] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:08,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:08,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13, 15] total 28 [2025-03-04 11:36:08,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048248808] [2025-03-04 11:36:08,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:08,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 11:36:08,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:08,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 11:36:08,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2025-03-04 11:36:08,570 INFO L87 Difference]: Start difference. First operand 185 states and 295 transitions. Second operand has 29 states, 26 states have (on average 4.653846153846154) internal successors, (121), 26 states have internal predecessors, (121), 15 states have call successors, (295), 1 states have call predecessors, (295), 2 states have return successors, (297), 15 states have call predecessors, (297), 15 states have call successors, (297) [2025-03-04 11:36:09,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:09,395 INFO L93 Difference]: Finished difference Result 193 states and 307 transitions. [2025-03-04 11:36:09,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 11:36:09,396 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 4.653846153846154) internal successors, (121), 26 states have internal predecessors, (121), 15 states have call successors, (295), 1 states have call predecessors, (295), 2 states have return successors, (297), 15 states have call predecessors, (297), 15 states have call successors, (297) Word has length 556 [2025-03-04 11:36:09,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:09,398 INFO L225 Difference]: With dead ends: 193 [2025-03-04 11:36:09,398 INFO L226 Difference]: Without dead ends: 192 [2025-03-04 11:36:09,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1127 GetRequests, 1088 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=262, Invalid=1378, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 11:36:09,398 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 135 mSDsluCounter, 2024 mSDsCounter, 0 mSdLazyCounter, 1627 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 2195 SdHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:09,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 2195 Invalid, 1727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1627 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 11:36:09,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-04 11:36:09,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 184. [2025-03-04 11:36:09,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 70 states have (on average 1.2) internal successors, (84), 77 states have internal predecessors, (84), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 11:36:09,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 294 transitions. [2025-03-04 11:36:09,417 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 294 transitions. Word has length 556 [2025-03-04 11:36:09,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:09,417 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 294 transitions. [2025-03-04 11:36:09,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 4.653846153846154) internal successors, (121), 26 states have internal predecessors, (121), 15 states have call successors, (295), 1 states have call predecessors, (295), 2 states have return successors, (297), 15 states have call predecessors, (297), 15 states have call successors, (297) [2025-03-04 11:36:09,417 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 294 transitions. [2025-03-04 11:36:09,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2025-03-04 11:36:09,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:09,420 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:36:09,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-04 11:36:09,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 11:36:09,624 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-03-04 11:36:09,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:09,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1481275661, now seen corresponding path program 1 times [2025-03-04 11:36:09,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:09,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458373848] [2025-03-04 11:36:09,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:09,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:09,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 557 statements into 1 equivalence classes. [2025-03-04 11:36:09,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 557 of 557 statements. [2025-03-04 11:36:09,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:09,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:09,907 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 36 proven. 270 refuted. 0 times theorem prover too weak. 20706 trivial. 0 not checked. [2025-03-04 11:36:09,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:09,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458373848] [2025-03-04 11:36:09,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458373848] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:09,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338565177] [2025-03-04 11:36:09,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:09,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:09,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:09,909 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:36:09,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 11:36:09,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 557 statements into 1 equivalence classes. [2025-03-04 11:36:10,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 557 of 557 statements. [2025-03-04 11:36:10,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:10,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:10,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 1034 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:36:10,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:10,263 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 36 proven. 270 refuted. 0 times theorem prover too weak. 20706 trivial. 0 not checked. [2025-03-04 11:36:10,263 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:10,553 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 36 proven. 270 refuted. 0 times theorem prover too weak. 20706 trivial. 0 not checked. [2025-03-04 11:36:10,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338565177] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:10,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:10,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 14 [2025-03-04 11:36:10,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242722157] [2025-03-04 11:36:10,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:10,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 11:36:10,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:10,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 11:36:10,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:36:10,556 INFO L87 Difference]: Start difference. First operand 184 states and 294 transitions. Second operand has 15 states, 14 states have (on average 8.571428571428571) internal successors, (120), 15 states have internal predecessors, (120), 8 states have call successors, (291), 1 states have call predecessors, (291), 2 states have return successors, (292), 8 states have call predecessors, (292), 8 states have call successors, (292) [2025-03-04 11:36:11,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:11,244 INFO L93 Difference]: Finished difference Result 196 states and 310 transitions. [2025-03-04 11:36:11,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 11:36:11,244 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 8.571428571428571) internal successors, (120), 15 states have internal predecessors, (120), 8 states have call successors, (291), 1 states have call predecessors, (291), 2 states have return successors, (292), 8 states have call predecessors, (292), 8 states have call successors, (292) Word has length 557 [2025-03-04 11:36:11,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:11,246 INFO L225 Difference]: With dead ends: 196 [2025-03-04 11:36:11,246 INFO L226 Difference]: Without dead ends: 195 [2025-03-04 11:36:11,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1133 GetRequests, 1109 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2025-03-04 11:36:11,246 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 97 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1453 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:11,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1453 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 11:36:11,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-04 11:36:11,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 183. [2025-03-04 11:36:11,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 76 states have internal predecessors, (83), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 11:36:11,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 293 transitions. [2025-03-04 11:36:11,267 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 293 transitions. Word has length 557 [2025-03-04 11:36:11,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:11,268 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 293 transitions. [2025-03-04 11:36:11,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 8.571428571428571) internal successors, (120), 15 states have internal predecessors, (120), 8 states have call successors, (291), 1 states have call predecessors, (291), 2 states have return successors, (292), 8 states have call predecessors, (292), 8 states have call successors, (292) [2025-03-04 11:36:11,269 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 293 transitions. [2025-03-04 11:36:11,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2025-03-04 11:36:11,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:11,271 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:36:11,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 11:36:11,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:11,472 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-03-04 11:36:11,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:11,472 INFO L85 PathProgramCache]: Analyzing trace with hash 2105754448, now seen corresponding path program 1 times [2025-03-04 11:36:11,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:11,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561839748] [2025-03-04 11:36:11,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:11,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:11,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 560 statements into 1 equivalence classes. [2025-03-04 11:36:11,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 560 of 560 statements. [2025-03-04 11:36:11,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:11,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:11,668 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 30 proven. 276 refuted. 0 times theorem prover too weak. 20706 trivial. 0 not checked. [2025-03-04 11:36:11,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:11,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561839748] [2025-03-04 11:36:11,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561839748] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:11,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947772571] [2025-03-04 11:36:11,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:11,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:11,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:11,670 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:36:11,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 11:36:11,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 560 statements into 1 equivalence classes. [2025-03-04 11:36:11,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 560 of 560 statements. [2025-03-04 11:36:11,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:11,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:11,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 11:36:11,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:12,367 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 777 proven. 969 refuted. 0 times theorem prover too weak. 19266 trivial. 0 not checked. [2025-03-04 11:36:12,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:12,883 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 777 proven. 969 refuted. 0 times theorem prover too weak. 19266 trivial. 0 not checked. [2025-03-04 11:36:12,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947772571] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:12,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:12,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 14, 16] total 29 [2025-03-04 11:36:12,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013538153] [2025-03-04 11:36:12,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:12,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 11:36:12,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:12,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 11:36:12,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=772, Unknown=0, NotChecked=0, Total=870 [2025-03-04 11:36:12,885 INFO L87 Difference]: Start difference. First operand 183 states and 293 transitions. Second operand has 30 states, 27 states have (on average 4.7407407407407405) internal successors, (128), 29 states have internal predecessors, (128), 15 states have call successors, (295), 1 states have call predecessors, (295), 2 states have return successors, (297), 14 states have call predecessors, (297), 15 states have call successors, (297) [2025-03-04 11:36:13,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:13,919 INFO L93 Difference]: Finished difference Result 191 states and 303 transitions. [2025-03-04 11:36:13,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 11:36:13,920 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 4.7407407407407405) internal successors, (128), 29 states have internal predecessors, (128), 15 states have call successors, (295), 1 states have call predecessors, (295), 2 states have return successors, (297), 14 states have call predecessors, (297), 15 states have call successors, (297) Word has length 560 [2025-03-04 11:36:13,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:13,922 INFO L225 Difference]: With dead ends: 191 [2025-03-04 11:36:13,922 INFO L226 Difference]: Without dead ends: 190 [2025-03-04 11:36:13,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1136 GetRequests, 1095 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=249, Invalid=1473, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 11:36:13,923 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 139 mSDsluCounter, 2255 mSDsCounter, 0 mSdLazyCounter, 2227 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 2421 SdHoareTripleChecker+Invalid, 2416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 2227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:13,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 2421 Invalid, 2416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 2227 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 11:36:13,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-04 11:36:13,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 182. [2025-03-04 11:36:13,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 75 states have internal predecessors, (82), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 11:36:13,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 292 transitions. [2025-03-04 11:36:13,941 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 292 transitions. Word has length 560 [2025-03-04 11:36:13,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:13,942 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 292 transitions. [2025-03-04 11:36:13,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 4.7407407407407405) internal successors, (128), 29 states have internal predecessors, (128), 15 states have call successors, (295), 1 states have call predecessors, (295), 2 states have return successors, (297), 14 states have call predecessors, (297), 15 states have call successors, (297) [2025-03-04 11:36:13,942 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 292 transitions. [2025-03-04 11:36:13,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2025-03-04 11:36:13,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:13,945 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:36:13,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 11:36:14,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:14,145 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-03-04 11:36:14,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:14,146 INFO L85 PathProgramCache]: Analyzing trace with hash -672781436, now seen corresponding path program 1 times [2025-03-04 11:36:14,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:14,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611537663] [2025-03-04 11:36:14,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:14,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:14,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 565 statements into 1 equivalence classes. [2025-03-04 11:36:14,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 565 of 565 statements. [2025-03-04 11:36:14,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:14,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:14,357 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 36 proven. 273 refuted. 0 times theorem prover too weak. 21115 trivial. 0 not checked. [2025-03-04 11:36:14,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:14,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611537663] [2025-03-04 11:36:14,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611537663] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:14,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580149640] [2025-03-04 11:36:14,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:14,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:14,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:14,360 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:36:14,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 11:36:14,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 565 statements into 1 equivalence classes. [2025-03-04 11:36:14,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 565 of 565 statements. [2025-03-04 11:36:14,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:14,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:14,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 1051 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 11:36:14,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:14,825 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 453 proven. 747 refuted. 0 times theorem prover too weak. 20224 trivial. 0 not checked. [2025-03-04 11:36:14,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:15,207 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 453 proven. 747 refuted. 0 times theorem prover too weak. 20224 trivial. 0 not checked. [2025-03-04 11:36:15,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580149640] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:15,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:15,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 10] total 19 [2025-03-04 11:36:15,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457995349] [2025-03-04 11:36:15,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:15,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 11:36:15,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:15,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 11:36:15,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:36:15,209 INFO L87 Difference]: Start difference. First operand 182 states and 292 transitions. Second operand has 20 states, 18 states have (on average 7.166666666666667) internal successors, (129), 17 states have internal predecessors, (129), 11 states have call successors, (290), 1 states have call predecessors, (290), 2 states have return successors, (292), 11 states have call predecessors, (292), 11 states have call successors, (292) [2025-03-04 11:36:15,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:15,749 INFO L93 Difference]: Finished difference Result 186 states and 299 transitions. [2025-03-04 11:36:15,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:36:15,750 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 7.166666666666667) internal successors, (129), 17 states have internal predecessors, (129), 11 states have call successors, (290), 1 states have call predecessors, (290), 2 states have return successors, (292), 11 states have call predecessors, (292), 11 states have call successors, (292) Word has length 565 [2025-03-04 11:36:15,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:15,751 INFO L225 Difference]: With dead ends: 186 [2025-03-04 11:36:15,751 INFO L226 Difference]: Without dead ends: 185 [2025-03-04 11:36:15,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1140 GetRequests, 1115 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2025-03-04 11:36:15,752 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 134 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:15,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1461 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:36:15,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-04 11:36:15,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 181. [2025-03-04 11:36:15,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 74 states have internal predecessors, (81), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 11:36:15,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 291 transitions. [2025-03-04 11:36:15,772 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 291 transitions. Word has length 565 [2025-03-04 11:36:15,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:15,772 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 291 transitions. [2025-03-04 11:36:15,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 7.166666666666667) internal successors, (129), 17 states have internal predecessors, (129), 11 states have call successors, (290), 1 states have call predecessors, (290), 2 states have return successors, (292), 11 states have call predecessors, (292), 11 states have call successors, (292) [2025-03-04 11:36:15,772 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 291 transitions. [2025-03-04 11:36:15,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2025-03-04 11:36:15,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:15,775 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:36:15,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-04 11:36:15,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 11:36:15,976 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-03-04 11:36:15,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:15,976 INFO L85 PathProgramCache]: Analyzing trace with hash 618611958, now seen corresponding path program 1 times [2025-03-04 11:36:15,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:15,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472095383] [2025-03-04 11:36:15,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:15,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:15,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 566 statements into 1 equivalence classes. [2025-03-04 11:36:16,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 566 of 566 statements. [2025-03-04 11:36:16,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:16,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:16,328 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 42 proven. 267 refuted. 0 times theorem prover too weak. 21115 trivial. 0 not checked. [2025-03-04 11:36:16,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:16,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472095383] [2025-03-04 11:36:16,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472095383] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:16,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46656923] [2025-03-04 11:36:16,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:16,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:16,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:16,330 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:36:16,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 11:36:16,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 566 statements into 1 equivalence classes. [2025-03-04 11:36:16,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 566 of 566 statements. [2025-03-04 11:36:16,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:16,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:16,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 1052 conjuncts, 98 conjuncts are in the unsatisfiable core [2025-03-04 11:36:16,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:18,744 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 2667 proven. 1338 refuted. 0 times theorem prover too weak. 17419 trivial. 0 not checked. [2025-03-04 11:36:18,745 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:23,850 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 2667 proven. 1338 refuted. 0 times theorem prover too weak. 17419 trivial. 0 not checked. [2025-03-04 11:36:23,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46656923] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:23,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:23,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 32, 36] total 74 [2025-03-04 11:36:23,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106543708] [2025-03-04 11:36:23,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:23,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2025-03-04 11:36:23,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:23,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2025-03-04 11:36:23,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=5198, Unknown=0, NotChecked=0, Total=5550 [2025-03-04 11:36:23,855 INFO L87 Difference]: Start difference. First operand 181 states and 291 transitions. Second operand has 75 states, 60 states have (on average 2.2333333333333334) internal successors, (134), 67 states have internal predecessors, (134), 40 states have call successors, (296), 1 states have call predecessors, (296), 2 states have return successors, (297), 39 states have call predecessors, (297), 40 states have call successors, (297) [2025-03-04 11:36:29,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:29,576 INFO L93 Difference]: Finished difference Result 246 states and 375 transitions. [2025-03-04 11:36:29,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-03-04 11:36:29,577 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 60 states have (on average 2.2333333333333334) internal successors, (134), 67 states have internal predecessors, (134), 40 states have call successors, (296), 1 states have call predecessors, (296), 2 states have return successors, (297), 39 states have call predecessors, (297), 40 states have call successors, (297) Word has length 566 [2025-03-04 11:36:29,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:29,580 INFO L225 Difference]: With dead ends: 246 [2025-03-04 11:36:29,580 INFO L226 Difference]: Without dead ends: 245 [2025-03-04 11:36:29,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1202 GetRequests, 1069 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3781 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1171, Invalid=16651, Unknown=0, NotChecked=0, Total=17822 [2025-03-04 11:36:29,585 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 254 mSDsluCounter, 4527 mSDsCounter, 0 mSdLazyCounter, 6861 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 4680 SdHoareTripleChecker+Invalid, 7376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 6861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:29,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 4680 Invalid, 7376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [515 Valid, 6861 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-04 11:36:29,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-04 11:36:29,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 200. [2025-03-04 11:36:29,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 85 states have (on average 1.1647058823529413) internal successors, (99), 89 states have internal predecessors, (99), 109 states have call successors, (109), 1 states have call predecessors, (109), 1 states have return successors, (109), 109 states have call predecessors, (109), 109 states have call successors, (109) [2025-03-04 11:36:29,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 317 transitions. [2025-03-04 11:36:29,630 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 317 transitions. Word has length 566 [2025-03-04 11:36:29,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:29,632 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 317 transitions. [2025-03-04 11:36:29,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 60 states have (on average 2.2333333333333334) internal successors, (134), 67 states have internal predecessors, (134), 40 states have call successors, (296), 1 states have call predecessors, (296), 2 states have return successors, (297), 39 states have call predecessors, (297), 40 states have call successors, (297) [2025-03-04 11:36:29,633 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 317 transitions. [2025-03-04 11:36:29,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2025-03-04 11:36:29,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:29,636 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:36:29,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-04 11:36:29,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 11:36:29,837 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-03-04 11:36:29,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:29,837 INFO L85 PathProgramCache]: Analyzing trace with hash 653958617, now seen corresponding path program 1 times [2025-03-04 11:36:29,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:29,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044443691] [2025-03-04 11:36:29,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:29,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:29,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-03-04 11:36:29,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-03-04 11:36:29,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:29,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:30,098 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 78 proven. 534 refuted. 0 times theorem prover too weak. 20812 trivial. 0 not checked. [2025-03-04 11:36:30,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:30,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044443691] [2025-03-04 11:36:30,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044443691] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:30,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505576877] [2025-03-04 11:36:30,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:30,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:30,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:30,101 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:36:30,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 11:36:30,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-03-04 11:36:30,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-03-04 11:36:30,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:30,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:30,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 1054 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:36:30,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:30,464 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 42 proven. 267 refuted. 0 times theorem prover too weak. 21115 trivial. 0 not checked. [2025-03-04 11:36:30,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:30,765 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 42 proven. 267 refuted. 0 times theorem prover too weak. 21115 trivial. 0 not checked. [2025-03-04 11:36:30,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505576877] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:30,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:30,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 11:36:30,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747364303] [2025-03-04 11:36:30,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:30,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:36:30,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:30,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:36:30,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:36:30,767 INFO L87 Difference]: Start difference. First operand 200 states and 317 transitions. Second operand has 10 states, 9 states have (on average 15.11111111111111) internal successors, (136), 10 states have internal predecessors, (136), 6 states have call successors, (285), 1 states have call predecessors, (285), 2 states have return successors, (286), 6 states have call predecessors, (286), 6 states have call successors, (286) [2025-03-04 11:36:31,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:31,150 INFO L93 Difference]: Finished difference Result 200 states and 317 transitions. [2025-03-04 11:36:31,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:36:31,151 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 15.11111111111111) internal successors, (136), 10 states have internal predecessors, (136), 6 states have call successors, (285), 1 states have call predecessors, (285), 2 states have return successors, (286), 6 states have call predecessors, (286), 6 states have call successors, (286) Word has length 568 [2025-03-04 11:36:31,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:31,152 INFO L225 Difference]: With dead ends: 200 [2025-03-04 11:36:31,153 INFO L226 Difference]: Without dead ends: 199 [2025-03-04 11:36:31,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1142 GetRequests, 1132 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:36:31,153 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 86 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:31,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 892 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:36:31,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-04 11:36:31,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 180. [2025-03-04 11:36:31,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 70 states have (on average 1.1428571428571428) internal successors, (80), 73 states have internal predecessors, (80), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 11:36:31,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 290 transitions. [2025-03-04 11:36:31,181 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 290 transitions. Word has length 568 [2025-03-04 11:36:31,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:31,181 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 290 transitions. [2025-03-04 11:36:31,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 15.11111111111111) internal successors, (136), 10 states have internal predecessors, (136), 6 states have call successors, (285), 1 states have call predecessors, (285), 2 states have return successors, (286), 6 states have call predecessors, (286), 6 states have call successors, (286) [2025-03-04 11:36:31,182 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 290 transitions. [2025-03-04 11:36:31,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-04 11:36:31,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:31,184 INFO L218 NwaCegarLoop]: trace histogram [104, 104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:36:31,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-04 11:36:31,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:31,385 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-03-04 11:36:31,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:31,386 INFO L85 PathProgramCache]: Analyzing trace with hash -635833375, now seen corresponding path program 1 times [2025-03-04 11:36:31,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:31,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302298198] [2025-03-04 11:36:31,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:31,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:31,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-04 11:36:31,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-04 11:36:31,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:31,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:31,647 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 78 proven. 534 refuted. 0 times theorem prover too weak. 20812 trivial. 0 not checked. [2025-03-04 11:36:31,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:31,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302298198] [2025-03-04 11:36:31,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302298198] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:31,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542910174] [2025-03-04 11:36:31,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:31,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:31,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:31,649 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:36:31,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 11:36:31,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-04 11:36:31,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-04 11:36:31,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:31,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:31,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:36:31,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:32,009 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 36 proven. 273 refuted. 0 times theorem prover too weak. 21115 trivial. 0 not checked. [2025-03-04 11:36:32,010 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:32,319 INFO L134 CoverageAnalysis]: Checked inductivity of 21424 backedges. 36 proven. 273 refuted. 0 times theorem prover too weak. 21115 trivial. 0 not checked. [2025-03-04 11:36:32,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542910174] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:32,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:32,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-04 11:36:32,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027939112] [2025-03-04 11:36:32,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:32,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 11:36:32,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:32,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 11:36:32,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:36:32,321 INFO L87 Difference]: Start difference. First operand 180 states and 290 transitions. Second operand has 11 states, 10 states have (on average 13.6) internal successors, (136), 11 states have internal predecessors, (136), 5 states have call successors, (284), 1 states have call predecessors, (284), 2 states have return successors, (284), 5 states have call predecessors, (284), 5 states have call successors, (284) [2025-03-04 11:36:32,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:32,768 INFO L93 Difference]: Finished difference Result 180 states and 290 transitions. [2025-03-04 11:36:32,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:36:32,769 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 13.6) internal successors, (136), 11 states have internal predecessors, (136), 5 states have call successors, (284), 1 states have call predecessors, (284), 2 states have return successors, (284), 5 states have call predecessors, (284), 5 states have call successors, (284) Word has length 569 [2025-03-04 11:36:32,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:32,771 INFO L225 Difference]: With dead ends: 180 [2025-03-04 11:36:32,771 INFO L226 Difference]: Without dead ends: 179 [2025-03-04 11:36:32,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1145 GetRequests, 1134 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:36:32,771 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 54 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:32,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 800 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:36:32,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-04 11:36:32,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2025-03-04 11:36:32,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 72 states have internal predecessors, (79), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 11:36:32,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 289 transitions. [2025-03-04 11:36:32,799 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 289 transitions. Word has length 569 [2025-03-04 11:36:32,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:32,800 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 289 transitions. [2025-03-04 11:36:32,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 13.6) internal successors, (136), 11 states have internal predecessors, (136), 5 states have call successors, (284), 1 states have call predecessors, (284), 2 states have return successors, (284), 5 states have call predecessors, (284), 5 states have call successors, (284) [2025-03-04 11:36:32,800 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 289 transitions. [2025-03-04 11:36:32,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-03-04 11:36:32,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:32,802 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:36:32,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-04 11:36:33,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:33,003 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-03-04 11:36:33,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:33,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1182573439, now seen corresponding path program 1 times [2025-03-04 11:36:33,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:33,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421364323] [2025-03-04 11:36:33,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:33,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:33,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-03-04 11:36:33,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-03-04 11:36:33,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:33,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:33,214 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 42 proven. 270 refuted. 0 times theorem prover too weak. 21528 trivial. 0 not checked. [2025-03-04 11:36:33,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:33,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421364323] [2025-03-04 11:36:33,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421364323] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:33,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928753877] [2025-03-04 11:36:33,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:33,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:33,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:33,217 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:36:33,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 11:36:33,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-03-04 11:36:33,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-03-04 11:36:33,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:33,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:33,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 1069 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 11:36:33,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:33,730 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 474 proven. 738 refuted. 0 times theorem prover too weak. 20628 trivial. 0 not checked. [2025-03-04 11:36:33,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:34,105 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 474 proven. 738 refuted. 0 times theorem prover too weak. 20628 trivial. 0 not checked. [2025-03-04 11:36:34,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928753877] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:34,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:34,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 10] total 19 [2025-03-04 11:36:34,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536914909] [2025-03-04 11:36:34,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:34,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 11:36:34,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:34,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 11:36:34,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:36:34,107 INFO L87 Difference]: Start difference. First operand 179 states and 289 transitions. Second operand has 20 states, 18 states have (on average 7.722222222222222) internal successors, (139), 17 states have internal predecessors, (139), 11 states have call successors, (289), 1 states have call predecessors, (289), 2 states have return successors, (291), 11 states have call predecessors, (291), 11 states have call successors, (291) [2025-03-04 11:36:34,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:34,784 INFO L93 Difference]: Finished difference Result 183 states and 296 transitions. [2025-03-04 11:36:34,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:36:34,784 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 7.722222222222222) internal successors, (139), 17 states have internal predecessors, (139), 11 states have call successors, (289), 1 states have call predecessors, (289), 2 states have return successors, (291), 11 states have call predecessors, (291), 11 states have call successors, (291) Word has length 574 [2025-03-04 11:36:34,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:34,786 INFO L225 Difference]: With dead ends: 183 [2025-03-04 11:36:34,786 INFO L226 Difference]: Without dead ends: 182 [2025-03-04 11:36:34,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1158 GetRequests, 1133 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2025-03-04 11:36:34,787 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 173 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:34,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1417 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 11:36:34,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-04 11:36:34,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 178. [2025-03-04 11:36:34,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 71 states have internal predecessors, (78), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 11:36:34,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 288 transitions. [2025-03-04 11:36:34,824 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 288 transitions. Word has length 574 [2025-03-04 11:36:34,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:34,825 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 288 transitions. [2025-03-04 11:36:34,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 7.722222222222222) internal successors, (139), 17 states have internal predecessors, (139), 11 states have call successors, (289), 1 states have call predecessors, (289), 2 states have return successors, (291), 11 states have call predecessors, (291), 11 states have call successors, (291) [2025-03-04 11:36:34,825 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 288 transitions. [2025-03-04 11:36:34,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-03-04 11:36:34,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:34,827 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:36:34,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-04 11:36:35,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 11:36:35,028 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-03-04 11:36:35,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:35,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1994929073, now seen corresponding path program 1 times [2025-03-04 11:36:35,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:35,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914254265] [2025-03-04 11:36:35,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:35,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:35,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-04 11:36:35,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-04 11:36:35,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:35,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:35,437 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 48 proven. 264 refuted. 0 times theorem prover too weak. 21528 trivial. 0 not checked. [2025-03-04 11:36:35,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:35,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914254265] [2025-03-04 11:36:35,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914254265] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:35,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301146883] [2025-03-04 11:36:35,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:35,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:35,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:35,439 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:36:35,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-04 11:36:35,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-03-04 11:36:35,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-03-04 11:36:35,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:35,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:35,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 1070 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:36:35,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:35,812 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 48 proven. 264 refuted. 0 times theorem prover too weak. 21528 trivial. 0 not checked. [2025-03-04 11:36:35,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:36,118 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 48 proven. 264 refuted. 0 times theorem prover too weak. 21528 trivial. 0 not checked. [2025-03-04 11:36:36,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301146883] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:36,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:36,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 5] total 18 [2025-03-04 11:36:36,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597520506] [2025-03-04 11:36:36,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:36,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 11:36:36,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:36,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 11:36:36,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:36:36,120 INFO L87 Difference]: Start difference. First operand 178 states and 288 transitions. Second operand has 19 states, 18 states have (on average 7.888888888888889) internal successors, (142), 19 states have internal predecessors, (142), 10 states have call successors, (293), 1 states have call predecessors, (293), 2 states have return successors, (294), 10 states have call predecessors, (294), 10 states have call successors, (294) [2025-03-04 11:36:37,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:37,165 INFO L93 Difference]: Finished difference Result 204 states and 322 transitions. [2025-03-04 11:36:37,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 11:36:37,166 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 7.888888888888889) internal successors, (142), 19 states have internal predecessors, (142), 10 states have call successors, (293), 1 states have call predecessors, (293), 2 states have return successors, (294), 10 states have call predecessors, (294), 10 states have call successors, (294) Word has length 575 [2025-03-04 11:36:37,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:37,167 INFO L225 Difference]: With dead ends: 204 [2025-03-04 11:36:37,167 INFO L226 Difference]: Without dead ends: 203 [2025-03-04 11:36:37,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1179 GetRequests, 1145 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=1038, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 11:36:37,168 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 133 mSDsluCounter, 1820 mSDsCounter, 0 mSdLazyCounter, 2475 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1969 SdHoareTripleChecker+Invalid, 2568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:37,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1969 Invalid, 2568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2475 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 11:36:37,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-04 11:36:37,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 177. [2025-03-04 11:36:37,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 70 states have (on average 1.1) internal successors, (77), 70 states have internal predecessors, (77), 105 states have call successors, (105), 1 states have call predecessors, (105), 1 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 11:36:37,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 287 transitions. [2025-03-04 11:36:37,201 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 287 transitions. Word has length 575 [2025-03-04 11:36:37,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:37,202 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 287 transitions. [2025-03-04 11:36:37,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 7.888888888888889) internal successors, (142), 19 states have internal predecessors, (142), 10 states have call successors, (293), 1 states have call predecessors, (293), 2 states have return successors, (294), 10 states have call predecessors, (294), 10 states have call successors, (294) [2025-03-04 11:36:37,202 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 287 transitions. [2025-03-04 11:36:37,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2025-03-04 11:36:37,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:37,205 INFO L218 NwaCegarLoop]: trace histogram [105, 105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:36:37,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-04 11:36:37,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 11:36:37,405 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 29 more)] === [2025-03-04 11:36:37,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:37,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1469557924, now seen corresponding path program 1 times [2025-03-04 11:36:37,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:37,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379847198] [2025-03-04 11:36:37,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:37,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:37,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 578 statements into 1 equivalence classes. [2025-03-04 11:36:37,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 578 of 578 statements. [2025-03-04 11:36:37,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:37,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:37,659 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 42 proven. 270 refuted. 0 times theorem prover too weak. 21528 trivial. 0 not checked. [2025-03-04 11:36:37,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:37,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379847198] [2025-03-04 11:36:37,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379847198] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:37,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102710639] [2025-03-04 11:36:37,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:37,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:37,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:37,662 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:36:37,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-04 11:36:37,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 578 statements into 1 equivalence classes. [2025-03-04 11:36:37,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 578 of 578 statements. [2025-03-04 11:36:37,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:37,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:37,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:36:37,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:38,031 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 42 proven. 270 refuted. 0 times theorem prover too weak. 21528 trivial. 0 not checked. [2025-03-04 11:36:38,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:38,379 INFO L134 CoverageAnalysis]: Checked inductivity of 21840 backedges. 42 proven. 270 refuted. 0 times theorem prover too weak. 21528 trivial. 0 not checked. [2025-03-04 11:36:38,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102710639] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:38,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:38,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-04 11:36:38,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751165576] [2025-03-04 11:36:38,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:38,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:36:38,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:38,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:36:38,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:36:38,381 INFO L87 Difference]: Start difference. First operand 177 states and 287 transitions. Second operand has 9 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 4 states have call successors, (194), 1 states have call predecessors, (194), 2 states have return successors, (194), 4 states have call predecessors, (194), 4 states have call successors, (194) [2025-03-04 11:36:38,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:38,752 INFO L93 Difference]: Finished difference Result 177 states and 287 transitions. [2025-03-04 11:36:38,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:36:38,752 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 4 states have call successors, (194), 1 states have call predecessors, (194), 2 states have return successors, (194), 4 states have call predecessors, (194), 4 states have call successors, (194) Word has length 578 [2025-03-04 11:36:38,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:38,753 INFO L225 Difference]: With dead ends: 177 [2025-03-04 11:36:38,753 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 11:36:38,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1160 GetRequests, 1151 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:36:38,754 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 42 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:38,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 668 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:36:38,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 11:36:38,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 11:36:38,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:36:38,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 11:36:38,755 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 578 [2025-03-04 11:36:38,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:38,755 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 11:36:38,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 4 states have call successors, (194), 1 states have call predecessors, (194), 2 states have return successors, (194), 4 states have call predecessors, (194), 4 states have call successors, (194) [2025-03-04 11:36:38,755 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 11:36:38,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 11:36:38,757 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 32 remaining) [2025-03-04 11:36:38,758 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 32 remaining) [2025-03-04 11:36:38,758 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 32 remaining) [2025-03-04 11:36:38,758 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 32 remaining) [2025-03-04 11:36:38,758 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 32 remaining) [2025-03-04 11:36:38,758 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 32 remaining) [2025-03-04 11:36:38,758 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 32 remaining) [2025-03-04 11:36:38,758 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 32 remaining) [2025-03-04 11:36:38,758 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 32 remaining) [2025-03-04 11:36:38,758 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 32 remaining) [2025-03-04 11:36:38,758 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 32 remaining) [2025-03-04 11:36:38,758 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 32 remaining) [2025-03-04 11:36:38,758 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 32 remaining) [2025-03-04 11:36:38,758 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 32 remaining) [2025-03-04 11:36:38,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 32 remaining) [2025-03-04 11:36:38,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 32 remaining) [2025-03-04 11:36:38,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 32 remaining) [2025-03-04 11:36:38,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 32 remaining) [2025-03-04 11:36:38,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 32 remaining) [2025-03-04 11:36:38,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 32 remaining) [2025-03-04 11:36:38,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 32 remaining) [2025-03-04 11:36:38,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 32 remaining) [2025-03-04 11:36:38,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 32 remaining) [2025-03-04 11:36:38,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 32 remaining) [2025-03-04 11:36:38,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 32 remaining) [2025-03-04 11:36:38,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 32 remaining) [2025-03-04 11:36:38,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 32 remaining) [2025-03-04 11:36:38,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 32 remaining) [2025-03-04 11:36:38,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 32 remaining) [2025-03-04 11:36:38,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 32 remaining) [2025-03-04 11:36:38,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 32 remaining) [2025-03-04 11:36:38,759 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 32 remaining) [2025-03-04 11:36:38,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-03-04 11:36:38,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 11:36:38,962 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:36:38,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 11:36:46,084 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 11:36:46,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 11:36:46 BoogieIcfgContainer [2025-03-04 11:36:46,089 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 11:36:46,089 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 11:36:46,089 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 11:36:46,089 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 11:36:46,092 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:35:36" (3/4) ... [2025-03-04 11:36:46,094 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 11:36:46,099 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume [2025-03-04 11:36:46,107 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-04 11:36:46,109 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 11:36:46,109 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 11:36:46,110 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 11:36:46,190 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 11:36:46,190 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 11:36:46,190 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 11:36:46,191 INFO L158 Benchmark]: Toolchain (without parser) took 70536.45ms. Allocated memory was 167.8MB in the beginning and 645.9MB in the end (delta: 478.2MB). Free memory was 122.5MB in the beginning and 420.9MB in the end (delta: -298.3MB). Peak memory consumption was 179.8MB. Max. memory is 16.1GB. [2025-03-04 11:36:46,191 INFO L158 Benchmark]: CDTParser took 0.98ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:36:46,191 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.15ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 109.9MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:36:46,191 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.36ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 107.9MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:36:46,191 INFO L158 Benchmark]: Boogie Preprocessor took 29.15ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 105.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:36:46,191 INFO L158 Benchmark]: IcfgBuilder took 424.88ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 77.9MB in the end (delta: 28.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 11:36:46,191 INFO L158 Benchmark]: TraceAbstraction took 69738.09ms. Allocated memory was 167.8MB in the beginning and 645.9MB in the end (delta: 478.2MB). Free memory was 76.9MB in the beginning and 429.0MB in the end (delta: -352.1MB). Peak memory consumption was 350.4MB. Max. memory is 16.1GB. [2025-03-04 11:36:46,192 INFO L158 Benchmark]: Witness Printer took 100.86ms. Allocated memory is still 645.9MB. Free memory was 429.0MB in the beginning and 420.9MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:36:46,192 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.98ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.15ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 109.9MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.36ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 107.9MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.15ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 105.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 424.88ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 77.9MB in the end (delta: 28.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 69738.09ms. Allocated memory was 167.8MB in the beginning and 645.9MB in the end (delta: 478.2MB). Free memory was 76.9MB in the beginning and 429.0MB in the end (delta: -352.1MB). Peak memory consumption was 350.4MB. Max. memory is 16.1GB. * Witness Printer took 100.86ms. Allocated memory is still 645.9MB. Free memory was 429.0MB in the beginning and 420.9MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 183]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 183]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 182]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 182]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 180]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 180]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 179]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 179]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 177]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 177]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 176]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 176]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 174]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 174]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 173]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 173]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 171]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 171]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 170]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 170]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 168]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 168]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 167]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 167]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 165]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 165]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 164]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 164]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 162]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 162]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 161]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 161]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 215 locations, 32 error locations. Started 1 CEGAR loops. OverallTime: 62.6s, OverallIterations: 27, TraceHistogramMax: 105, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 19.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1758 SdHoareTripleChecker+Valid, 14.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1757 mSDsluCounter, 36483 SdHoareTripleChecker+Invalid, 12.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31371 mSDsCounter, 1846 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31266 IncrementalHoareTripleChecker+Invalid, 33112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1846 mSolverCounterUnsat, 5112 mSDtfsCounter, 31266 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28064 GetRequests, 27505 SyntacticMatches, 18 SemanticMatches, 541 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5138 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=0, InterpolantAutomatonStates: 320, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 27 MinimizatonAttempts, 143 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 32.1s InterpolantComputationTime, 28792 NumberOfCodeBlocks, 28792 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 42342 ConstructedInterpolants, 0 QuantifiedInterpolants, 101893 SizeOfPredicates, 78 NumberOfNonLiveVariables, 26197 ConjunctsInSsa, 416 ConjunctsInUnsatCore, 78 InterpolantComputations, 2 PerfectInterpolantSequences, 1558828/1590972 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 32 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 11:36:46,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE