./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/xcsp/AllInterval-008.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-008.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 8f1a1519dc3ac954bb27ae35f40dd4ee3500f707e2df097fc14441b899353328 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:35:32,704 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:35:32,745 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:32,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:35:32,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:35:32,764 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:35:32,764 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:35:32,764 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:35:32,764 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:35:32,765 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:35:32,765 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:35:32,765 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:35:32,765 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:35:32,765 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:35:32,765 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:35:32,765 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:35:32,765 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:35:32,765 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:35:32,766 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:35:32,766 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:35:32,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:35:32,766 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:35:32,766 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:35:32,766 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:35:32,766 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:35:32,766 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:35:32,766 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:35:32,766 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:35:32,766 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:35:32,767 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:35:32,767 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:35:32,767 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:35:32,767 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:35:32,767 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:35:32,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:35:32,767 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:35:32,767 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:35:32,767 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:35:32,767 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:35:32,767 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:35:32,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:35:32,768 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:35:32,768 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:35:32,768 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:35:32,768 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:35:32,768 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 -> 8f1a1519dc3ac954bb27ae35f40dd4ee3500f707e2df097fc14441b899353328 [2025-03-04 11:35:33,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:35:33,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:35:33,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:35:33,009 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:35:33,009 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:35:33,011 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/xcsp/AllInterval-008.c [2025-03-04 11:35:34,153 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c218e0d53/22563ee4adda4d7f8cce88189581334b/FLAGf59ba0678 [2025-03-04 11:35:34,397 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:35:34,398 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-008.c [2025-03-04 11:35:34,407 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c218e0d53/22563ee4adda4d7f8cce88189581334b/FLAGf59ba0678 [2025-03-04 11:35:34,716 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c218e0d53/22563ee4adda4d7f8cce88189581334b [2025-03-04 11:35:34,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:35:34,720 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:35:34,721 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:35:34,721 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:35:34,724 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:35:34,724 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:35:34" (1/1) ... [2025-03-04 11:35:34,725 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12fdff9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:34, skipping insertion in model container [2025-03-04 11:35:34,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:35:34" (1/1) ... [2025-03-04 11:35:34,739 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:35:34,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:35:34,872 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:35:34,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:35:34,918 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:35:34,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:34 WrapperNode [2025-03-04 11:35:34,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:35:34,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:35:34,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:35:34,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:35:34,926 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:34" (1/1) ... [2025-03-04 11:35:34,933 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:34" (1/1) ... [2025-03-04 11:35:34,959 INFO L138 Inliner]: procedures = 13, calls = 94, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 249 [2025-03-04 11:35:34,964 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:35:34,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:35:34,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:35:34,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:35:34,973 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:34" (1/1) ... [2025-03-04 11:35:34,974 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:34" (1/1) ... [2025-03-04 11:35:34,975 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:34" (1/1) ... [2025-03-04 11:35:34,990 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:34,993 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:34" (1/1) ... [2025-03-04 11:35:34,994 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:34" (1/1) ... [2025-03-04 11:35:34,997 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:34" (1/1) ... [2025-03-04 11:35:35,001 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:34" (1/1) ... [2025-03-04 11:35:35,002 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:34" (1/1) ... [2025-03-04 11:35:35,004 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:34" (1/1) ... [2025-03-04 11:35:35,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:35:35,008 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:35:35,008 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:35:35,008 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:35:35,009 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:34" (1/1) ... [2025-03-04 11:35:35,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:35:35,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:35,041 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,043 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,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:35:35,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:35:35,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:35:35,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:35:35,064 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2025-03-04 11:35:35,064 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2025-03-04 11:35:35,118 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:35:35,120 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:35:35,401 INFO L? ?]: Removed 69 outVars from TransFormulas that were not future-live. [2025-03-04 11:35:35,401 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:35:35,412 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:35:35,412 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:35:35,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:35:35 BoogieIcfgContainer [2025-03-04 11:35:35,413 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:35:35,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:35:35,414 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:35:35,417 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:35:35,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:35:34" (1/3) ... [2025-03-04 11:35:35,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@154c3332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:35:35, skipping insertion in model container [2025-03-04 11:35:35,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:34" (2/3) ... [2025-03-04 11:35:35,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@154c3332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:35:35, skipping insertion in model container [2025-03-04 11:35:35,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:35:35" (3/3) ... [2025-03-04 11:35:35,419 INFO L128 eAbstractionObserver]: Analyzing ICFG AllInterval-008.c [2025-03-04 11:35:35,429 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:35:35,430 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG AllInterval-008.c that has 2 procedures, 183 locations, 1 initial locations, 0 loop locations, and 28 error locations. [2025-03-04 11:35:35,473 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:35:35,484 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;@74f1e558, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:35:35,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-03-04 11:35:35,487 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 67 states have (on average 1.537313432835821) internal successors, (103), 95 states have internal predecessors, (103), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-04 11:35:35,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-03-04 11:35:35,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:35,507 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,508 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:35:35,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:35,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1649431114, now seen corresponding path program 1 times [2025-03-04 11:35:35,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:35,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930390953] [2025-03-04 11:35:35,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:35,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:35,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-04 11:35:35,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-04 11:35:35,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:35,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:35,893 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 12168 trivial. 0 not checked. [2025-03-04 11:35:35,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:35,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930390953] [2025-03-04 11:35:35,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930390953] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:35,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327019102] [2025-03-04 11:35:35,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:35,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:35,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:35,896 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:35,898 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:35,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-04 11:35:36,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-04 11:35:36,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:36,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:36,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 11:35:36,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:36,128 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 12168 trivial. 0 not checked. [2025-03-04 11:35:36,129 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:35:36,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327019102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:36,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:35:36,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 11:35:36,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283113801] [2025-03-04 11:35:36,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:36,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 11:35:36,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:36,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 11:35:36,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:35:36,156 INFO L87 Difference]: Start difference. First operand has 183 states, 67 states have (on average 1.537313432835821) internal successors, (103), 95 states have internal predecessors, (103), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (79), 2 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 2 states have call successors, (79) [2025-03-04 11:35:36,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:36,201 INFO L93 Difference]: Finished difference Result 359 states and 629 transitions. [2025-03-04 11:35:36,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 11:35:36,202 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (79), 2 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 2 states have call successors, (79) Word has length 414 [2025-03-04 11:35:36,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:36,208 INFO L225 Difference]: With dead ends: 359 [2025-03-04 11:35:36,208 INFO L226 Difference]: Without dead ends: 176 [2025-03-04 11:35:36,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 415 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:36,217 INFO L435 NwaCegarLoop]: 270 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, 270 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:36,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 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:36,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-04 11:35:36,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2025-03-04 11:35:36,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 62 states have (on average 1.532258064516129) internal successors, (95), 89 states have internal predecessors, (95), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-04 11:35:36,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 265 transitions. [2025-03-04 11:35:36,279 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 265 transitions. Word has length 414 [2025-03-04 11:35:36,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:36,281 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 265 transitions. [2025-03-04 11:35:36,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (79), 2 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 2 states have call successors, (79) [2025-03-04 11:35:36,281 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 265 transitions. [2025-03-04 11:35:36,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-03-04 11:35:36,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:36,286 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,293 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:36,486 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:36,486 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:35:36,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:36,487 INFO L85 PathProgramCache]: Analyzing trace with hash 2040316631, now seen corresponding path program 1 times [2025-03-04 11:35:36,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:36,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501910275] [2025-03-04 11:35:36,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:36,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:36,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-04 11:35:36,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-04 11:35:36,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:36,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:37,299 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 6 proven. 456 refuted. 0 times theorem prover too weak. 11862 trivial. 0 not checked. [2025-03-04 11:35:37,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:37,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501910275] [2025-03-04 11:35:37,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501910275] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:37,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759096479] [2025-03-04 11:35:37,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:37,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:37,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:37,304 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:37,305 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:37,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-03-04 11:35:37,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-03-04 11:35:37,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:37,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:37,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:35:37,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:38,004 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-03-04 11:35:38,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:38,492 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-03-04 11:35:38,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759096479] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:38,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:38,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 11:35:38,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062181559] [2025-03-04 11:35:38,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:38,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:35:38,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:38,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:35:38,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:35:38,497 INFO L87 Difference]: Start difference. First operand 176 states and 265 transitions. Second operand has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 6 states have call successors, (234), 1 states have call predecessors, (234), 2 states have return successors, (235), 5 states have call predecessors, (235), 6 states have call successors, (235) [2025-03-04 11:35:39,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:39,032 INFO L93 Difference]: Finished difference Result 176 states and 265 transitions. [2025-03-04 11:35:39,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:35:39,033 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 6 states have call successors, (234), 1 states have call predecessors, (234), 2 states have return successors, (235), 5 states have call predecessors, (235), 6 states have call successors, (235) Word has length 414 [2025-03-04 11:35:39,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:39,037 INFO L225 Difference]: With dead ends: 176 [2025-03-04 11:35:39,037 INFO L226 Difference]: Without dead ends: 175 [2025-03-04 11:35:39,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 834 GetRequests, 825 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:39,038 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 4 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:39,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 906 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:35:39,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-04 11:35:39,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-03-04 11:35:39,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 62 states have (on average 1.5161290322580645) internal successors, (94), 88 states have internal predecessors, (94), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-04 11:35:39,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 264 transitions. [2025-03-04 11:35:39,071 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 264 transitions. Word has length 414 [2025-03-04 11:35:39,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:39,072 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 264 transitions. [2025-03-04 11:35:39,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 6 states have call successors, (234), 1 states have call predecessors, (234), 2 states have return successors, (235), 5 states have call predecessors, (235), 6 states have call successors, (235) [2025-03-04 11:35:39,073 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 264 transitions. [2025-03-04 11:35:39,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2025-03-04 11:35:39,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:39,083 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 11:35:39,288 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:39,288 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:35:39,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:39,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1174693825, now seen corresponding path program 1 times [2025-03-04 11:35:39,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:39,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478923450] [2025-03-04 11:35:39,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:39,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:39,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-03-04 11:35:39,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-03-04 11:35:39,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:39,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:39,626 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 6 proven. 228 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-03-04 11:35:39,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:39,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478923450] [2025-03-04 11:35:39,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478923450] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:39,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708352860] [2025-03-04 11:35:39,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:39,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:39,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:39,629 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:39,630 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:39,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-03-04 11:35:39,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-03-04 11:35:39,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:39,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:39,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:35:39,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:40,044 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 6 proven. 228 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-03-04 11:35:40,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:40,423 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 6 proven. 228 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-03-04 11:35:40,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708352860] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:40,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:40,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 11:35:40,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536229279] [2025-03-04 11:35:40,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:40,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:35:40,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:40,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:35:40,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:40,427 INFO L87 Difference]: Start difference. First operand 175 states and 264 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (155), 1 states have call predecessors, (155), 2 states have return successors, (156), 3 states have call predecessors, (156), 3 states have call successors, (156) [2025-03-04 11:35:40,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:40,811 INFO L93 Difference]: Finished difference Result 175 states and 264 transitions. [2025-03-04 11:35:40,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:35:40,812 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (155), 1 states have call predecessors, (155), 2 states have return successors, (156), 3 states have call predecessors, (156), 3 states have call successors, (156) Word has length 415 [2025-03-04 11:35:40,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:40,814 INFO L225 Difference]: With dead ends: 175 [2025-03-04 11:35:40,814 INFO L226 Difference]: Without dead ends: 174 [2025-03-04 11:35:40,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 833 GetRequests, 826 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:40,814 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:40,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 752 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:35:40,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-04 11:35:40,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2025-03-04 11:35:40,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 62 states have (on average 1.5) internal successors, (93), 87 states have internal predecessors, (93), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-04 11:35:40,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 263 transitions. [2025-03-04 11:35:40,838 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 263 transitions. Word has length 415 [2025-03-04 11:35:40,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:40,840 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 263 transitions. [2025-03-04 11:35:40,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (155), 1 states have call predecessors, (155), 2 states have return successors, (156), 3 states have call predecessors, (156), 3 states have call successors, (156) [2025-03-04 11:35:40,841 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 263 transitions. [2025-03-04 11:35:40,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2025-03-04 11:35:40,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:40,843 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:41,046 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:41,046 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:35:41,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:41,047 INFO L85 PathProgramCache]: Analyzing trace with hash 695634717, now seen corresponding path program 1 times [2025-03-04 11:35:41,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:41,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58002513] [2025-03-04 11:35:41,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:41,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:41,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 417 statements into 1 equivalence classes. [2025-03-04 11:35:41,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 417 of 417 statements. [2025-03-04 11:35:41,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:41,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:41,158 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-04 11:35:41,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:41,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58002513] [2025-03-04 11:35:41,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58002513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:41,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:41,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:35:41,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211671016] [2025-03-04 11:35:41,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:41,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:35:41,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:41,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:35:41,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:41,160 INFO L87 Difference]: Start difference. First operand 174 states and 263 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-04 11:35:41,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:41,218 INFO L93 Difference]: Finished difference Result 174 states and 263 transitions. [2025-03-04 11:35:41,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:35:41,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 417 [2025-03-04 11:35:41,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:41,220 INFO L225 Difference]: With dead ends: 174 [2025-03-04 11:35:41,220 INFO L226 Difference]: Without dead ends: 167 [2025-03-04 11:35:41,220 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:41,221 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 7 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:41,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 444 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:41,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-04 11:35:41,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2025-03-04 11:35:41,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 80 states have internal predecessors, (86), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-04 11:35:41,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 256 transitions. [2025-03-04 11:35:41,234 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 256 transitions. Word has length 417 [2025-03-04 11:35:41,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:41,234 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 256 transitions. [2025-03-04 11:35:41,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-04 11:35:41,235 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 256 transitions. [2025-03-04 11:35:41,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2025-03-04 11:35:41,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:41,237 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:35:41,237 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:35:41,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:41,237 INFO L85 PathProgramCache]: Analyzing trace with hash 89839796, now seen corresponding path program 1 times [2025-03-04 11:35:41,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:41,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180250949] [2025-03-04 11:35:41,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:41,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:41,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 418 statements into 1 equivalence classes. [2025-03-04 11:35:41,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 418 of 418 statements. [2025-03-04 11:35:41,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:41,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:41,599 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 6 proven. 456 refuted. 0 times theorem prover too weak. 11862 trivial. 0 not checked. [2025-03-04 11:35:41,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:41,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180250949] [2025-03-04 11:35:41,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180250949] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:41,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138545271] [2025-03-04 11:35:41,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:41,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:41,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:41,603 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:41,605 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:41,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 418 statements into 1 equivalence classes. [2025-03-04 11:35:41,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 418 of 418 statements. [2025-03-04 11:35:41,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:41,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:41,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:35:41,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:41,998 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-03-04 11:35:41,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:42,336 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-03-04 11:35:42,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138545271] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:42,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:42,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-04 11:35:42,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637575160] [2025-03-04 11:35:42,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:42,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 11:35:42,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:42,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 11:35:42,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:35:42,339 INFO L87 Difference]: Start difference. First operand 167 states and 256 transitions. Second operand has 11 states, 10 states have (on average 7.0) internal successors, (70), 11 states have internal predecessors, (70), 5 states have call successors, (233), 1 states have call predecessors, (233), 2 states have return successors, (233), 4 states have call predecessors, (233), 5 states have call successors, (233) [2025-03-04 11:35:42,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:42,805 INFO L93 Difference]: Finished difference Result 167 states and 256 transitions. [2025-03-04 11:35:42,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:35:42,806 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.0) internal successors, (70), 11 states have internal predecessors, (70), 5 states have call successors, (233), 1 states have call predecessors, (233), 2 states have return successors, (233), 4 states have call predecessors, (233), 5 states have call successors, (233) Word has length 418 [2025-03-04 11:35:42,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:42,807 INFO L225 Difference]: With dead ends: 167 [2025-03-04 11:35:42,807 INFO L226 Difference]: Without dead ends: 166 [2025-03-04 11:35:42,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 843 GetRequests, 832 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:42,808 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:42,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 801 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:35:42,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-04 11:35:42,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2025-03-04 11:35:42,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 79 states have internal predecessors, (85), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-04 11:35:42,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 255 transitions. [2025-03-04 11:35:42,824 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 255 transitions. Word has length 418 [2025-03-04 11:35:42,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:42,825 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 255 transitions. [2025-03-04 11:35:42,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.0) internal successors, (70), 11 states have internal predecessors, (70), 5 states have call successors, (233), 1 states have call predecessors, (233), 2 states have return successors, (233), 4 states have call predecessors, (233), 5 states have call successors, (233) [2025-03-04 11:35:42,825 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 255 transitions. [2025-03-04 11:35:42,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2025-03-04 11:35:42,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:42,828 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,835 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:43,029 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:43,029 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:35:43,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:43,030 INFO L85 PathProgramCache]: Analyzing trace with hash 213256369, now seen corresponding path program 1 times [2025-03-04 11:35:43,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:43,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735881938] [2025-03-04 11:35:43,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:43,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:43,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-03-04 11:35:43,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-03-04 11:35:43,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:43,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:43,273 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 6 proven. 231 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-03-04 11:35:43,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:43,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735881938] [2025-03-04 11:35:43,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735881938] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:43,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828641019] [2025-03-04 11:35:43,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:43,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:43,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:43,276 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:43,278 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:43,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-03-04 11:35:43,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-03-04 11:35:43,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:43,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:43,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 11:35:43,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 285 proven. 627 refuted. 0 times theorem prover too weak. 11728 trivial. 0 not checked. [2025-03-04 11:35:43,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:44,314 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 285 proven. 627 refuted. 0 times theorem prover too weak. 11728 trivial. 0 not checked. [2025-03-04 11:35:44,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828641019] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:44,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:44,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 10] total 19 [2025-03-04 11:35:44,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848532016] [2025-03-04 11:35:44,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:44,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 11:35:44,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:44,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 11:35:44,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:35:44,318 INFO L87 Difference]: Start difference. First operand 166 states and 255 transitions. Second operand has 20 states, 18 states have (on average 4.055555555555555) internal successors, (73), 17 states have internal predecessors, (73), 11 states have call successors, (238), 1 states have call predecessors, (238), 2 states have return successors, (240), 11 states have call predecessors, (240), 11 states have call successors, (240) [2025-03-04 11:35:44,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:44,975 INFO L93 Difference]: Finished difference Result 170 states and 262 transitions. [2025-03-04 11:35:44,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:35:44,976 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 4.055555555555555) internal successors, (73), 17 states have internal predecessors, (73), 11 states have call successors, (238), 1 states have call predecessors, (238), 2 states have return successors, (240), 11 states have call predecessors, (240), 11 states have call successors, (240) Word has length 423 [2025-03-04 11:35:44,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:44,977 INFO L225 Difference]: With dead ends: 170 [2025-03-04 11:35:44,977 INFO L226 Difference]: Without dead ends: 169 [2025-03-04 11:35:44,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 856 GetRequests, 831 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:35:44,978 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 40 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:44,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 1509 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:35:44,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-04 11:35:44,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2025-03-04 11:35:44,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 78 states have internal predecessors, (84), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-04 11:35:44,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 254 transitions. [2025-03-04 11:35:44,997 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 254 transitions. Word has length 423 [2025-03-04 11:35:44,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:45,000 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 254 transitions. [2025-03-04 11:35:45,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 4.055555555555555) internal successors, (73), 17 states have internal predecessors, (73), 11 states have call successors, (238), 1 states have call predecessors, (238), 2 states have return successors, (240), 11 states have call predecessors, (240), 11 states have call successors, (240) [2025-03-04 11:35:45,001 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 254 transitions. [2025-03-04 11:35:45,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2025-03-04 11:35:45,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:45,005 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,012 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:45,210 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:45,210 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:35:45,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:45,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1978987111, now seen corresponding path program 1 times [2025-03-04 11:35:45,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:45,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439074397] [2025-03-04 11:35:45,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:45,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:45,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-03-04 11:35:45,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-03-04 11:35:45,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:45,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:45,478 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 12 proven. 225 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-03-04 11:35:45,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:45,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439074397] [2025-03-04 11:35:45,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439074397] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:45,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882277496] [2025-03-04 11:35:45,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:45,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:45,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:45,481 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:45,483 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:45,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-03-04 11:35:45,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-03-04 11:35:45,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:45,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:45,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:35:45,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:45,836 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 12 proven. 225 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-03-04 11:35:45,836 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:46,162 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 12 proven. 225 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-03-04 11:35:46,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882277496] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:46,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:46,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2025-03-04 11:35:46,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44376847] [2025-03-04 11:35:46,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:46,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 11:35:46,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:46,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 11:35:46,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:35:46,166 INFO L87 Difference]: Start difference. First operand 165 states and 254 transitions. Second operand has 13 states, 11 states have (on average 6.818181818181818) internal successors, (75), 13 states have internal predecessors, (75), 8 states have call successors, (235), 1 states have call predecessors, (235), 2 states have return successors, (236), 7 states have call predecessors, (236), 8 states have call successors, (236) [2025-03-04 11:35:46,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:46,566 INFO L93 Difference]: Finished difference Result 165 states and 254 transitions. [2025-03-04 11:35:46,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:35:46,567 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.818181818181818) internal successors, (75), 13 states have internal predecessors, (75), 8 states have call successors, (235), 1 states have call predecessors, (235), 2 states have return successors, (236), 7 states have call predecessors, (236), 8 states have call successors, (236) Word has length 424 [2025-03-04 11:35:46,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:46,569 INFO L225 Difference]: With dead ends: 165 [2025-03-04 11:35:46,569 INFO L226 Difference]: Without dead ends: 164 [2025-03-04 11:35:46,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 857 GetRequests, 842 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:46,569 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 27 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:46,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1179 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:35:46,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-04 11:35:46,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-03-04 11:35:46,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 77 states have internal predecessors, (83), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-04 11:35:46,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 253 transitions. [2025-03-04 11:35:46,581 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 253 transitions. Word has length 424 [2025-03-04 11:35:46,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:46,582 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 253 transitions. [2025-03-04 11:35:46,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.818181818181818) internal successors, (75), 13 states have internal predecessors, (75), 8 states have call successors, (235), 1 states have call predecessors, (235), 2 states have return successors, (236), 7 states have call predecessors, (236), 8 states have call successors, (236) [2025-03-04 11:35:46,582 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 253 transitions. [2025-03-04 11:35:46,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2025-03-04 11:35:46,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:46,584 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 11:35:46,785 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:46,785 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:35:46,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:46,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1011089038, now seen corresponding path program 1 times [2025-03-04 11:35:46,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:46,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365310156] [2025-03-04 11:35:46,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:46,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:46,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-03-04 11:35:46,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-03-04 11:35:46,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:46,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:47,017 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 6 proven. 231 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-03-04 11:35:47,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:47,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365310156] [2025-03-04 11:35:47,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365310156] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:47,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587616401] [2025-03-04 11:35:47,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:47,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:47,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:47,020 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:47,021 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:47,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-03-04 11:35:47,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-03-04 11:35:47,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:47,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:47,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 11:35:47,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:47,535 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 285 proven. 627 refuted. 0 times theorem prover too weak. 11728 trivial. 0 not checked. [2025-03-04 11:35:47,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:47,957 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 285 proven. 627 refuted. 0 times theorem prover too weak. 11728 trivial. 0 not checked. [2025-03-04 11:35:47,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587616401] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:47,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:47,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 20 [2025-03-04 11:35:47,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619429960] [2025-03-04 11:35:47,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:47,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 11:35:47,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:47,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 11:35:47,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-03-04 11:35:47,960 INFO L87 Difference]: Start difference. First operand 164 states and 253 transitions. Second operand has 21 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 20 states have internal predecessors, (80), 11 states have call successors, (238), 1 states have call predecessors, (238), 2 states have return successors, (240), 10 states have call predecessors, (240), 11 states have call successors, (240) [2025-03-04 11:35:48,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:48,590 INFO L93 Difference]: Finished difference Result 168 states and 258 transitions. [2025-03-04 11:35:48,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 11:35:48,591 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 20 states have internal predecessors, (80), 11 states have call successors, (238), 1 states have call predecessors, (238), 2 states have return successors, (240), 10 states have call predecessors, (240), 11 states have call successors, (240) Word has length 427 [2025-03-04 11:35:48,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:48,593 INFO L225 Difference]: With dead ends: 168 [2025-03-04 11:35:48,593 INFO L226 Difference]: Without dead ends: 167 [2025-03-04 11:35:48,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 865 GetRequests, 838 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:48,594 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 57 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:48,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1478 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:35:48,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-04 11:35:48,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 163. [2025-03-04 11:35:48,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 76 states have internal predecessors, (82), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-04 11:35:48,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 252 transitions. [2025-03-04 11:35:48,605 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 252 transitions. Word has length 427 [2025-03-04 11:35:48,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:48,605 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 252 transitions. [2025-03-04 11:35:48,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 20 states have internal predecessors, (80), 11 states have call successors, (238), 1 states have call predecessors, (238), 2 states have return successors, (240), 10 states have call predecessors, (240), 11 states have call successors, (240) [2025-03-04 11:35:48,609 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 252 transitions. [2025-03-04 11:35:48,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-03-04 11:35:48,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:48,611 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,619 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:48,811 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:48,812 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:35:48,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:48,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1741484291, now seen corresponding path program 1 times [2025-03-04 11:35:48,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:48,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772093806] [2025-03-04 11:35:48,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:48,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:48,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-03-04 11:35:48,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-03-04 11:35:48,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:48,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:49,036 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 12 proven. 228 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-04 11:35:49,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:49,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772093806] [2025-03-04 11:35:49,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772093806] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:49,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839567596] [2025-03-04 11:35:49,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:49,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:49,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:49,039 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:49,043 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:49,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-03-04 11:35:49,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-03-04 11:35:49,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:49,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:49,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:35:49,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:49,370 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 12 proven. 228 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-04 11:35:49,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:49,678 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 12 proven. 228 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-04 11:35:49,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839567596] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:49,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:49,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 11:35:49,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204299742] [2025-03-04 11:35:49,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:49,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:35:49,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:49,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:35:49,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:35:49,680 INFO L87 Difference]: Start difference. First operand 163 states and 252 transitions. Second operand has 10 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 6 states have call successors, (232), 1 states have call predecessors, (232), 2 states have return successors, (233), 6 states have call predecessors, (233), 6 states have call successors, (233) [2025-03-04 11:35:49,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:49,952 INFO L93 Difference]: Finished difference Result 163 states and 252 transitions. [2025-03-04 11:35:49,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:35:49,952 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 6 states have call successors, (232), 1 states have call predecessors, (232), 2 states have return successors, (233), 6 states have call predecessors, (233), 6 states have call successors, (233) Word has length 432 [2025-03-04 11:35:49,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:49,954 INFO L225 Difference]: With dead ends: 163 [2025-03-04 11:35:49,955 INFO L226 Difference]: Without dead ends: 162 [2025-03-04 11:35:49,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 867 GetRequests, 859 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:49,956 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 21 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:49,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 699 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:35:49,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-04 11:35:49,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-03-04 11:35:49,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 75 states have internal predecessors, (81), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-04 11:35:49,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 251 transitions. [2025-03-04 11:35:49,972 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 251 transitions. Word has length 432 [2025-03-04 11:35:49,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:49,974 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 251 transitions. [2025-03-04 11:35:49,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 6 states have call successors, (232), 1 states have call predecessors, (232), 2 states have return successors, (233), 6 states have call predecessors, (233), 6 states have call successors, (233) [2025-03-04 11:35:49,974 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 251 transitions. [2025-03-04 11:35:49,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-03-04 11:35:49,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:49,976 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,983 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:50,176 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:50,177 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:35:50,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:50,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1848561797, now seen corresponding path program 1 times [2025-03-04 11:35:50,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:50,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034327295] [2025-03-04 11:35:50,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:50,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:50,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-04 11:35:50,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-04 11:35:50,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:50,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:50,327 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 18 proven. 222 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-04 11:35:50,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:50,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034327295] [2025-03-04 11:35:50,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034327295] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:50,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655448914] [2025-03-04 11:35:50,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:50,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:50,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:50,330 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:50,331 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:50,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-04 11:35:50,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-04 11:35:50,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:50,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:50,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:35:50,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:50,680 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 18 proven. 222 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-04 11:35:50,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:51,027 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 18 proven. 222 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-04 11:35:51,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655448914] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:51,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:51,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 11:35:51,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608412390] [2025-03-04 11:35:51,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:51,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:35:51,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:51,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:35:51,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:51,031 INFO L87 Difference]: Start difference. First operand 162 states and 251 transitions. Second operand has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 4 states have call successors, (155), 1 states have call predecessors, (155), 2 states have return successors, (156), 4 states have call predecessors, (156), 4 states have call successors, (156) [2025-03-04 11:35:51,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:51,393 INFO L93 Difference]: Finished difference Result 162 states and 251 transitions. [2025-03-04 11:35:51,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:35:51,394 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 4 states have call successors, (155), 1 states have call predecessors, (155), 2 states have return successors, (156), 4 states have call predecessors, (156), 4 states have call successors, (156) Word has length 433 [2025-03-04 11:35:51,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:51,396 INFO L225 Difference]: With dead ends: 162 [2025-03-04 11:35:51,396 INFO L226 Difference]: Without dead ends: 161 [2025-03-04 11:35:51,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 869 GetRequests, 862 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:51,397 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 18 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:51,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 640 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:35:51,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-04 11:35:51,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2025-03-04 11:35:51,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 74 states have internal predecessors, (80), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-04 11:35:51,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 250 transitions. [2025-03-04 11:35:51,411 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 250 transitions. Word has length 433 [2025-03-04 11:35:51,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:51,412 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 250 transitions. [2025-03-04 11:35:51,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 4 states have call successors, (155), 1 states have call predecessors, (155), 2 states have return successors, (156), 4 states have call predecessors, (156), 4 states have call successors, (156) [2025-03-04 11:35:51,412 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 250 transitions. [2025-03-04 11:35:51,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-03-04 11:35:51,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:51,414 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:51,614 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:51,614 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:35:51,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:51,615 INFO L85 PathProgramCache]: Analyzing trace with hash -433796384, now seen corresponding path program 1 times [2025-03-04 11:35:51,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:51,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764275950] [2025-03-04 11:35:51,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:51,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:51,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-04 11:35:51,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-04 11:35:51,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:51,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:51,864 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 30 proven. 444 refuted. 0 times theorem prover too weak. 12486 trivial. 0 not checked. [2025-03-04 11:35:51,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:51,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764275950] [2025-03-04 11:35:51,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764275950] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:51,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212127311] [2025-03-04 11:35:51,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:51,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:51,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:51,866 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:51,868 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:51,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-04 11:35:51,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-04 11:35:51,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:51,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:51,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:35:51,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:52,213 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 12 proven. 228 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-04 11:35:52,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:52,516 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 12 proven. 228 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-04 11:35:52,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212127311] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:52,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:52,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-04 11:35:52,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528662292] [2025-03-04 11:35:52,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:52,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 11:35:52,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:52,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 11:35:52,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:35:52,520 INFO L87 Difference]: Start difference. First operand 161 states and 250 transitions. Second operand has 11 states, 10 states have (on average 9.0) internal successors, (90), 11 states have internal predecessors, (90), 5 states have call successors, (231), 1 states have call predecessors, (231), 2 states have return successors, (231), 5 states have call predecessors, (231), 5 states have call successors, (231) [2025-03-04 11:35:52,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:52,820 INFO L93 Difference]: Finished difference Result 161 states and 250 transitions. [2025-03-04 11:35:52,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:35:52,821 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.0) internal successors, (90), 11 states have internal predecessors, (90), 5 states have call successors, (231), 1 states have call predecessors, (231), 2 states have return successors, (231), 5 states have call predecessors, (231), 5 states have call successors, (231) Word has length 436 [2025-03-04 11:35:52,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:52,823 INFO L225 Difference]: With dead ends: 161 [2025-03-04 11:35:52,823 INFO L226 Difference]: Without dead ends: 160 [2025-03-04 11:35:52,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 879 GetRequests, 868 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:52,823 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 18 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:52,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 658 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:35:52,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-04 11:35:52,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-03-04 11:35:52,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 73 states have internal predecessors, (79), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-04 11:35:52,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 249 transitions. [2025-03-04 11:35:52,836 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 249 transitions. Word has length 436 [2025-03-04 11:35:52,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:52,836 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 249 transitions. [2025-03-04 11:35:52,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.0) internal successors, (90), 11 states have internal predecessors, (90), 5 states have call successors, (231), 1 states have call predecessors, (231), 2 states have return successors, (231), 5 states have call predecessors, (231), 5 states have call successors, (231) [2025-03-04 11:35:52,837 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 249 transitions. [2025-03-04 11:35:52,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-03-04 11:35:52,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:52,839 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 11:35:53,039 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:53,040 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:35:53,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:53,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1551270435, now seen corresponding path program 1 times [2025-03-04 11:35:53,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:53,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68272520] [2025-03-04 11:35:53,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:53,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:53,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-03-04 11:35:53,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-03-04 11:35:53,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:53,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:53,219 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 18 proven. 225 refuted. 0 times theorem prover too weak. 13041 trivial. 0 not checked. [2025-03-04 11:35:53,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:53,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68272520] [2025-03-04 11:35:53,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68272520] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:53,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853030397] [2025-03-04 11:35:53,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:53,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:53,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:53,222 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:53,224 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:53,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-03-04 11:35:53,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-03-04 11:35:53,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:53,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:53,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 11:35:53,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:53,692 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 327 proven. 609 refuted. 0 times theorem prover too weak. 12348 trivial. 0 not checked. [2025-03-04 11:35:53,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:54,048 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 327 proven. 609 refuted. 0 times theorem prover too weak. 12348 trivial. 0 not checked. [2025-03-04 11:35:54,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853030397] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:54,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:54,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 10] total 19 [2025-03-04 11:35:54,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671319522] [2025-03-04 11:35:54,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:54,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 11:35:54,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:54,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 11:35:54,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:35:54,050 INFO L87 Difference]: Start difference. First operand 160 states and 249 transitions. Second operand has 20 states, 18 states have (on average 5.166666666666667) internal successors, (93), 17 states have internal predecessors, (93), 11 states have call successors, (236), 1 states have call predecessors, (236), 2 states have return successors, (238), 11 states have call predecessors, (238), 11 states have call successors, (238) [2025-03-04 11:35:54,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:54,620 INFO L93 Difference]: Finished difference Result 164 states and 256 transitions. [2025-03-04 11:35:54,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:35:54,621 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 5.166666666666667) internal successors, (93), 17 states have internal predecessors, (93), 11 states have call successors, (236), 1 states have call predecessors, (236), 2 states have return successors, (238), 11 states have call predecessors, (238), 11 states have call successors, (238) Word has length 441 [2025-03-04 11:35:54,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:54,623 INFO L225 Difference]: With dead ends: 164 [2025-03-04 11:35:54,623 INFO L226 Difference]: Without dead ends: 163 [2025-03-04 11:35:54,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 892 GetRequests, 867 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2025-03-04 11:35:54,624 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 92 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:54,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 1444 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:35:54,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-04 11:35:54,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2025-03-04 11:35:54,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 72 states have internal predecessors, (78), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-04 11:35:54,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 248 transitions. [2025-03-04 11:35:54,638 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 248 transitions. Word has length 441 [2025-03-04 11:35:54,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:54,638 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 248 transitions. [2025-03-04 11:35:54,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 5.166666666666667) internal successors, (93), 17 states have internal predecessors, (93), 11 states have call successors, (236), 1 states have call predecessors, (236), 2 states have return successors, (238), 11 states have call predecessors, (238), 11 states have call successors, (238) [2025-03-04 11:35:54,639 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 248 transitions. [2025-03-04 11:35:54,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-03-04 11:35:54,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:54,641 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 11:35:54,846 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:54,846 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:35:54,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:54,847 INFO L85 PathProgramCache]: Analyzing trace with hash -844743211, now seen corresponding path program 1 times [2025-03-04 11:35:54,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:54,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384765111] [2025-03-04 11:35:54,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:54,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:54,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-03-04 11:35:54,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-03-04 11:35:54,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:54,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:55,022 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 24 proven. 219 refuted. 0 times theorem prover too weak. 13041 trivial. 0 not checked. [2025-03-04 11:35:55,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:55,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384765111] [2025-03-04 11:35:55,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384765111] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:55,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948197620] [2025-03-04 11:35:55,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:55,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:55,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:55,025 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:55,026 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:55,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-03-04 11:35:55,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-03-04 11:35:55,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:55,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:55,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:35:55,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:55,335 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 24 proven. 219 refuted. 0 times theorem prover too weak. 13041 trivial. 0 not checked. [2025-03-04 11:35:55,335 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:55,632 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 24 proven. 219 refuted. 0 times theorem prover too weak. 13041 trivial. 0 not checked. [2025-03-04 11:35:55,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948197620] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:55,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:55,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2025-03-04 11:35:55,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197460015] [2025-03-04 11:35:55,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:55,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 11:35:55,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:55,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 11:35:55,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:35:55,635 INFO L87 Difference]: Start difference. First operand 159 states and 248 transitions. Second operand has 11 states, 10 states have (on average 9.2) internal successors, (92), 11 states have internal predecessors, (92), 6 states have call successors, (232), 1 states have call predecessors, (232), 2 states have return successors, (233), 6 states have call predecessors, (233), 6 states have call successors, (233) [2025-03-04 11:35:55,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:55,970 INFO L93 Difference]: Finished difference Result 159 states and 248 transitions. [2025-03-04 11:35:55,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:35:55,971 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 9.2) internal successors, (92), 11 states have internal predecessors, (92), 6 states have call successors, (232), 1 states have call predecessors, (232), 2 states have return successors, (233), 6 states have call predecessors, (233), 6 states have call successors, (233) Word has length 442 [2025-03-04 11:35:55,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:55,972 INFO L225 Difference]: With dead ends: 159 [2025-03-04 11:35:55,972 INFO L226 Difference]: Without dead ends: 158 [2025-03-04 11:35:55,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 893 GetRequests, 879 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:55,973 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 55 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:55,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 801 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:35:55,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-04 11:35:55,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-03-04 11:35:55,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 71 states have internal predecessors, (77), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-04 11:35:55,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 247 transitions. [2025-03-04 11:35:55,988 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 247 transitions. Word has length 442 [2025-03-04 11:35:55,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:55,988 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 247 transitions. [2025-03-04 11:35:55,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 9.2) internal successors, (92), 11 states have internal predecessors, (92), 6 states have call successors, (232), 1 states have call predecessors, (232), 2 states have return successors, (233), 6 states have call predecessors, (233), 6 states have call successors, (233) [2025-03-04 11:35:55,990 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 247 transitions. [2025-03-04 11:35:55,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-03-04 11:35:55,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:55,991 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:56,192 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:56,192 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:35:56,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:56,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1531594822, now seen corresponding path program 1 times [2025-03-04 11:35:56,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:56,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971139657] [2025-03-04 11:35:56,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:56,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:56,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-03-04 11:35:56,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-03-04 11:35:56,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:56,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:56,407 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 42 proven. 438 refuted. 0 times theorem prover too weak. 12804 trivial. 0 not checked. [2025-03-04 11:35:56,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:56,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971139657] [2025-03-04 11:35:56,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971139657] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:56,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907206652] [2025-03-04 11:35:56,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:56,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:56,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:56,410 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:56,412 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:56,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-03-04 11:35:56,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-03-04 11:35:56,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:56,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:56,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 11:35:56,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:56,906 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 327 proven. 609 refuted. 0 times theorem prover too weak. 12348 trivial. 0 not checked. [2025-03-04 11:35:56,906 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:57,366 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 327 proven. 609 refuted. 0 times theorem prover too weak. 12348 trivial. 0 not checked. [2025-03-04 11:35:57,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907206652] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:57,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:57,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 22 [2025-03-04 11:35:57,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021685383] [2025-03-04 11:35:57,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:57,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 11:35:57,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:57,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 11:35:57,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2025-03-04 11:35:57,369 INFO L87 Difference]: Start difference. First operand 158 states and 247 transitions. Second operand has 23 states, 21 states have (on average 5.0) internal successors, (105), 23 states have internal predecessors, (105), 11 states have call successors, (236), 1 states have call predecessors, (236), 2 states have return successors, (238), 11 states have call predecessors, (238), 11 states have call successors, (238) [2025-03-04 11:35:58,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:58,085 INFO L93 Difference]: Finished difference Result 162 states and 252 transitions. [2025-03-04 11:35:58,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 11:35:58,085 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 5.0) internal successors, (105), 23 states have internal predecessors, (105), 11 states have call successors, (236), 1 states have call predecessors, (236), 2 states have return successors, (238), 11 states have call predecessors, (238), 11 states have call successors, (238) Word has length 445 [2025-03-04 11:35:58,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:58,087 INFO L225 Difference]: With dead ends: 162 [2025-03-04 11:35:58,087 INFO L226 Difference]: Without dead ends: 161 [2025-03-04 11:35:58,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 903 GetRequests, 875 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2025-03-04 11:35:58,087 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 88 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1853 SdHoareTripleChecker+Invalid, 1461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:58,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 1853 Invalid, 1461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 11:35:58,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-04 11:35:58,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2025-03-04 11:35:58,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 70 states have internal predecessors, (76), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-04 11:35:58,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 246 transitions. [2025-03-04 11:35:58,101 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 246 transitions. Word has length 445 [2025-03-04 11:35:58,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:58,101 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 246 transitions. [2025-03-04 11:35:58,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 5.0) internal successors, (105), 23 states have internal predecessors, (105), 11 states have call successors, (236), 1 states have call predecessors, (236), 2 states have return successors, (238), 11 states have call predecessors, (238), 11 states have call successors, (238) [2025-03-04 11:35:58,101 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 246 transitions. [2025-03-04 11:35:58,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2025-03-04 11:35:58,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:58,103 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,110 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:35:58,304 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:35:58,304 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:35:58,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:58,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1145241809, now seen corresponding path program 1 times [2025-03-04 11:35:58,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:58,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851405934] [2025-03-04 11:35:58,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:58,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:58,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-03-04 11:35:58,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-03-04 11:35:58,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:58,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:58,452 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 24 proven. 222 refuted. 0 times theorem prover too weak. 13366 trivial. 0 not checked. [2025-03-04 11:35:58,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:58,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851405934] [2025-03-04 11:35:58,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851405934] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:58,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787710849] [2025-03-04 11:35:58,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:58,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:58,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:58,456 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:35:58,457 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:35:58,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-03-04 11:35:58,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-03-04 11:35:58,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:58,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:58,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 840 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 11:35:58,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:58,956 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 348 proven. 600 refuted. 0 times theorem prover too weak. 12664 trivial. 0 not checked. [2025-03-04 11:35:58,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:59,334 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 348 proven. 600 refuted. 0 times theorem prover too weak. 12664 trivial. 0 not checked. [2025-03-04 11:35:59,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787710849] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:59,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:59,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 10] total 19 [2025-03-04 11:35:59,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087902061] [2025-03-04 11:35:59,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:59,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 11:35:59,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:59,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 11:35:59,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:35:59,336 INFO L87 Difference]: Start difference. First operand 157 states and 246 transitions. Second operand has 20 states, 18 states have (on average 5.722222222222222) internal successors, (103), 17 states have internal predecessors, (103), 11 states have call successors, (235), 1 states have call predecessors, (235), 2 states have return successors, (237), 11 states have call predecessors, (237), 11 states have call successors, (237) [2025-03-04 11:35:59,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:59,893 INFO L93 Difference]: Finished difference Result 161 states and 253 transitions. [2025-03-04 11:35:59,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:35:59,894 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 5.722222222222222) internal successors, (103), 17 states have internal predecessors, (103), 11 states have call successors, (235), 1 states have call predecessors, (235), 2 states have return successors, (237), 11 states have call predecessors, (237), 11 states have call successors, (237) Word has length 450 [2025-03-04 11:35:59,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:59,895 INFO L225 Difference]: With dead ends: 161 [2025-03-04 11:35:59,895 INFO L226 Difference]: Without dead ends: 160 [2025-03-04 11:35:59,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 910 GetRequests, 885 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:35:59,897 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 78 mSDsluCounter, 1215 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:59,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1362 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:35:59,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-04 11:35:59,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2025-03-04 11:35:59,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 69 states have internal predecessors, (75), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-04 11:35:59,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 245 transitions. [2025-03-04 11:35:59,913 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 245 transitions. Word has length 450 [2025-03-04 11:35:59,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:59,914 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 245 transitions. [2025-03-04 11:35:59,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 5.722222222222222) internal successors, (103), 17 states have internal predecessors, (103), 11 states have call successors, (235), 1 states have call predecessors, (235), 2 states have return successors, (237), 11 states have call predecessors, (237), 11 states have call successors, (237) [2025-03-04 11:35:59,914 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 245 transitions. [2025-03-04 11:35:59,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2025-03-04 11:35:59,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:59,917 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 11:36:00,117 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:00,117 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:36:00,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:00,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1142757705, now seen corresponding path program 1 times [2025-03-04 11:36:00,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:00,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521227170] [2025-03-04 11:36:00,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:00,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:00,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 451 statements into 1 equivalence classes. [2025-03-04 11:36:00,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 451 of 451 statements. [2025-03-04 11:36:00,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:00,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:00,324 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 30 proven. 216 refuted. 0 times theorem prover too weak. 13366 trivial. 0 not checked. [2025-03-04 11:36:00,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:00,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521227170] [2025-03-04 11:36:00,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521227170] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:00,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964847951] [2025-03-04 11:36:00,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:00,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:00,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:00,327 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:00,328 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:00,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 451 statements into 1 equivalence classes. [2025-03-04 11:36:00,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 451 of 451 statements. [2025-03-04 11:36:00,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:00,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:00,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 93 conjuncts are in the unsatisfiable core [2025-03-04 11:36:00,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:03,608 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 2064 proven. 996 refuted. 0 times theorem prover too weak. 10552 trivial. 0 not checked. [2025-03-04 11:36:03,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:12,049 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 2064 proven. 996 refuted. 0 times theorem prover too weak. 10552 trivial. 0 not checked. [2025-03-04 11:36:12,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964847951] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:12,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:12,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 28, 31] total 62 [2025-03-04 11:36:12,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361166376] [2025-03-04 11:36:12,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:12,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-04 11:36:12,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:12,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-04 11:36:12,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=3539, Unknown=0, NotChecked=0, Total=3906 [2025-03-04 11:36:12,052 INFO L87 Difference]: Start difference. First operand 156 states and 245 transitions. Second operand has 63 states, 45 states have (on average 2.4444444444444446) internal successors, (110), 51 states have internal predecessors, (110), 37 states have call successors, (245), 1 states have call predecessors, (245), 2 states have return successors, (247), 36 states have call predecessors, (247), 37 states have call successors, (247) [2025-03-04 11:36:16,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:16,514 INFO L93 Difference]: Finished difference Result 193 states and 293 transitions. [2025-03-04 11:36:16,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-04 11:36:16,515 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 45 states have (on average 2.4444444444444446) internal successors, (110), 51 states have internal predecessors, (110), 37 states have call successors, (245), 1 states have call predecessors, (245), 2 states have return successors, (247), 36 states have call predecessors, (247), 37 states have call successors, (247) Word has length 451 [2025-03-04 11:36:16,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:16,517 INFO L225 Difference]: With dead ends: 193 [2025-03-04 11:36:16,517 INFO L226 Difference]: Without dead ends: 192 [2025-03-04 11:36:16,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 949 GetRequests, 848 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2255 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1122, Invalid=9384, Unknown=0, NotChecked=0, Total=10506 [2025-03-04 11:36:16,520 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 99 mSDsluCounter, 3556 mSDsCounter, 0 mSdLazyCounter, 4537 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 3686 SdHoareTripleChecker+Invalid, 4695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 4537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:16,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 3686 Invalid, 4695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 4537 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-04 11:36:16,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-04 11:36:16,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 165. [2025-03-04 11:36:16,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 76 states have internal predecessors, (83), 87 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-04 11:36:16,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 257 transitions. [2025-03-04 11:36:16,540 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 257 transitions. Word has length 451 [2025-03-04 11:36:16,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:16,540 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 257 transitions. [2025-03-04 11:36:16,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 45 states have (on average 2.4444444444444446) internal successors, (110), 51 states have internal predecessors, (110), 37 states have call successors, (245), 1 states have call predecessors, (245), 2 states have return successors, (247), 36 states have call predecessors, (247), 37 states have call successors, (247) [2025-03-04 11:36:16,541 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 257 transitions. [2025-03-04 11:36:16,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-03-04 11:36:16,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:16,543 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,550 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:16,743 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:16,743 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:36:16,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:16,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1622438246, now seen corresponding path program 1 times [2025-03-04 11:36:16,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:16,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925048409] [2025-03-04 11:36:16,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:16,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:16,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-04 11:36:16,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-04 11:36:16,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:16,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:16,883 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 30 proven. 216 refuted. 0 times theorem prover too weak. 13366 trivial. 0 not checked. [2025-03-04 11:36:16,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:16,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925048409] [2025-03-04 11:36:16,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925048409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:16,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11962000] [2025-03-04 11:36:16,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:16,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:16,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:16,887 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:16,888 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:16,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-03-04 11:36:16,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-03-04 11:36:16,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:16,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:16,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:36:16,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:17,211 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 30 proven. 216 refuted. 0 times theorem prover too weak. 13366 trivial. 0 not checked. [2025-03-04 11:36:17,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:17,459 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 30 proven. 216 refuted. 0 times theorem prover too weak. 13366 trivial. 0 not checked. [2025-03-04 11:36:17,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11962000] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:17,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:17,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 11:36:17,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930079608] [2025-03-04 11:36:17,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:17,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:36:17,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:17,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:36:17,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:36:17,461 INFO L87 Difference]: Start difference. First operand 165 states and 257 transitions. Second operand has 8 states, 7 states have (on average 11.0) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (155), 1 states have call predecessors, (155), 2 states have return successors, (156), 4 states have call predecessors, (156), 4 states have call successors, (156) [2025-03-04 11:36:17,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:17,652 INFO L93 Difference]: Finished difference Result 165 states and 257 transitions. [2025-03-04 11:36:17,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:36:17,653 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.0) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (155), 1 states have call predecessors, (155), 2 states have return successors, (156), 4 states have call predecessors, (156), 4 states have call successors, (156) Word has length 453 [2025-03-04 11:36:17,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:17,655 INFO L225 Difference]: With dead ends: 165 [2025-03-04 11:36:17,655 INFO L226 Difference]: Without dead ends: 164 [2025-03-04 11:36:17,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 909 GetRequests, 902 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:36:17,655 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 30 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:17,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 446 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:36:17,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-04 11:36:17,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 155. [2025-03-04 11:36:17,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 68 states have internal predecessors, (74), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-04 11:36:17,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 244 transitions. [2025-03-04 11:36:17,675 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 244 transitions. Word has length 453 [2025-03-04 11:36:17,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:17,675 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 244 transitions. [2025-03-04 11:36:17,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.0) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (155), 1 states have call predecessors, (155), 2 states have return successors, (156), 4 states have call predecessors, (156), 4 states have call successors, (156) [2025-03-04 11:36:17,676 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 244 transitions. [2025-03-04 11:36:17,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-03-04 11:36:17,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:17,678 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,690 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:17,878 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:17,878 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:36:17,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:17,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1983996660, now seen corresponding path program 1 times [2025-03-04 11:36:17,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:17,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045328846] [2025-03-04 11:36:17,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:17,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:17,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-04 11:36:17,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-04 11:36:17,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:17,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:18,084 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 54 proven. 432 refuted. 0 times theorem prover too weak. 13126 trivial. 0 not checked. [2025-03-04 11:36:18,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:18,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045328846] [2025-03-04 11:36:18,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045328846] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:18,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323871907] [2025-03-04 11:36:18,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:18,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:18,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:18,087 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:18,088 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:18,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-04 11:36:18,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-04 11:36:18,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:18,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:18,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 11:36:18,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:18,689 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 348 proven. 600 refuted. 0 times theorem prover too weak. 12664 trivial. 0 not checked. [2025-03-04 11:36:18,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:19,059 INFO L134 CoverageAnalysis]: Checked inductivity of 13612 backedges. 348 proven. 600 refuted. 0 times theorem prover too weak. 12664 trivial. 0 not checked. [2025-03-04 11:36:19,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323871907] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:19,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:19,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 22 [2025-03-04 11:36:19,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222136191] [2025-03-04 11:36:19,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:19,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 11:36:19,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:19,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 11:36:19,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2025-03-04 11:36:19,062 INFO L87 Difference]: Start difference. First operand 155 states and 244 transitions. Second operand has 23 states, 21 states have (on average 5.476190476190476) internal successors, (115), 23 states have internal predecessors, (115), 11 states have call successors, (235), 1 states have call predecessors, (235), 2 states have return successors, (237), 11 states have call predecessors, (237), 11 states have call successors, (237) [2025-03-04 11:36:19,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:19,722 INFO L93 Difference]: Finished difference Result 159 states and 249 transitions. [2025-03-04 11:36:19,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 11:36:19,723 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 5.476190476190476) internal successors, (115), 23 states have internal predecessors, (115), 11 states have call successors, (235), 1 states have call predecessors, (235), 2 states have return successors, (237), 11 states have call predecessors, (237), 11 states have call successors, (237) Word has length 454 [2025-03-04 11:36:19,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:19,725 INFO L225 Difference]: With dead ends: 159 [2025-03-04 11:36:19,725 INFO L226 Difference]: Without dead ends: 158 [2025-03-04 11:36:19,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 921 GetRequests, 893 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2025-03-04 11:36:19,726 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 114 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 1582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:19,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1768 Invalid, 1582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 1433 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:36:19,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-04 11:36:19,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 154. [2025-03-04 11:36:19,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 67 states have internal predecessors, (73), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-04 11:36:19,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 243 transitions. [2025-03-04 11:36:19,754 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 243 transitions. Word has length 454 [2025-03-04 11:36:19,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:19,754 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 243 transitions. [2025-03-04 11:36:19,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 5.476190476190476) internal successors, (115), 23 states have internal predecessors, (115), 11 states have call successors, (235), 1 states have call predecessors, (235), 2 states have return successors, (237), 11 states have call predecessors, (237), 11 states have call successors, (237) [2025-03-04 11:36:19,755 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 243 transitions. [2025-03-04 11:36:19,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-04 11:36:19,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:19,757 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 11:36:19,957 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:19,958 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:36:19,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:19,958 INFO L85 PathProgramCache]: Analyzing trace with hash 511251209, now seen corresponding path program 1 times [2025-03-04 11:36:19,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:19,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936571582] [2025-03-04 11:36:19,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:19,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:19,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-04 11:36:19,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-04 11:36:19,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:19,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:20,190 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 30 proven. 219 refuted. 0 times theorem prover too weak. 13695 trivial. 0 not checked. [2025-03-04 11:36:20,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:20,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936571582] [2025-03-04 11:36:20,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936571582] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:20,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870514626] [2025-03-04 11:36:20,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:20,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:20,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:20,192 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:20,195 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:20,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-04 11:36:20,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-04 11:36:20,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:20,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:20,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 11:36:20,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:20,627 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 369 proven. 591 refuted. 0 times theorem prover too weak. 12984 trivial. 0 not checked. [2025-03-04 11:36:20,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:20,967 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 369 proven. 591 refuted. 0 times theorem prover too weak. 12984 trivial. 0 not checked. [2025-03-04 11:36:20,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870514626] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:20,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:20,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 10] total 19 [2025-03-04 11:36:20,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573918107] [2025-03-04 11:36:20,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:20,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 11:36:20,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:20,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 11:36:20,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-03-04 11:36:20,969 INFO L87 Difference]: Start difference. First operand 154 states and 243 transitions. Second operand has 20 states, 18 states have (on average 6.277777777777778) internal successors, (113), 17 states have internal predecessors, (113), 11 states have call successors, (234), 1 states have call predecessors, (234), 2 states have return successors, (236), 11 states have call predecessors, (236), 11 states have call successors, (236) [2025-03-04 11:36:21,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:21,425 INFO L93 Difference]: Finished difference Result 158 states and 250 transitions. [2025-03-04 11:36:21,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 11:36:21,425 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 6.277777777777778) internal successors, (113), 17 states have internal predecessors, (113), 11 states have call successors, (234), 1 states have call predecessors, (234), 2 states have return successors, (236), 11 states have call predecessors, (236), 11 states have call successors, (236) Word has length 459 [2025-03-04 11:36:21,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:21,427 INFO L225 Difference]: With dead ends: 158 [2025-03-04 11:36:21,427 INFO L226 Difference]: Without dead ends: 157 [2025-03-04 11:36:21,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 928 GetRequests, 903 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:21,428 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 121 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:21,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 963 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:36:21,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-04 11:36:21,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2025-03-04 11:36:21,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 66 states have internal predecessors, (72), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-04 11:36:21,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 242 transitions. [2025-03-04 11:36:21,447 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 242 transitions. Word has length 459 [2025-03-04 11:36:21,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:21,448 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 242 transitions. [2025-03-04 11:36:21,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 6.277777777777778) internal successors, (113), 17 states have internal predecessors, (113), 11 states have call successors, (234), 1 states have call predecessors, (234), 2 states have return successors, (236), 11 states have call predecessors, (236), 11 states have call successors, (236) [2025-03-04 11:36:21,448 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 242 transitions. [2025-03-04 11:36:21,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-04 11:36:21,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:21,450 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,458 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:21,651 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:21,652 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:36:21,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:21,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1331081711, now seen corresponding path program 1 times [2025-03-04 11:36:21,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:21,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977332350] [2025-03-04 11:36:21,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:21,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:21,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-04 11:36:21,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-04 11:36:21,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:21,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:21,907 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 36 proven. 213 refuted. 0 times theorem prover too weak. 13695 trivial. 0 not checked. [2025-03-04 11:36:21,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:21,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977332350] [2025-03-04 11:36:21,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977332350] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:21,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790617629] [2025-03-04 11:36:21,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:21,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:21,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:21,910 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:21,911 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:21,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-04 11:36:22,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-04 11:36:22,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:22,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:22,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:36:22,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:22,230 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 36 proven. 213 refuted. 0 times theorem prover too weak. 13695 trivial. 0 not checked. [2025-03-04 11:36:22,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:22,518 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 36 proven. 213 refuted. 0 times theorem prover too weak. 13695 trivial. 0 not checked. [2025-03-04 11:36:22,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790617629] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:22,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:22,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 14 [2025-03-04 11:36:22,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971798059] [2025-03-04 11:36:22,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:22,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 11:36:22,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:22,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 11:36:22,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:36:22,520 INFO L87 Difference]: Start difference. First operand 153 states and 242 transitions. Second operand has 15 states, 14 states have (on average 8.142857142857142) internal successors, (114), 15 states have internal predecessors, (114), 8 states have call successors, (234), 1 states have call predecessors, (234), 2 states have return successors, (235), 8 states have call predecessors, (235), 8 states have call successors, (235) [2025-03-04 11:36:23,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:23,072 INFO L93 Difference]: Finished difference Result 165 states and 258 transitions. [2025-03-04 11:36:23,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 11:36:23,073 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 8.142857142857142) internal successors, (114), 15 states have internal predecessors, (114), 8 states have call successors, (234), 1 states have call predecessors, (234), 2 states have return successors, (235), 8 states have call predecessors, (235), 8 states have call successors, (235) Word has length 460 [2025-03-04 11:36:23,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:23,074 INFO L225 Difference]: With dead ends: 165 [2025-03-04 11:36:23,074 INFO L226 Difference]: Without dead ends: 164 [2025-03-04 11:36:23,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 939 GetRequests, 915 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:23,075 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 95 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:23,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1150 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:36:23,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-04 11:36:23,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2025-03-04 11:36:23,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 65 states have internal predecessors, (71), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-04 11:36:23,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 241 transitions. [2025-03-04 11:36:23,094 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 241 transitions. Word has length 460 [2025-03-04 11:36:23,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:23,094 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 241 transitions. [2025-03-04 11:36:23,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 8.142857142857142) internal successors, (114), 15 states have internal predecessors, (114), 8 states have call successors, (234), 1 states have call predecessors, (234), 2 states have return successors, (235), 8 states have call predecessors, (235), 8 states have call successors, (235) [2025-03-04 11:36:23,095 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 241 transitions. [2025-03-04 11:36:23,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-03-04 11:36:23,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:23,096 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-04 11:36:23,297 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:23,297 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:36:23,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:23,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1177784550, now seen corresponding path program 1 times [2025-03-04 11:36:23,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:23,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657204943] [2025-03-04 11:36:23,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:23,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:23,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-03-04 11:36:23,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-03-04 11:36:23,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:23,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:23,455 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 30 proven. 219 refuted. 0 times theorem prover too weak. 13695 trivial. 0 not checked. [2025-03-04 11:36:23,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:23,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657204943] [2025-03-04 11:36:23,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657204943] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:23,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110422507] [2025-03-04 11:36:23,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:23,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:23,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:23,458 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:23,459 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:23,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-03-04 11:36:23,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-03-04 11:36:23,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:23,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:23,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 11:36:23,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:23,873 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 369 proven. 591 refuted. 0 times theorem prover too weak. 12984 trivial. 0 not checked. [2025-03-04 11:36:23,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:24,211 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 369 proven. 591 refuted. 0 times theorem prover too weak. 12984 trivial. 0 not checked. [2025-03-04 11:36:24,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110422507] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:24,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:24,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 20 [2025-03-04 11:36:24,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594741813] [2025-03-04 11:36:24,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:24,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 11:36:24,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:24,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 11:36:24,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-03-04 11:36:24,214 INFO L87 Difference]: Start difference. First operand 152 states and 241 transitions. Second operand has 21 states, 19 states have (on average 6.315789473684211) internal successors, (120), 20 states have internal predecessors, (120), 11 states have call successors, (234), 1 states have call predecessors, (234), 2 states have return successors, (236), 10 states have call predecessors, (236), 11 states have call successors, (236) [2025-03-04 11:36:24,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:24,810 INFO L93 Difference]: Finished difference Result 156 states and 246 transitions. [2025-03-04 11:36:24,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 11:36:24,811 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 6.315789473684211) internal successors, (120), 20 states have internal predecessors, (120), 11 states have call successors, (234), 1 states have call predecessors, (234), 2 states have return successors, (236), 10 states have call predecessors, (236), 11 states have call successors, (236) Word has length 463 [2025-03-04 11:36:24,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:24,812 INFO L225 Difference]: With dead ends: 156 [2025-03-04 11:36:24,812 INFO L226 Difference]: Without dead ends: 155 [2025-03-04 11:36:24,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 937 GetRequests, 910 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:36:24,813 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 149 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:24,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1524 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1399 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:36:24,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-04 11:36:24,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2025-03-04 11:36:24,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 64 states have internal predecessors, (70), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-04 11:36:24,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 240 transitions. [2025-03-04 11:36:24,832 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 240 transitions. Word has length 463 [2025-03-04 11:36:24,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:24,832 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 240 transitions. [2025-03-04 11:36:24,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 6.315789473684211) internal successors, (120), 20 states have internal predecessors, (120), 11 states have call successors, (234), 1 states have call predecessors, (234), 2 states have return successors, (236), 10 states have call predecessors, (236), 11 states have call successors, (236) [2025-03-04 11:36:24,833 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 240 transitions. [2025-03-04 11:36:24,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-04 11:36:24,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:24,834 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,842 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:25,039 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:25,039 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:36:25,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:25,039 INFO L85 PathProgramCache]: Analyzing trace with hash 959769947, now seen corresponding path program 1 times [2025-03-04 11:36:25,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:25,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903953065] [2025-03-04 11:36:25,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:25,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:25,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-04 11:36:25,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-04 11:36:25,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:25,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:25,184 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 36 proven. 216 refuted. 0 times theorem prover too weak. 14028 trivial. 0 not checked. [2025-03-04 11:36:25,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:25,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903953065] [2025-03-04 11:36:25,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903953065] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:25,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472171399] [2025-03-04 11:36:25,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:25,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:25,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:25,186 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:25,187 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:25,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-04 11:36:25,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-04 11:36:25,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:25,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:25,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:36:25,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:25,480 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 36 proven. 216 refuted. 0 times theorem prover too weak. 14028 trivial. 0 not checked. [2025-03-04 11:36:25,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:25,712 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 36 proven. 216 refuted. 0 times theorem prover too weak. 14028 trivial. 0 not checked. [2025-03-04 11:36:25,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472171399] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:25,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:25,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 11:36:25,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342294545] [2025-03-04 11:36:25,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:25,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:36:25,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:25,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:36:25,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:36:25,714 INFO L87 Difference]: Start difference. First operand 151 states and 240 transitions. Second operand has 10 states, 9 states have (on average 13.444444444444445) internal successors, (121), 8 states have internal predecessors, (121), 6 states have call successors, (228), 1 states have call predecessors, (228), 2 states have return successors, (229), 6 states have call predecessors, (229), 6 states have call successors, (229) [2025-03-04 11:36:25,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:25,921 INFO L93 Difference]: Finished difference Result 151 states and 240 transitions. [2025-03-04 11:36:25,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:36:25,922 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 13.444444444444445) internal successors, (121), 8 states have internal predecessors, (121), 6 states have call successors, (228), 1 states have call predecessors, (228), 2 states have return successors, (229), 6 states have call predecessors, (229), 6 states have call successors, (229) Word has length 468 [2025-03-04 11:36:25,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:25,923 INFO L225 Difference]: With dead ends: 151 [2025-03-04 11:36:25,923 INFO L226 Difference]: Without dead ends: 150 [2025-03-04 11:36:25,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 939 GetRequests, 931 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:36:25,925 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 57 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:25,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 498 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:36:25,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-04 11:36:25,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-03-04 11:36:25,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 63 states have internal predecessors, (69), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-04 11:36:25,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 239 transitions. [2025-03-04 11:36:25,946 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 239 transitions. Word has length 468 [2025-03-04 11:36:25,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:25,946 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 239 transitions. [2025-03-04 11:36:25,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 13.444444444444445) internal successors, (121), 8 states have internal predecessors, (121), 6 states have call successors, (228), 1 states have call predecessors, (228), 2 states have return successors, (229), 6 states have call predecessors, (229), 6 states have call successors, (229) [2025-03-04 11:36:25,947 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 239 transitions. [2025-03-04 11:36:25,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-03-04 11:36:25,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:25,949 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-04 11:36:26,149 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:26,150 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:36:26,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:26,150 INFO L85 PathProgramCache]: Analyzing trace with hash -311902733, now seen corresponding path program 1 times [2025-03-04 11:36:26,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:26,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317346778] [2025-03-04 11:36:26,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:26,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:26,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-04 11:36:26,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-04 11:36:26,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:26,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:26,437 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 42 proven. 210 refuted. 0 times theorem prover too weak. 14028 trivial. 0 not checked. [2025-03-04 11:36:26,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:26,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317346778] [2025-03-04 11:36:26,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317346778] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:26,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898030786] [2025-03-04 11:36:26,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:26,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:26,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:26,440 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:26,440 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:26,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-04 11:36:26,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-04 11:36:26,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:26,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:26,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:36:26,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:26,735 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 42 proven. 210 refuted. 0 times theorem prover too weak. 14028 trivial. 0 not checked. [2025-03-04 11:36:26,735 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:27,003 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 42 proven. 210 refuted. 0 times theorem prover too weak. 14028 trivial. 0 not checked. [2025-03-04 11:36:27,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898030786] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:27,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:27,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 16 [2025-03-04 11:36:27,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915551390] [2025-03-04 11:36:27,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:27,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 11:36:27,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:27,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 11:36:27,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2025-03-04 11:36:27,006 INFO L87 Difference]: Start difference. First operand 150 states and 239 transitions. Second operand has 17 states, 16 states have (on average 7.8125) internal successors, (125), 17 states have internal predecessors, (125), 9 states have call successors, (235), 1 states have call predecessors, (235), 2 states have return successors, (236), 9 states have call predecessors, (236), 9 states have call successors, (236) [2025-03-04 11:36:27,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:27,683 INFO L93 Difference]: Finished difference Result 169 states and 264 transitions. [2025-03-04 11:36:27,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 11:36:27,683 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 7.8125) internal successors, (125), 17 states have internal predecessors, (125), 9 states have call successors, (235), 1 states have call predecessors, (235), 2 states have return successors, (236), 9 states have call predecessors, (236), 9 states have call successors, (236) Word has length 469 [2025-03-04 11:36:27,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:27,685 INFO L225 Difference]: With dead ends: 169 [2025-03-04 11:36:27,685 INFO L226 Difference]: Without dead ends: 168 [2025-03-04 11:36:27,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 962 GetRequests, 933 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2025-03-04 11:36:27,686 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 66 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 1395 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:27,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1443 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1395 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:36:27,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-04 11:36:27,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 149. [2025-03-04 11:36:27,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 62 states have (on average 1.096774193548387) internal successors, (68), 62 states have internal predecessors, (68), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-04 11:36:27,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 238 transitions. [2025-03-04 11:36:27,707 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 238 transitions. Word has length 469 [2025-03-04 11:36:27,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:27,708 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 238 transitions. [2025-03-04 11:36:27,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 7.8125) internal successors, (125), 17 states have internal predecessors, (125), 9 states have call successors, (235), 1 states have call predecessors, (235), 2 states have return successors, (236), 9 states have call predecessors, (236), 9 states have call successors, (236) [2025-03-04 11:36:27,708 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 238 transitions. [2025-03-04 11:36:27,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-04 11:36:27,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:27,710 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-04 11:36:27,910 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:27,910 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 11:36:27,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:27,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1880076488, now seen corresponding path program 1 times [2025-03-04 11:36:27,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:27,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269493476] [2025-03-04 11:36:27,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:27,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:27,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-04 11:36:27,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-04 11:36:27,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:27,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:28,136 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 78 proven. 420 refuted. 0 times theorem prover too weak. 13782 trivial. 0 not checked. [2025-03-04 11:36:28,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:28,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269493476] [2025-03-04 11:36:28,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269493476] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:28,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308759731] [2025-03-04 11:36:28,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:28,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:28,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:28,139 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:28,140 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:28,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-04 11:36:28,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-04 11:36:28,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:28,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:28,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:36:28,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:28,465 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 36 proven. 216 refuted. 0 times theorem prover too weak. 14028 trivial. 0 not checked. [2025-03-04 11:36:28,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:28,723 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 36 proven. 216 refuted. 0 times theorem prover too weak. 14028 trivial. 0 not checked. [2025-03-04 11:36:28,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308759731] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:28,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:28,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-04 11:36:28,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752556512] [2025-03-04 11:36:28,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:28,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 11:36:28,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:28,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 11:36:28,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:36:28,725 INFO L87 Difference]: Start difference. First operand 149 states and 238 transitions. Second operand has 11 states, 10 states have (on average 13.0) internal successors, (130), 11 states have internal predecessors, (130), 5 states have call successors, (227), 1 states have call predecessors, (227), 2 states have return successors, (227), 5 states have call predecessors, (227), 5 states have call successors, (227) [2025-03-04 11:36:29,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:29,042 INFO L93 Difference]: Finished difference Result 149 states and 238 transitions. [2025-03-04 11:36:29,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:36:29,043 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 13.0) internal successors, (130), 11 states have internal predecessors, (130), 5 states have call successors, (227), 1 states have call predecessors, (227), 2 states have return successors, (227), 5 states have call predecessors, (227), 5 states have call successors, (227) Word has length 472 [2025-03-04 11:36:29,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:29,043 INFO L225 Difference]: With dead ends: 149 [2025-03-04 11:36:29,043 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 11:36:29,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 951 GetRequests, 940 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:29,044 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 54 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:29,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 606 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:36:29,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 11:36:29,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 11:36:29,045 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:29,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 11:36:29,045 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 472 [2025-03-04 11:36:29,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:29,045 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 11:36:29,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 13.0) internal successors, (130), 11 states have internal predecessors, (130), 5 states have call successors, (227), 1 states have call predecessors, (227), 2 states have return successors, (227), 5 states have call predecessors, (227), 5 states have call successors, (227) [2025-03-04 11:36:29,045 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 11:36:29,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 11:36:29,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 28 remaining) [2025-03-04 11:36:29,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 28 remaining) [2025-03-04 11:36:29,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 28 remaining) [2025-03-04 11:36:29,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 28 remaining) [2025-03-04 11:36:29,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 28 remaining) [2025-03-04 11:36:29,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 28 remaining) [2025-03-04 11:36:29,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 28 remaining) [2025-03-04 11:36:29,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 28 remaining) [2025-03-04 11:36:29,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 28 remaining) [2025-03-04 11:36:29,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 28 remaining) [2025-03-04 11:36:29,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 28 remaining) [2025-03-04 11:36:29,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 28 remaining) [2025-03-04 11:36:29,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 28 remaining) [2025-03-04 11:36:29,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 28 remaining) [2025-03-04 11:36:29,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 28 remaining) [2025-03-04 11:36:29,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 28 remaining) [2025-03-04 11:36:29,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 28 remaining) [2025-03-04 11:36:29,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 28 remaining) [2025-03-04 11:36:29,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 28 remaining) [2025-03-04 11:36:29,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 28 remaining) [2025-03-04 11:36:29,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 28 remaining) [2025-03-04 11:36:29,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 28 remaining) [2025-03-04 11:36:29,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 28 remaining) [2025-03-04 11:36:29,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 28 remaining) [2025-03-04 11:36:29,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 28 remaining) [2025-03-04 11:36:29,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 28 remaining) [2025-03-04 11:36:29,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 28 remaining) [2025-03-04 11:36:29,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 28 remaining) [2025-03-04 11:36:29,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-04 11:36:29,249 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:29,252 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] [2025-03-04 11:36:29,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 11:36:33,791 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 11:36:33,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 11:36:33 BoogieIcfgContainer [2025-03-04 11:36:33,796 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 11:36:33,796 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 11:36:33,796 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 11:36:33,796 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 11:36:33,797 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:35" (3/4) ... [2025-03-04 11:36:33,798 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 11:36:33,803 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume [2025-03-04 11:36:33,808 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-04 11:36:33,811 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 11:36:33,811 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 11:36:33,811 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 11:36:33,880 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 11:36:33,881 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 11:36:33,881 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 11:36:33,881 INFO L158 Benchmark]: Toolchain (without parser) took 59160.71ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 105.9MB in the beginning and 138.6MB in the end (delta: -32.7MB). Peak memory consumption was 148.0MB. Max. memory is 16.1GB. [2025-03-04 11:36:33,881 INFO L158 Benchmark]: CDTParser took 1.93ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:36:33,881 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.65ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 92.9MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:36:33,882 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.31ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 91.0MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:36:33,882 INFO L158 Benchmark]: Boogie Preprocessor took 43.16ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 89.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:36:33,882 INFO L158 Benchmark]: IcfgBuilder took 404.81ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 64.4MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 11:36:33,882 INFO L158 Benchmark]: TraceAbstraction took 58381.52ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 63.6MB in the beginning and 150.4MB in the end (delta: -86.8MB). Peak memory consumption was 151.5MB. Max. memory is 16.1GB. [2025-03-04 11:36:33,882 INFO L158 Benchmark]: Witness Printer took 84.44ms. Allocated memory is still 327.2MB. Free memory was 150.4MB in the beginning and 138.6MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:36:33,883 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.93ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.65ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 92.9MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.31ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 91.0MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.16ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 89.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 404.81ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 64.4MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 58381.52ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 63.6MB in the beginning and 150.4MB in the end (delta: -86.8MB). Peak memory consumption was 151.5MB. Max. memory is 16.1GB. * Witness Printer took 84.44ms. Allocated memory is still 327.2MB. Free memory was 150.4MB in the beginning and 138.6MB in the end (delta: 11.9MB). 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: 157]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 157]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 156]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 156]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 154]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 154]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 153]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 153]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 151]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 151]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 150]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 150]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 148]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 148]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 147]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 147]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 145]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 145]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 144]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 144]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 142]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 142]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 139]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 139]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 138]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 138]: 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, 183 locations, 28 error locations. Started 1 CEGAR loops. OverallTime: 53.8s, OverallIterations: 24, TraceHistogramMax: 85, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1290 SdHoareTripleChecker+Valid, 10.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1290 mSDsluCounter, 26880 SdHoareTripleChecker+Invalid, 9.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23068 mSDsCounter, 1445 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21980 IncrementalHoareTripleChecker+Invalid, 23425 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1445 mSolverCounterUnsat, 3812 mSDtfsCounter, 21980 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20153 GetRequests, 19680 SyntacticMatches, 12 SemanticMatches, 461 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3189 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=0, InterpolantAutomatonStates: 267, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 24 MinimizatonAttempts, 99 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 30.1s InterpolantComputationTime, 20743 NumberOfCodeBlocks, 20743 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 30423 ConstructedInterpolants, 0 QuantifiedInterpolants, 80270 SizeOfPredicates, 69 NumberOfNonLiveVariables, 18922 ConjunctsInSsa, 384 ConjunctsInUnsatCore, 69 InterpolantComputations, 2 PerfectInterpolantSequences, 891384/915204 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 28 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 11:36:33,902 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