./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/xcsp/AllInterval-007.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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-007.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 79ad480fc17f59cc4e46ec2dbc023b5da3460c72b3c8ca1cc6dbc35a93f8cf64 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:51:15,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:51:15,557 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:51:15,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:51:15,561 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:51:15,576 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:51:15,577 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:51:15,577 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:51:15,577 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:51:15,577 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:51:15,577 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:51:15,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:51:15,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:51:15,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:51:15,578 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:51:15,578 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:51:15,578 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:51:15,578 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:51:15,578 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:51:15,578 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:51:15,578 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:51:15,578 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:51:15,578 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:51:15,578 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:51:15,578 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:51:15,578 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:51:15,578 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:51:15,578 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:51:15,578 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:51:15,578 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:51:15,578 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:51:15,579 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:51:15,579 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:51:15,579 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:51:15,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:51:15,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:51:15,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:51:15,579 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:51:15,579 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:51:15,579 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:51:15,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:51:15,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:51:15,579 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:51:15,579 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:51:15,579 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:51:15,579 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 -> 79ad480fc17f59cc4e46ec2dbc023b5da3460c72b3c8ca1cc6dbc35a93f8cf64 [2025-03-17 15:51:15,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:51:15,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:51:15,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:51:15,820 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:51:15,820 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:51:15,822 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/xcsp/AllInterval-007.c [2025-03-17 15:51:17,032 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0ed3e320/48e2c60b666e448aaefcd608e37d9ff7/FLAGe8e28d915 [2025-03-17 15:51:17,260 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:51:17,261 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-007.c [2025-03-17 15:51:17,279 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0ed3e320/48e2c60b666e448aaefcd608e37d9ff7/FLAGe8e28d915 [2025-03-17 15:51:17,590 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0ed3e320/48e2c60b666e448aaefcd608e37d9ff7 [2025-03-17 15:51:17,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:51:17,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:51:17,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:51:17,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:51:17,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:51:17,599 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:51:17" (1/1) ... [2025-03-17 15:51:17,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@184cb39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:17, skipping insertion in model container [2025-03-17 15:51:17,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:51:17" (1/1) ... [2025-03-17 15:51:17,611 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:51:17,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:51:17,742 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:51:17,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:51:17,786 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:51:17,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:17 WrapperNode [2025-03-17 15:51:17,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:51:17,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:51:17,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:51:17,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:51:17,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:17" (1/1) ... [2025-03-17 15:51:17,801 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:17" (1/1) ... [2025-03-17 15:51:17,830 INFO L138 Inliner]: procedures = 13, calls = 76, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 211 [2025-03-17 15:51:17,831 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:51:17,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:51:17,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:51:17,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:51:17,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:17" (1/1) ... [2025-03-17 15:51:17,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:17" (1/1) ... [2025-03-17 15:51:17,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:17" (1/1) ... [2025-03-17 15:51:17,855 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-17 15:51:17,855 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:17" (1/1) ... [2025-03-17 15:51:17,855 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:17" (1/1) ... [2025-03-17 15:51:17,858 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:17" (1/1) ... [2025-03-17 15:51:17,858 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:17" (1/1) ... [2025-03-17 15:51:17,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:17" (1/1) ... [2025-03-17 15:51:17,862 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:17" (1/1) ... [2025-03-17 15:51:17,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:51:17,864 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:51:17,867 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:51:17,868 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:51:17,869 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:17" (1/1) ... [2025-03-17 15:51:17,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:51:17,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:51:17,899 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-17 15:51:17,903 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-17 15:51:17,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:51:17,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:51:17,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:51:17,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:51:17,922 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2025-03-17 15:51:17,922 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2025-03-17 15:51:17,966 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:51:17,967 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:51:18,213 INFO L? ?]: Removed 58 outVars from TransFormulas that were not future-live. [2025-03-17 15:51:18,213 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:51:18,226 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:51:18,228 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:51:18,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:51:18 BoogieIcfgContainer [2025-03-17 15:51:18,228 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:51:18,231 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:51:18,231 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:51:18,234 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:51:18,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:51:17" (1/3) ... [2025-03-17 15:51:18,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c93a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:51:18, skipping insertion in model container [2025-03-17 15:51:18,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:17" (2/3) ... [2025-03-17 15:51:18,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c93a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:51:18, skipping insertion in model container [2025-03-17 15:51:18,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:51:18" (3/3) ... [2025-03-17 15:51:18,238 INFO L128 eAbstractionObserver]: Analyzing ICFG AllInterval-007.c [2025-03-17 15:51:18,250 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:51:18,252 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG AllInterval-007.c that has 2 procedures, 150 locations, 1 initial locations, 0 loop locations, and 24 error locations. [2025-03-17 15:51:18,307 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:51:18,316 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;@678c2ec3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:51:18,317 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-03-17 15:51:18,321 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 56 states have (on average 1.5535714285714286) internal successors, (87), 80 states have internal predecessors, (87), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 15:51:18,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-03-17 15:51:18,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:51:18,340 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:51:18,340 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-17 15:51:18,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:51:18,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1787162823, now seen corresponding path program 1 times [2025-03-17 15:51:18,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:51:18,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301935326] [2025-03-17 15:51:18,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:18,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:51:18,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-17 15:51:18,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-17 15:51:18,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:18,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:18,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 7442 trivial. 0 not checked. [2025-03-17 15:51:18,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:51:18,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301935326] [2025-03-17 15:51:18,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301935326] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:51:18,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823142964] [2025-03-17 15:51:18,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:18,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:51:18,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:51:18,682 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-17 15:51:18,684 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-17 15:51:18,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-17 15:51:18,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-17 15:51:18,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:18,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:18,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 15:51:18,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:51:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 7442 trivial. 0 not checked. [2025-03-17 15:51:18,884 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:51:18,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823142964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:51:18,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:51:18,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 15:51:18,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890734024] [2025-03-17 15:51:18,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:51:18,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 15:51:18,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:51:18,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 15:51:18,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 15:51:18,909 INFO L87 Difference]: Start difference. First operand has 150 states, 56 states have (on average 1.5535714285714286) internal successors, (87), 80 states have internal predecessors, (87), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (62), 2 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 2 states have call successors, (62) [2025-03-17 15:51:18,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:51:18,948 INFO L93 Difference]: Finished difference Result 296 states and 510 transitions. [2025-03-17 15:51:18,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 15:51:18,951 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (62), 2 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 2 states have call successors, (62) Word has length 326 [2025-03-17 15:51:18,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:51:18,958 INFO L225 Difference]: With dead ends: 296 [2025-03-17 15:51:18,958 INFO L226 Difference]: Without dead ends: 145 [2025-03-17 15:51:18,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 327 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-17 15:51:18,964 INFO L435 NwaCegarLoop]: 220 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, 220 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-17 15:51:18,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:51:18,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-17 15:51:19,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2025-03-17 15:51:19,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 53 states have (on average 1.528301886792453) internal successors, (81), 76 states have internal predecessors, (81), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 15:51:19,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 215 transitions. [2025-03-17 15:51:19,015 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 215 transitions. Word has length 326 [2025-03-17 15:51:19,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:51:19,017 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 215 transitions. [2025-03-17 15:51:19,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (62), 2 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 2 states have call successors, (62) [2025-03-17 15:51:19,018 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 215 transitions. [2025-03-17 15:51:19,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-03-17 15:51:19,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:51:19,025 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:51:19,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 15:51:19,231 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-17 15:51:19,231 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-17 15:51:19,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:51:19,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1550468967, now seen corresponding path program 1 times [2025-03-17 15:51:19,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:51:19,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258740106] [2025-03-17 15:51:19,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:19,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:51:19,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-17 15:51:19,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-17 15:51:19,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:19,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:19,958 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 6 proven. 354 refuted. 0 times theorem prover too weak. 7204 trivial. 0 not checked. [2025-03-17 15:51:19,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:51:19,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258740106] [2025-03-17 15:51:19,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258740106] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:51:19,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485619436] [2025-03-17 15:51:19,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:19,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:51:19,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:51:19,963 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-17 15:51:19,965 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-17 15:51:20,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-17 15:51:20,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-17 15:51:20,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:20,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:20,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 15:51:20,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:51:20,510 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 7381 trivial. 0 not checked. [2025-03-17 15:51:20,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:51:20,916 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 7381 trivial. 0 not checked. [2025-03-17 15:51:20,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485619436] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:51:20,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:51:20,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-17 15:51:20,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842603899] [2025-03-17 15:51:20,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:51:20,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 15:51:20,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:51:20,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 15:51:20,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:51:20,920 INFO L87 Difference]: Start difference. First operand 145 states and 215 transitions. Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 6 states have call successors, (183), 1 states have call predecessors, (183), 2 states have return successors, (184), 5 states have call predecessors, (184), 6 states have call successors, (184) [2025-03-17 15:51:21,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:51:21,355 INFO L93 Difference]: Finished difference Result 145 states and 215 transitions. [2025-03-17 15:51:21,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:51:21,356 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 6 states have call successors, (183), 1 states have call predecessors, (183), 2 states have return successors, (184), 5 states have call predecessors, (184), 6 states have call successors, (184) Word has length 326 [2025-03-17 15:51:21,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:51:21,358 INFO L225 Difference]: With dead ends: 145 [2025-03-17 15:51:21,358 INFO L226 Difference]: Without dead ends: 144 [2025-03-17 15:51:21,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 658 GetRequests, 649 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-17 15:51:21,359 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 3 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:51:21,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 618 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 15:51:21,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-17 15:51:21,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-03-17 15:51:21,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 53 states have (on average 1.509433962264151) internal successors, (80), 75 states have internal predecessors, (80), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 15:51:21,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 214 transitions. [2025-03-17 15:51:21,386 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 214 transitions. Word has length 326 [2025-03-17 15:51:21,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:51:21,388 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 214 transitions. [2025-03-17 15:51:21,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 6 states have call successors, (183), 1 states have call predecessors, (183), 2 states have return successors, (184), 5 states have call predecessors, (184), 6 states have call successors, (184) [2025-03-17 15:51:21,388 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 214 transitions. [2025-03-17 15:51:21,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-03-17 15:51:21,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:51:21,391 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:51:21,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 15:51:21,592 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-17 15:51:21,592 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-17 15:51:21,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:51:21,593 INFO L85 PathProgramCache]: Analyzing trace with hash 819897760, now seen corresponding path program 1 times [2025-03-17 15:51:21,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:51:21,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689253620] [2025-03-17 15:51:21,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:21,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:51:21,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-03-17 15:51:21,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-03-17 15:51:21,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:21,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:21,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 6 proven. 177 refuted. 0 times theorem prover too weak. 7381 trivial. 0 not checked. [2025-03-17 15:51:21,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:51:21,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689253620] [2025-03-17 15:51:21,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689253620] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:51:21,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722430905] [2025-03-17 15:51:21,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:21,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:51:21,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:51:21,924 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-17 15:51:21,926 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-17 15:51:21,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-03-17 15:51:22,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-03-17 15:51:22,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:22,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:22,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 15:51:22,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:51:22,329 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 6 proven. 177 refuted. 0 times theorem prover too weak. 7381 trivial. 0 not checked. [2025-03-17 15:51:22,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:51:22,641 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 6 proven. 177 refuted. 0 times theorem prover too weak. 7381 trivial. 0 not checked. [2025-03-17 15:51:22,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722430905] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:51:22,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:51:22,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-17 15:51:22,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973249370] [2025-03-17 15:51:22,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:51:22,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 15:51:22,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:51:22,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 15:51:22,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:51:22,644 INFO L87 Difference]: Start difference. First operand 144 states and 214 transitions. Second operand has 10 states, 8 states have (on average 7.0) internal successors, (56), 10 states have internal predecessors, (56), 5 states have call successors, (181), 1 states have call predecessors, (181), 2 states have return successors, (182), 4 states have call predecessors, (182), 5 states have call successors, (182) [2025-03-17 15:51:22,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:51:22,938 INFO L93 Difference]: Finished difference Result 144 states and 214 transitions. [2025-03-17 15:51:22,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:51:22,939 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.0) internal successors, (56), 10 states have internal predecessors, (56), 5 states have call successors, (181), 1 states have call predecessors, (181), 2 states have return successors, (182), 4 states have call predecessors, (182), 5 states have call successors, (182) Word has length 327 [2025-03-17 15:51:22,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:51:22,942 INFO L225 Difference]: With dead ends: 144 [2025-03-17 15:51:22,943 INFO L226 Difference]: Without dead ends: 143 [2025-03-17 15:51:22,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 658 GetRequests, 649 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:51:22,944 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:51:22,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 540 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:51:22,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-17 15:51:22,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-03-17 15:51:22,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 53 states have (on average 1.490566037735849) internal successors, (79), 74 states have internal predecessors, (79), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 15:51:22,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 213 transitions. [2025-03-17 15:51:22,961 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 213 transitions. Word has length 327 [2025-03-17 15:51:22,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:51:22,961 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 213 transitions. [2025-03-17 15:51:22,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.0) internal successors, (56), 10 states have internal predecessors, (56), 5 states have call successors, (181), 1 states have call predecessors, (181), 2 states have return successors, (182), 4 states have call predecessors, (182), 5 states have call successors, (182) [2025-03-17 15:51:22,962 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 213 transitions. [2025-03-17 15:51:22,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-03-17 15:51:22,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:51:22,964 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:51:22,972 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-17 15:51:23,169 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-17 15:51:23,169 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-17 15:51:23,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:51:23,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1942733406, now seen corresponding path program 1 times [2025-03-17 15:51:23,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:51:23,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924394248] [2025-03-17 15:51:23,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:23,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:51:23,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-17 15:51:23,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-17 15:51:23,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:23,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:23,250 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-03-17 15:51:23,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:51:23,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924394248] [2025-03-17 15:51:23,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924394248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:51:23,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:51:23,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:51:23,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004239255] [2025-03-17 15:51:23,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:51:23,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:51:23,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:51:23,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:51:23,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:51:23,252 INFO L87 Difference]: Start difference. First operand 143 states and 213 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-17 15:51:23,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:51:23,299 INFO L93 Difference]: Finished difference Result 143 states and 213 transitions. [2025-03-17 15:51:23,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:51:23,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 329 [2025-03-17 15:51:23,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:51:23,303 INFO L225 Difference]: With dead ends: 143 [2025-03-17 15:51:23,303 INFO L226 Difference]: Without dead ends: 137 [2025-03-17 15:51:23,303 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-17 15:51:23,304 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 6 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:51:23,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 356 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:51:23,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-17 15:51:23,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-03-17 15:51:23,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 68 states have internal predecessors, (73), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 15:51:23,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 207 transitions. [2025-03-17 15:51:23,326 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 207 transitions. Word has length 329 [2025-03-17 15:51:23,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:51:23,327 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 207 transitions. [2025-03-17 15:51:23,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-17 15:51:23,328 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 207 transitions. [2025-03-17 15:51:23,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-03-17 15:51:23,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:51:23,331 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:51:23,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 15:51:23,332 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-17 15:51:23,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:51:23,332 INFO L85 PathProgramCache]: Analyzing trace with hash 95193476, now seen corresponding path program 1 times [2025-03-17 15:51:23,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:51:23,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569548551] [2025-03-17 15:51:23,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:23,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:51:23,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-03-17 15:51:23,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-03-17 15:51:23,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:23,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:23,699 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 6 proven. 354 refuted. 0 times theorem prover too weak. 7204 trivial. 0 not checked. [2025-03-17 15:51:23,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:51:23,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569548551] [2025-03-17 15:51:23,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569548551] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:51:23,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679722322] [2025-03-17 15:51:23,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:23,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:51:23,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:51:23,705 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-17 15:51:23,706 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-17 15:51:23,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-03-17 15:51:23,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-03-17 15:51:23,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:23,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:23,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 15:51:23,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:51:24,067 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 7381 trivial. 0 not checked. [2025-03-17 15:51:24,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:51:24,361 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 7381 trivial. 0 not checked. [2025-03-17 15:51:24,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679722322] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:51:24,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:51:24,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-17 15:51:24,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165539319] [2025-03-17 15:51:24,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:51:24,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 15:51:24,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:51:24,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 15:51:24,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:51:24,366 INFO L87 Difference]: Start difference. First operand 137 states and 207 transitions. Second operand has 11 states, 10 states have (on average 6.3) internal successors, (63), 11 states have internal predecessors, (63), 5 states have call successors, (182), 1 states have call predecessors, (182), 2 states have return successors, (182), 4 states have call predecessors, (182), 5 states have call successors, (182) [2025-03-17 15:51:24,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:51:24,696 INFO L93 Difference]: Finished difference Result 137 states and 207 transitions. [2025-03-17 15:51:24,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:51:24,697 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.3) internal successors, (63), 11 states have internal predecessors, (63), 5 states have call successors, (182), 1 states have call predecessors, (182), 2 states have return successors, (182), 4 states have call predecessors, (182), 5 states have call successors, (182) Word has length 330 [2025-03-17 15:51:24,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:51:24,698 INFO L225 Difference]: With dead ends: 137 [2025-03-17 15:51:24,698 INFO L226 Difference]: Without dead ends: 136 [2025-03-17 15:51:24,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 656 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:51:24,699 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:51:24,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 620 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:51:24,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-17 15:51:24,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-03-17 15:51:24,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 67 states have internal predecessors, (72), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 15:51:24,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 206 transitions. [2025-03-17 15:51:24,720 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 206 transitions. Word has length 330 [2025-03-17 15:51:24,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:51:24,720 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 206 transitions. [2025-03-17 15:51:24,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.3) internal successors, (63), 11 states have internal predecessors, (63), 5 states have call successors, (182), 1 states have call predecessors, (182), 2 states have return successors, (182), 4 states have call predecessors, (182), 5 states have call successors, (182) [2025-03-17 15:51:24,721 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 206 transitions. [2025-03-17 15:51:24,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-03-17 15:51:24,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:51:24,723 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:51:24,730 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-17 15:51:24,927 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-17 15:51:24,927 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-17 15:51:24,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:51:24,928 INFO L85 PathProgramCache]: Analyzing trace with hash 660214954, now seen corresponding path program 1 times [2025-03-17 15:51:24,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:51:24,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304766623] [2025-03-17 15:51:24,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:24,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:51:24,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-03-17 15:51:24,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-03-17 15:51:24,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:24,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 6 proven. 180 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-03-17 15:51:25,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:51:25,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304766623] [2025-03-17 15:51:25,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304766623] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:51:25,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160353192] [2025-03-17 15:51:25,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:25,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:51:25,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:51:25,172 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-17 15:51:25,173 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-17 15:51:25,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-03-17 15:51:25,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-03-17 15:51:25,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:25,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:25,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 15:51:25,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:51:25,647 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 228 proven. 480 refuted. 0 times theorem prover too weak. 7104 trivial. 0 not checked. [2025-03-17 15:51:25,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:51:26,029 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 228 proven. 480 refuted. 0 times theorem prover too weak. 7104 trivial. 0 not checked. [2025-03-17 15:51:26,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160353192] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:51:26,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:51:26,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 10] total 19 [2025-03-17 15:51:26,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165052599] [2025-03-17 15:51:26,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:51:26,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 15:51:26,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:51:26,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 15:51:26,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-03-17 15:51:26,031 INFO L87 Difference]: Start difference. First operand 136 states and 206 transitions. Second operand has 20 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 17 states have internal predecessors, (66), 11 states have call successors, (187), 1 states have call predecessors, (187), 2 states have return successors, (189), 11 states have call predecessors, (189), 11 states have call successors, (189) [2025-03-17 15:51:26,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:51:26,567 INFO L93 Difference]: Finished difference Result 140 states and 213 transitions. [2025-03-17 15:51:26,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 15:51:26,567 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 17 states have internal predecessors, (66), 11 states have call successors, (187), 1 states have call predecessors, (187), 2 states have return successors, (189), 11 states have call predecessors, (189), 11 states have call successors, (189) Word has length 335 [2025-03-17 15:51:26,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:51:26,569 INFO L225 Difference]: With dead ends: 140 [2025-03-17 15:51:26,569 INFO L226 Difference]: Without dead ends: 139 [2025-03-17 15:51:26,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 655 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-17 15:51:26,570 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 30 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:51:26,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1083 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 15:51:26,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-17 15:51:26,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2025-03-17 15:51:26,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 66 states have internal predecessors, (71), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 15:51:26,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 205 transitions. [2025-03-17 15:51:26,586 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 205 transitions. Word has length 335 [2025-03-17 15:51:26,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:51:26,587 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 205 transitions. [2025-03-17 15:51:26,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 17 states have internal predecessors, (66), 11 states have call successors, (187), 1 states have call predecessors, (187), 2 states have return successors, (189), 11 states have call predecessors, (189), 11 states have call successors, (189) [2025-03-17 15:51:26,587 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 205 transitions. [2025-03-17 15:51:26,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-03-17 15:51:26,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:51:26,590 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:51:26,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 15:51:26,795 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-17 15:51:26,795 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-17 15:51:26,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:51:26,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1008172879, now seen corresponding path program 1 times [2025-03-17 15:51:26,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:51:26,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276173911] [2025-03-17 15:51:26,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:26,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:51:26,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-03-17 15:51:26,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-03-17 15:51:26,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:26,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:27,033 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 12 proven. 174 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-03-17 15:51:27,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:51:27,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276173911] [2025-03-17 15:51:27,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276173911] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:51:27,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326800387] [2025-03-17 15:51:27,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:27,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:51:27,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:51:27,040 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-17 15:51:27,041 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-17 15:51:27,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-03-17 15:51:27,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-03-17 15:51:27,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:27,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:27,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 15:51:27,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:51:27,338 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 12 proven. 174 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-03-17 15:51:27,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:51:27,590 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 12 proven. 174 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-03-17 15:51:27,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326800387] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:51:27,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:51:27,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2025-03-17 15:51:27,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201598368] [2025-03-17 15:51:27,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:51:27,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 15:51:27,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:51:27,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 15:51:27,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:51:27,594 INFO L87 Difference]: Start difference. First operand 135 states and 205 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 6 states have call successors, (183), 1 states have call predecessors, (183), 2 states have return successors, (184), 6 states have call predecessors, (184), 6 states have call successors, (184) [2025-03-17 15:51:28,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:51:28,001 INFO L93 Difference]: Finished difference Result 135 states and 205 transitions. [2025-03-17 15:51:28,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 15:51:28,002 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 6 states have call successors, (183), 1 states have call predecessors, (183), 2 states have return successors, (184), 6 states have call predecessors, (184), 6 states have call successors, (184) Word has length 336 [2025-03-17 15:51:28,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:51:28,003 INFO L225 Difference]: With dead ends: 135 [2025-03-17 15:51:28,003 INFO L226 Difference]: Without dead ends: 134 [2025-03-17 15:51:28,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 667 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-17 15:51:28,004 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 24 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:51:28,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 779 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:51:28,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-17 15:51:28,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-03-17 15:51:28,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 53 states have (on average 1.320754716981132) internal successors, (70), 65 states have internal predecessors, (70), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 15:51:28,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 204 transitions. [2025-03-17 15:51:28,025 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 204 transitions. Word has length 336 [2025-03-17 15:51:28,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:51:28,025 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 204 transitions. [2025-03-17 15:51:28,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 11 states have internal predecessors, (65), 6 states have call successors, (183), 1 states have call predecessors, (183), 2 states have return successors, (184), 6 states have call predecessors, (184), 6 states have call successors, (184) [2025-03-17 15:51:28,026 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 204 transitions. [2025-03-17 15:51:28,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-03-17 15:51:28,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:51:28,028 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:51:28,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 15:51:28,228 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-17 15:51:28,229 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-17 15:51:28,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:51:28,229 INFO L85 PathProgramCache]: Analyzing trace with hash 228088391, now seen corresponding path program 1 times [2025-03-17 15:51:28,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:51:28,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265885820] [2025-03-17 15:51:28,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:28,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:51:28,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-17 15:51:28,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-17 15:51:28,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:28,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:28,418 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 6 proven. 180 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-03-17 15:51:28,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:51:28,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265885820] [2025-03-17 15:51:28,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265885820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:51:28,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049996618] [2025-03-17 15:51:28,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:28,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:51:28,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:51:28,422 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-17 15:51:28,423 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-17 15:51:28,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-17 15:51:28,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-17 15:51:28,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:28,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:28,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 15:51:28,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:51:28,846 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 228 proven. 480 refuted. 0 times theorem prover too weak. 7104 trivial. 0 not checked. [2025-03-17 15:51:28,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:51:29,206 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 228 proven. 480 refuted. 0 times theorem prover too weak. 7104 trivial. 0 not checked. [2025-03-17 15:51:29,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049996618] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:51:29,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:51:29,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 20 [2025-03-17 15:51:29,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309696506] [2025-03-17 15:51:29,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:51:29,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 15:51:29,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:51:29,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 15:51:29,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-03-17 15:51:29,209 INFO L87 Difference]: Start difference. First operand 134 states and 204 transitions. Second operand has 21 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 20 states have internal predecessors, (73), 11 states have call successors, (187), 1 states have call predecessors, (187), 2 states have return successors, (189), 10 states have call predecessors, (189), 11 states have call successors, (189) [2025-03-17 15:51:29,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:51:29,771 INFO L93 Difference]: Finished difference Result 138 states and 209 transitions. [2025-03-17 15:51:29,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 15:51:29,772 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 20 states have internal predecessors, (73), 11 states have call successors, (187), 1 states have call predecessors, (187), 2 states have return successors, (189), 10 states have call predecessors, (189), 11 states have call successors, (189) Word has length 339 [2025-03-17 15:51:29,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:51:29,774 INFO L225 Difference]: With dead ends: 138 [2025-03-17 15:51:29,774 INFO L226 Difference]: Without dead ends: 137 [2025-03-17 15:51:29,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 662 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-17 15:51:29,775 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 48 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 15:51:29,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 1318 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 15:51:29,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-17 15:51:29,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2025-03-17 15:51:29,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 64 states have internal predecessors, (69), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 15:51:29,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 203 transitions. [2025-03-17 15:51:29,785 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 203 transitions. Word has length 339 [2025-03-17 15:51:29,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:51:29,787 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 203 transitions. [2025-03-17 15:51:29,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 20 states have internal predecessors, (73), 11 states have call successors, (187), 1 states have call predecessors, (187), 2 states have return successors, (189), 10 states have call predecessors, (189), 11 states have call successors, (189) [2025-03-17 15:51:29,788 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 203 transitions. [2025-03-17 15:51:29,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-03-17 15:51:29,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:51:29,790 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:51:29,797 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-17 15:51:29,994 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-17 15:51:29,998 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-17 15:51:29,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:51:29,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1474184269, now seen corresponding path program 1 times [2025-03-17 15:51:29,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:51:29,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612142080] [2025-03-17 15:51:29,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:29,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:51:30,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-17 15:51:30,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-17 15:51:30,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:30,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:30,177 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 12 proven. 177 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-17 15:51:30,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:51:30,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612142080] [2025-03-17 15:51:30,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612142080] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:51:30,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462905745] [2025-03-17 15:51:30,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:30,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:51:30,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:51:30,180 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-17 15:51:30,182 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-17 15:51:30,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-17 15:51:30,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-17 15:51:30,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:30,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:30,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 15:51:30,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:51:30,466 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 12 proven. 177 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-17 15:51:30,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:51:30,729 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 12 proven. 177 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-17 15:51:30,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462905745] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:51:30,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:51:30,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-17 15:51:30,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86571895] [2025-03-17 15:51:30,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:51:30,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 15:51:30,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:51:30,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 15:51:30,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:51:30,733 INFO L87 Difference]: Start difference. First operand 133 states and 203 transitions. Second operand has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 6 states have call successors, (181), 1 states have call predecessors, (181), 2 states have return successors, (182), 6 states have call predecessors, (182), 6 states have call successors, (182) [2025-03-17 15:51:30,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:51:30,974 INFO L93 Difference]: Finished difference Result 133 states and 203 transitions. [2025-03-17 15:51:30,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:51:30,974 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 6 states have call successors, (181), 1 states have call predecessors, (181), 2 states have return successors, (182), 6 states have call predecessors, (182), 6 states have call successors, (182) Word has length 344 [2025-03-17 15:51:30,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:51:30,977 INFO L225 Difference]: With dead ends: 133 [2025-03-17 15:51:30,977 INFO L226 Difference]: Without dead ends: 132 [2025-03-17 15:51:30,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 683 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 15:51:30,977 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 21 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:51:30,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 654 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:51:30,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-17 15:51:30,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-03-17 15:51:30,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 63 states have internal predecessors, (68), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 15:51:30,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 202 transitions. [2025-03-17 15:51:30,988 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 202 transitions. Word has length 344 [2025-03-17 15:51:30,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:51:30,989 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 202 transitions. [2025-03-17 15:51:30,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 8 states have internal predecessors, (74), 6 states have call successors, (181), 1 states have call predecessors, (181), 2 states have return successors, (182), 6 states have call predecessors, (182), 6 states have call successors, (182) [2025-03-17 15:51:30,989 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 202 transitions. [2025-03-17 15:51:30,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-03-17 15:51:30,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:51:30,991 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:51:30,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 15:51:31,191 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-17 15:51:31,192 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-17 15:51:31,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:51:31,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1544927932, now seen corresponding path program 1 times [2025-03-17 15:51:31,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:51:31,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751013763] [2025-03-17 15:51:31,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:31,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:51:31,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-17 15:51:31,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-17 15:51:31,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:31,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:31,365 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 18 proven. 171 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-17 15:51:31,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:51:31,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751013763] [2025-03-17 15:51:31,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751013763] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:51:31,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921696077] [2025-03-17 15:51:31,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:31,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:51:31,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:51:31,368 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-17 15:51:31,370 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-17 15:51:31,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-17 15:51:31,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-17 15:51:31,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:31,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:31,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 15:51:31,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:51:31,647 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 18 proven. 171 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-17 15:51:31,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:51:31,890 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 18 proven. 171 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-17 15:51:31,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921696077] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:51:31,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:51:31,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-17 15:51:31,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013257900] [2025-03-17 15:51:31,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:51:31,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 15:51:31,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:51:31,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 15:51:31,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:51:31,892 INFO L87 Difference]: Start difference. First operand 132 states and 202 transitions. Second operand has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 4 states have call successors, (121), 1 states have call predecessors, (121), 2 states have return successors, (122), 4 states have call predecessors, (122), 4 states have call successors, (122) [2025-03-17 15:51:32,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:51:32,192 INFO L93 Difference]: Finished difference Result 132 states and 202 transitions. [2025-03-17 15:51:32,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:51:32,193 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 4 states have call successors, (121), 1 states have call predecessors, (121), 2 states have return successors, (122), 4 states have call predecessors, (122), 4 states have call successors, (122) Word has length 345 [2025-03-17 15:51:32,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:51:32,194 INFO L225 Difference]: With dead ends: 132 [2025-03-17 15:51:32,194 INFO L226 Difference]: Without dead ends: 131 [2025-03-17 15:51:32,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 693 GetRequests, 686 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-17 15:51:32,195 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 6 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:51:32,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 611 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:51:32,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-17 15:51:32,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-03-17 15:51:32,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 62 states have internal predecessors, (67), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 15:51:32,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 201 transitions. [2025-03-17 15:51:32,207 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 201 transitions. Word has length 345 [2025-03-17 15:51:32,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:51:32,208 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 201 transitions. [2025-03-17 15:51:32,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 4 states have call successors, (121), 1 states have call predecessors, (121), 2 states have return successors, (122), 4 states have call predecessors, (122), 4 states have call successors, (122) [2025-03-17 15:51:32,208 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 201 transitions. [2025-03-17 15:51:32,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-03-17 15:51:32,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:51:32,210 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:51:32,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 15:51:32,410 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-17 15:51:32,411 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-17 15:51:32,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:51:32,411 INFO L85 PathProgramCache]: Analyzing trace with hash 78492112, now seen corresponding path program 1 times [2025-03-17 15:51:32,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:51:32,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602684096] [2025-03-17 15:51:32,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:32,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:51:32,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-17 15:51:32,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-17 15:51:32,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:32,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:32,627 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 30 proven. 342 refuted. 0 times theorem prover too weak. 7692 trivial. 0 not checked. [2025-03-17 15:51:32,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:51:32,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602684096] [2025-03-17 15:51:32,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602684096] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:51:32,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966051900] [2025-03-17 15:51:32,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:32,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:51:32,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:51:32,630 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-17 15:51:32,632 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-17 15:51:32,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-17 15:51:32,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-17 15:51:32,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:32,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:32,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 15:51:32,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:51:32,915 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 12 proven. 177 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-17 15:51:32,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:51:33,169 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 12 proven. 177 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-17 15:51:33,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966051900] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:51:33,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:51:33,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-17 15:51:33,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682407594] [2025-03-17 15:51:33,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:51:33,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 15:51:33,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:51:33,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 15:51:33,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:51:33,172 INFO L87 Difference]: Start difference. First operand 131 states and 201 transitions. Second operand has 11 states, 10 states have (on average 8.3) internal successors, (83), 11 states have internal predecessors, (83), 5 states have call successors, (180), 1 states have call predecessors, (180), 2 states have return successors, (180), 5 states have call predecessors, (180), 5 states have call successors, (180) [2025-03-17 15:51:33,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:51:33,488 INFO L93 Difference]: Finished difference Result 131 states and 201 transitions. [2025-03-17 15:51:33,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:51:33,488 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.3) internal successors, (83), 11 states have internal predecessors, (83), 5 states have call successors, (180), 1 states have call predecessors, (180), 2 states have return successors, (180), 5 states have call predecessors, (180), 5 states have call successors, (180) Word has length 348 [2025-03-17 15:51:33,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:51:33,490 INFO L225 Difference]: With dead ends: 131 [2025-03-17 15:51:33,490 INFO L226 Difference]: Without dead ends: 130 [2025-03-17 15:51:33,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 703 GetRequests, 692 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:51:33,490 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 12 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:51:33,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 744 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:51:33,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-17 15:51:33,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-03-17 15:51:33,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 61 states have internal predecessors, (66), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 15:51:33,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 200 transitions. [2025-03-17 15:51:33,503 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 200 transitions. Word has length 348 [2025-03-17 15:51:33,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:51:33,504 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 200 transitions. [2025-03-17 15:51:33,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.3) internal successors, (83), 11 states have internal predecessors, (83), 5 states have call successors, (180), 1 states have call predecessors, (180), 2 states have return successors, (180), 5 states have call predecessors, (180), 5 states have call successors, (180) [2025-03-17 15:51:33,504 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 200 transitions. [2025-03-17 15:51:33,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-17 15:51:33,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:51:33,505 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:51:33,513 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-17 15:51:33,706 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-17 15:51:33,706 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-17 15:51:33,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:51:33,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1185097654, now seen corresponding path program 1 times [2025-03-17 15:51:33,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:51:33,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445227966] [2025-03-17 15:51:33,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:33,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:51:33,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-17 15:51:33,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-17 15:51:33,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:33,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:33,870 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 18 proven. 174 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-03-17 15:51:33,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:51:33,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445227966] [2025-03-17 15:51:33,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445227966] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:51:33,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895023299] [2025-03-17 15:51:33,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:33,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:51:33,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:51:33,873 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-17 15:51:33,874 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-17 15:51:33,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-17 15:51:33,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-17 15:51:33,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:33,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:33,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 15:51:33,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:51:34,259 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 270 proven. 462 refuted. 0 times theorem prover too weak. 7588 trivial. 0 not checked. [2025-03-17 15:51:34,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:51:34,616 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 270 proven. 462 refuted. 0 times theorem prover too weak. 7588 trivial. 0 not checked. [2025-03-17 15:51:34,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895023299] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:51:34,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:51:34,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 10] total 19 [2025-03-17 15:51:34,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768804037] [2025-03-17 15:51:34,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:51:34,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 15:51:34,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:51:34,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 15:51:34,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-03-17 15:51:34,619 INFO L87 Difference]: Start difference. First operand 130 states and 200 transitions. Second operand has 20 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 states have internal predecessors, (86), 11 states have call successors, (185), 1 states have call predecessors, (185), 2 states have return successors, (187), 11 states have call predecessors, (187), 11 states have call successors, (187) [2025-03-17 15:51:35,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:51:35,120 INFO L93 Difference]: Finished difference Result 134 states and 207 transitions. [2025-03-17 15:51:35,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 15:51:35,121 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 states have internal predecessors, (86), 11 states have call successors, (185), 1 states have call predecessors, (185), 2 states have return successors, (187), 11 states have call predecessors, (187), 11 states have call successors, (187) Word has length 353 [2025-03-17 15:51:35,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:51:35,123 INFO L225 Difference]: With dead ends: 134 [2025-03-17 15:51:35,123 INFO L226 Difference]: Without dead ends: 133 [2025-03-17 15:51:35,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 716 GetRequests, 691 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-17 15:51:35,124 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 81 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:51:35,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1043 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 15:51:35,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-17 15:51:35,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2025-03-17 15:51:35,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 60 states have internal predecessors, (65), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 15:51:35,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 199 transitions. [2025-03-17 15:51:35,137 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 199 transitions. Word has length 353 [2025-03-17 15:51:35,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:51:35,138 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 199 transitions. [2025-03-17 15:51:35,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 4.777777777777778) internal successors, (86), 17 states have internal predecessors, (86), 11 states have call successors, (185), 1 states have call predecessors, (185), 2 states have return successors, (187), 11 states have call predecessors, (187), 11 states have call successors, (187) [2025-03-17 15:51:35,138 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 199 transitions. [2025-03-17 15:51:35,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-17 15:51:35,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:51:35,139 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:51:35,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-17 15:51:35,344 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-17 15:51:35,344 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-17 15:51:35,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:51:35,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1916678387, now seen corresponding path program 1 times [2025-03-17 15:51:35,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:51:35,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81798834] [2025-03-17 15:51:35,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:35,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:51:35,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-17 15:51:35,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-17 15:51:35,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:35,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:35,660 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 261 proven. 297 refuted. 0 times theorem prover too weak. 7762 trivial. 0 not checked. [2025-03-17 15:51:35,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:51:35,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81798834] [2025-03-17 15:51:35,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81798834] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:51:35,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285602594] [2025-03-17 15:51:35,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:35,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:51:35,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:51:35,663 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-17 15:51:35,664 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-17 15:51:35,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-17 15:51:35,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-17 15:51:35,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:35,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:35,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 15:51:35,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:51:35,944 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 24 proven. 168 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-03-17 15:51:35,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:51:36,195 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 24 proven. 168 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-03-17 15:51:36,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285602594] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:51:36,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:51:36,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2025-03-17 15:51:36,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539005617] [2025-03-17 15:51:36,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:51:36,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 15:51:36,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:51:36,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 15:51:36,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-17 15:51:36,197 INFO L87 Difference]: Start difference. First operand 129 states and 199 transitions. Second operand has 14 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 states have internal predecessors, (88), 8 states have call successors, (182), 1 states have call predecessors, (182), 2 states have return successors, (183), 8 states have call predecessors, (183), 8 states have call successors, (183) [2025-03-17 15:51:36,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:51:36,582 INFO L93 Difference]: Finished difference Result 133 states and 205 transitions. [2025-03-17 15:51:36,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 15:51:36,582 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 states have internal predecessors, (88), 8 states have call successors, (182), 1 states have call predecessors, (182), 2 states have return successors, (183), 8 states have call predecessors, (183), 8 states have call successors, (183) Word has length 354 [2025-03-17 15:51:36,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:51:36,584 INFO L225 Difference]: With dead ends: 133 [2025-03-17 15:51:36,584 INFO L226 Difference]: Without dead ends: 132 [2025-03-17 15:51:36,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 726 GetRequests, 707 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2025-03-17 15:51:36,585 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 72 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:51:36,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 937 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:51:36,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-17 15:51:36,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2025-03-17 15:51:36,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 59 states have internal predecessors, (64), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 15:51:36,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 198 transitions. [2025-03-17 15:51:36,596 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 198 transitions. Word has length 354 [2025-03-17 15:51:36,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:51:36,596 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 198 transitions. [2025-03-17 15:51:36,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 states have internal predecessors, (88), 8 states have call successors, (182), 1 states have call predecessors, (182), 2 states have return successors, (183), 8 states have call predecessors, (183), 8 states have call successors, (183) [2025-03-17 15:51:36,597 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 198 transitions. [2025-03-17 15:51:36,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-03-17 15:51:36,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:51:36,608 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:51:36,614 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-17 15:51:36,812 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-17 15:51:36,812 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-17 15:51:36,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:51:36,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1824375123, now seen corresponding path program 1 times [2025-03-17 15:51:36,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:51:36,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490874852] [2025-03-17 15:51:36,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:36,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:51:36,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-03-17 15:51:36,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-03-17 15:51:36,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:36,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:36,944 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 18 proven. 174 refuted. 0 times theorem prover too weak. 8128 trivial. 0 not checked. [2025-03-17 15:51:36,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:51:36,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490874852] [2025-03-17 15:51:36,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490874852] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:51:36,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055220382] [2025-03-17 15:51:36,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:36,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:51:36,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:51:36,947 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-17 15:51:36,948 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-17 15:51:36,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-03-17 15:51:37,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-03-17 15:51:37,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:37,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:37,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 15:51:37,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:51:37,368 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 270 proven. 462 refuted. 0 times theorem prover too weak. 7588 trivial. 0 not checked. [2025-03-17 15:51:37,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:51:37,700 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 270 proven. 462 refuted. 0 times theorem prover too weak. 7588 trivial. 0 not checked. [2025-03-17 15:51:37,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055220382] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:51:37,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:51:37,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 20 [2025-03-17 15:51:37,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509444857] [2025-03-17 15:51:37,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:51:37,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 15:51:37,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:51:37,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 15:51:37,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-03-17 15:51:37,702 INFO L87 Difference]: Start difference. First operand 128 states and 198 transitions. Second operand has 21 states, 19 states have (on average 4.894736842105263) internal successors, (93), 20 states have internal predecessors, (93), 11 states have call successors, (185), 1 states have call predecessors, (185), 2 states have return successors, (187), 10 states have call predecessors, (187), 11 states have call successors, (187) [2025-03-17 15:51:38,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:51:38,230 INFO L93 Difference]: Finished difference Result 132 states and 203 transitions. [2025-03-17 15:51:38,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 15:51:38,231 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 4.894736842105263) internal successors, (93), 20 states have internal predecessors, (93), 11 states have call successors, (185), 1 states have call predecessors, (185), 2 states have return successors, (187), 10 states have call predecessors, (187), 11 states have call successors, (187) Word has length 357 [2025-03-17 15:51:38,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:51:38,232 INFO L225 Difference]: With dead ends: 132 [2025-03-17 15:51:38,232 INFO L226 Difference]: Without dead ends: 131 [2025-03-17 15:51:38,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 725 GetRequests, 698 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-17 15:51:38,233 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 85 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 15:51:38,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1127 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 15:51:38,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-17 15:51:38,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2025-03-17 15:51:38,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 58 states have internal predecessors, (63), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 15:51:38,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 197 transitions. [2025-03-17 15:51:38,243 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 197 transitions. Word has length 357 [2025-03-17 15:51:38,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:51:38,243 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 197 transitions. [2025-03-17 15:51:38,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 4.894736842105263) internal successors, (93), 20 states have internal predecessors, (93), 11 states have call successors, (185), 1 states have call predecessors, (185), 2 states have return successors, (187), 10 states have call predecessors, (187), 11 states have call successors, (187) [2025-03-17 15:51:38,244 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 197 transitions. [2025-03-17 15:51:38,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-03-17 15:51:38,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:51:38,245 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:51:38,252 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-17 15:51:38,445 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-17 15:51:38,446 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-17 15:51:38,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:51:38,447 INFO L85 PathProgramCache]: Analyzing trace with hash -236992513, now seen corresponding path program 1 times [2025-03-17 15:51:38,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:51:38,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069203900] [2025-03-17 15:51:38,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:38,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:51:38,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-03-17 15:51:38,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-03-17 15:51:38,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:38,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:38,578 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 24 proven. 171 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2025-03-17 15:51:38,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:51:38,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069203900] [2025-03-17 15:51:38,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069203900] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:51:38,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224595020] [2025-03-17 15:51:38,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:38,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:51:38,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:51:38,581 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-17 15:51:38,582 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-17 15:51:38,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-03-17 15:51:38,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-03-17 15:51:38,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:38,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:38,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 15:51:38,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:51:39,115 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 507 proven. 573 refuted. 0 times theorem prover too weak. 7500 trivial. 0 not checked. [2025-03-17 15:51:39,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:51:39,573 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 507 proven. 573 refuted. 0 times theorem prover too weak. 7500 trivial. 0 not checked. [2025-03-17 15:51:39,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224595020] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:51:39,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:51:39,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13, 15] total 28 [2025-03-17 15:51:39,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129582657] [2025-03-17 15:51:39,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:51:39,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-17 15:51:39,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:51:39,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 15:51:39,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2025-03-17 15:51:39,576 INFO L87 Difference]: Start difference. First operand 127 states and 197 transitions. Second operand has 29 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 15 states have call successors, (188), 1 states have call predecessors, (188), 2 states have return successors, (190), 15 states have call predecessors, (190), 15 states have call successors, (190) [2025-03-17 15:51:40,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:51:40,230 INFO L93 Difference]: Finished difference Result 135 states and 209 transitions. [2025-03-17 15:51:40,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 15:51:40,230 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 15 states have call successors, (188), 1 states have call predecessors, (188), 2 states have return successors, (190), 15 states have call predecessors, (190), 15 states have call successors, (190) Word has length 362 [2025-03-17 15:51:40,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:51:40,232 INFO L225 Difference]: With dead ends: 135 [2025-03-17 15:51:40,232 INFO L226 Difference]: Without dead ends: 134 [2025-03-17 15:51:40,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 700 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=262, Invalid=1378, Unknown=0, NotChecked=0, Total=1640 [2025-03-17 15:51:40,232 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 139 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 15:51:40,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1182 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 15:51:40,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-17 15:51:40,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 126. [2025-03-17 15:51:40,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 53 states have (on average 1.169811320754717) internal successors, (62), 57 states have internal predecessors, (62), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 15:51:40,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 196 transitions. [2025-03-17 15:51:40,243 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 196 transitions. Word has length 362 [2025-03-17 15:51:40,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:51:40,243 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 196 transitions. [2025-03-17 15:51:40,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 states have internal predecessors, (98), 15 states have call successors, (188), 1 states have call predecessors, (188), 2 states have return successors, (190), 15 states have call predecessors, (190), 15 states have call successors, (190) [2025-03-17 15:51:40,243 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 196 transitions. [2025-03-17 15:51:40,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-03-17 15:51:40,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:51:40,245 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:51:40,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-17 15:51:40,445 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-17 15:51:40,445 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-17 15:51:40,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:51:40,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1243166680, now seen corresponding path program 1 times [2025-03-17 15:51:40,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:51:40,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316832908] [2025-03-17 15:51:40,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:40,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:51:40,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-03-17 15:51:40,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-03-17 15:51:40,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:40,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:40,643 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 48 proven. 336 refuted. 0 times theorem prover too weak. 8196 trivial. 0 not checked. [2025-03-17 15:51:40,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:51:40,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316832908] [2025-03-17 15:51:40,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316832908] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:51:40,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888100609] [2025-03-17 15:51:40,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:40,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:51:40,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:51:40,646 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-17 15:51:40,647 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-17 15:51:40,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-03-17 15:51:40,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-03-17 15:51:40,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:40,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:40,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-03-17 15:51:40,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:51:42,840 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 1335 proven. 732 refuted. 0 times theorem prover too weak. 6513 trivial. 0 not checked. [2025-03-17 15:51:42,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:51:44,761 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 1335 proven. 732 refuted. 0 times theorem prover too weak. 6513 trivial. 0 not checked. [2025-03-17 15:51:44,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888100609] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:51:44,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:51:44,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 25, 29] total 55 [2025-03-17 15:51:44,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137615297] [2025-03-17 15:51:44,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:51:44,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-03-17 15:51:44,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:51:44,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-03-17 15:51:44,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=2819, Unknown=0, NotChecked=0, Total=3080 [2025-03-17 15:51:44,766 INFO L87 Difference]: Start difference. First operand 126 states and 196 transitions. Second operand has 56 states, 45 states have (on average 2.2444444444444445) internal successors, (101), 50 states have internal predecessors, (101), 31 states have call successors, (186), 1 states have call predecessors, (186), 2 states have return successors, (187), 31 states have call predecessors, (187), 31 states have call successors, (187) [2025-03-17 15:51:47,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:51:47,813 INFO L93 Difference]: Finished difference Result 156 states and 235 transitions. [2025-03-17 15:51:47,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-17 15:51:47,814 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 45 states have (on average 2.2444444444444445) internal successors, (101), 50 states have internal predecessors, (101), 31 states have call successors, (186), 1 states have call predecessors, (186), 2 states have return successors, (187), 31 states have call predecessors, (187), 31 states have call successors, (187) Word has length 363 [2025-03-17 15:51:47,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:51:47,815 INFO L225 Difference]: With dead ends: 156 [2025-03-17 15:51:47,815 INFO L226 Difference]: Without dead ends: 155 [2025-03-17 15:51:47,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 678 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1424 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=729, Invalid=6581, Unknown=0, NotChecked=0, Total=7310 [2025-03-17 15:51:47,817 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 166 mSDsluCounter, 2643 mSDsCounter, 0 mSdLazyCounter, 3637 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 2749 SdHoareTripleChecker+Invalid, 3851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 3637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 15:51:47,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 2749 Invalid, 3851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 3637 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 15:51:47,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-17 15:51:47,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 130. [2025-03-17 15:51:47,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 60 states have internal predecessors, (65), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 15:51:47,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 201 transitions. [2025-03-17 15:51:47,833 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 201 transitions. Word has length 363 [2025-03-17 15:51:47,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:51:47,833 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 201 transitions. [2025-03-17 15:51:47,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 45 states have (on average 2.2444444444444445) internal successors, (101), 50 states have internal predecessors, (101), 31 states have call successors, (186), 1 states have call predecessors, (186), 2 states have return successors, (187), 31 states have call predecessors, (187), 31 states have call successors, (187) [2025-03-17 15:51:47,834 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 201 transitions. [2025-03-17 15:51:47,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-03-17 15:51:47,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:51:47,835 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:51:47,846 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-17 15:51:48,045 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-17 15:51:48,046 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-17 15:51:48,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:51:48,046 INFO L85 PathProgramCache]: Analyzing trace with hash -353274981, now seen corresponding path program 1 times [2025-03-17 15:51:48,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:51:48,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577330581] [2025-03-17 15:51:48,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:48,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:51:48,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-17 15:51:48,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-17 15:51:48,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:48,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:48,173 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 30 proven. 165 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2025-03-17 15:51:48,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:51:48,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577330581] [2025-03-17 15:51:48,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577330581] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:51:48,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983772974] [2025-03-17 15:51:48,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:48,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:51:48,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:51:48,176 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-17 15:51:48,177 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-17 15:51:48,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-17 15:51:48,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-17 15:51:48,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:48,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:48,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 15:51:48,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:51:48,450 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 30 proven. 165 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2025-03-17 15:51:48,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:51:48,686 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 30 proven. 165 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2025-03-17 15:51:48,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983772974] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:51:48,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:51:48,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-17 15:51:48,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965083785] [2025-03-17 15:51:48,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:51:48,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 15:51:48,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:51:48,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 15:51:48,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:51:48,688 INFO L87 Difference]: Start difference. First operand 130 states and 201 transitions. Second operand has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (121), 1 states have call predecessors, (121), 2 states have return successors, (122), 4 states have call predecessors, (122), 4 states have call successors, (122) [2025-03-17 15:51:48,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:51:48,890 INFO L93 Difference]: Finished difference Result 130 states and 201 transitions. [2025-03-17 15:51:48,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:51:48,891 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (121), 1 states have call predecessors, (121), 2 states have return successors, (122), 4 states have call predecessors, (122), 4 states have call successors, (122) Word has length 365 [2025-03-17 15:51:48,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:51:48,892 INFO L225 Difference]: With dead ends: 130 [2025-03-17 15:51:48,892 INFO L226 Difference]: Without dead ends: 129 [2025-03-17 15:51:48,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 726 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-17 15:51:48,893 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 20 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:51:48,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 344 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:51:48,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-17 15:51:48,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2025-03-17 15:51:48,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 53 states have (on average 1.150943396226415) internal successors, (61), 56 states have internal predecessors, (61), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 15:51:48,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 195 transitions. [2025-03-17 15:51:48,909 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 195 transitions. Word has length 365 [2025-03-17 15:51:48,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:51:48,910 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 195 transitions. [2025-03-17 15:51:48,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (121), 1 states have call predecessors, (121), 2 states have return successors, (122), 4 states have call predecessors, (122), 4 states have call successors, (122) [2025-03-17 15:51:48,910 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 195 transitions. [2025-03-17 15:51:48,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-03-17 15:51:48,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:51:48,911 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:51:48,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-17 15:51:49,112 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-17 15:51:49,113 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-17 15:51:49,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:51:49,113 INFO L85 PathProgramCache]: Analyzing trace with hash -324439524, now seen corresponding path program 1 times [2025-03-17 15:51:49,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:51:49,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981211924] [2025-03-17 15:51:49,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:49,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:51:49,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-17 15:51:49,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-17 15:51:49,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:49,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:49,242 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 24 proven. 171 refuted. 0 times theorem prover too weak. 8385 trivial. 0 not checked. [2025-03-17 15:51:49,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:51:49,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981211924] [2025-03-17 15:51:49,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981211924] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:51:49,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142447798] [2025-03-17 15:51:49,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:49,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:51:49,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:51:49,245 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-17 15:51:49,246 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-17 15:51:49,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-17 15:51:49,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-17 15:51:49,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:49,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:49,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 15:51:49,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:51:49,619 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 291 proven. 453 refuted. 0 times theorem prover too weak. 7836 trivial. 0 not checked. [2025-03-17 15:51:49,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:51:49,953 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 291 proven. 453 refuted. 0 times theorem prover too weak. 7836 trivial. 0 not checked. [2025-03-17 15:51:49,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142447798] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:51:49,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:51:49,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 20 [2025-03-17 15:51:49,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992427644] [2025-03-17 15:51:49,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:51:49,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 15:51:49,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:51:49,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 15:51:49,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-03-17 15:51:49,955 INFO L87 Difference]: Start difference. First operand 125 states and 195 transitions. Second operand has 21 states, 19 states have (on average 5.421052631578948) internal successors, (103), 20 states have internal predecessors, (103), 11 states have call successors, (184), 1 states have call predecessors, (184), 2 states have return successors, (186), 10 states have call predecessors, (186), 11 states have call successors, (186) [2025-03-17 15:51:50,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:51:50,389 INFO L93 Difference]: Finished difference Result 129 states and 200 transitions. [2025-03-17 15:51:50,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 15:51:50,389 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 5.421052631578948) internal successors, (103), 20 states have internal predecessors, (103), 11 states have call successors, (184), 1 states have call predecessors, (184), 2 states have return successors, (186), 10 states have call predecessors, (186), 11 states have call successors, (186) Word has length 366 [2025-03-17 15:51:50,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:51:50,390 INFO L225 Difference]: With dead ends: 129 [2025-03-17 15:51:50,390 INFO L226 Difference]: Without dead ends: 128 [2025-03-17 15:51:50,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 743 GetRequests, 716 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-17 15:51:50,391 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 118 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:51:50,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1055 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:51:50,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-17 15:51:50,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2025-03-17 15:51:50,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 55 states have internal predecessors, (60), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 15:51:50,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 194 transitions. [2025-03-17 15:51:50,406 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 194 transitions. Word has length 366 [2025-03-17 15:51:50,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:51:50,406 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 194 transitions. [2025-03-17 15:51:50,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 5.421052631578948) internal successors, (103), 20 states have internal predecessors, (103), 11 states have call successors, (184), 1 states have call predecessors, (184), 2 states have return successors, (186), 10 states have call predecessors, (186), 11 states have call successors, (186) [2025-03-17 15:51:50,406 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 194 transitions. [2025-03-17 15:51:50,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-03-17 15:51:50,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:51:50,408 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:51:50,415 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-17 15:51:50,608 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-17 15:51:50,608 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-17 15:51:50,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:51:50,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1775280834, now seen corresponding path program 1 times [2025-03-17 15:51:50,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:51:50,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320310019] [2025-03-17 15:51:50,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:50,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:51:50,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-17 15:51:50,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-17 15:51:50,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:50,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:50,775 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 30 proven. 168 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-03-17 15:51:50,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:51:50,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320310019] [2025-03-17 15:51:50,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320310019] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:51:50,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183154314] [2025-03-17 15:51:50,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:50,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:51:50,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:51:50,778 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-17 15:51:50,778 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-17 15:51:50,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-17 15:51:50,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-17 15:51:50,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:50,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:50,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 15:51:50,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:51:51,149 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 312 proven. 444 refuted. 0 times theorem prover too weak. 8088 trivial. 0 not checked. [2025-03-17 15:51:51,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:51:51,431 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 312 proven. 444 refuted. 0 times theorem prover too weak. 8088 trivial. 0 not checked. [2025-03-17 15:51:51,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183154314] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:51:51,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:51:51,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 10] total 19 [2025-03-17 15:51:51,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555632774] [2025-03-17 15:51:51,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:51:51,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 15:51:51,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:51:51,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 15:51:51,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-03-17 15:51:51,433 INFO L87 Difference]: Start difference. First operand 124 states and 194 transitions. Second operand has 20 states, 18 states have (on average 5.888888888888889) internal successors, (106), 17 states have internal predecessors, (106), 11 states have call successors, (183), 1 states have call predecessors, (183), 2 states have return successors, (185), 11 states have call predecessors, (185), 11 states have call successors, (185) [2025-03-17 15:51:51,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:51:51,879 INFO L93 Difference]: Finished difference Result 128 states and 201 transitions. [2025-03-17 15:51:51,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 15:51:51,880 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 5.888888888888889) internal successors, (106), 17 states have internal predecessors, (106), 11 states have call successors, (183), 1 states have call predecessors, (183), 2 states have return successors, (185), 11 states have call predecessors, (185), 11 states have call successors, (185) Word has length 371 [2025-03-17 15:51:51,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:51:51,881 INFO L225 Difference]: With dead ends: 128 [2025-03-17 15:51:51,881 INFO L226 Difference]: Without dead ends: 127 [2025-03-17 15:51:51,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 727 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-17 15:51:51,882 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 165 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:51:51,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 972 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 15:51:51,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-17 15:51:51,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2025-03-17 15:51:51,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 54 states have internal predecessors, (59), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 15:51:51,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 193 transitions. [2025-03-17 15:51:51,900 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 193 transitions. Word has length 371 [2025-03-17 15:51:51,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:51:51,900 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 193 transitions. [2025-03-17 15:51:51,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 5.888888888888889) internal successors, (106), 17 states have internal predecessors, (106), 11 states have call successors, (183), 1 states have call predecessors, (183), 2 states have return successors, (185), 11 states have call predecessors, (185), 11 states have call successors, (185) [2025-03-17 15:51:51,900 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 193 transitions. [2025-03-17 15:51:51,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-03-17 15:51:51,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:51:51,902 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:51:51,909 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-17 15:51:52,106 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-17 15:51:52,106 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-17 15:51:52,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:51:52,106 INFO L85 PathProgramCache]: Analyzing trace with hash -800869015, now seen corresponding path program 1 times [2025-03-17 15:51:52,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:51:52,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97292739] [2025-03-17 15:51:52,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:52,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:51:52,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-17 15:51:52,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-17 15:51:52,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:52,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:52,232 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 36 proven. 162 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-03-17 15:51:52,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:51:52,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97292739] [2025-03-17 15:51:52,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97292739] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:51:52,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903087282] [2025-03-17 15:51:52,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:52,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:51:52,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:51:52,234 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-17 15:51:52,236 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-17 15:51:52,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-17 15:51:52,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-17 15:51:52,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:52,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:52,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 15:51:52,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:51:52,490 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 36 proven. 162 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-03-17 15:51:52,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:51:52,710 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 36 proven. 162 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-03-17 15:51:52,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903087282] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:51:52,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:51:52,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-17 15:51:52,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917335767] [2025-03-17 15:51:52,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:51:52,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 15:51:52,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:51:52,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 15:51:52,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:51:52,711 INFO L87 Difference]: Start difference. First operand 123 states and 193 transitions. Second operand has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 4 states have call successors, (121), 1 states have call predecessors, (121), 2 states have return successors, (122), 4 states have call predecessors, (122), 4 states have call successors, (122) [2025-03-17 15:51:52,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:51:52,914 INFO L93 Difference]: Finished difference Result 123 states and 193 transitions. [2025-03-17 15:51:52,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:51:52,915 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 4 states have call successors, (121), 1 states have call predecessors, (121), 2 states have return successors, (122), 4 states have call predecessors, (122), 4 states have call successors, (122) Word has length 372 [2025-03-17 15:51:52,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:51:52,916 INFO L225 Difference]: With dead ends: 123 [2025-03-17 15:51:52,916 INFO L226 Difference]: Without dead ends: 122 [2025-03-17 15:51:52,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 747 GetRequests, 740 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-17 15:51:52,917 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 15 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:51:52,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 451 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:51:52,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-17 15:51:52,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-17 15:51:52,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 states have internal predecessors, (58), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 15:51:52,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 192 transitions. [2025-03-17 15:51:52,942 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 192 transitions. Word has length 372 [2025-03-17 15:51:52,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:51:52,942 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 192 transitions. [2025-03-17 15:51:52,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 4 states have call successors, (121), 1 states have call predecessors, (121), 2 states have return successors, (122), 4 states have call predecessors, (122), 4 states have call successors, (122) [2025-03-17 15:51:52,942 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 192 transitions. [2025-03-17 15:51:52,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-03-17 15:51:52,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:51:52,944 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:51:52,951 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-17 15:51:53,144 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-17 15:51:53,145 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-17 15:51:53,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:51:53,145 INFO L85 PathProgramCache]: Analyzing trace with hash -145518497, now seen corresponding path program 1 times [2025-03-17 15:51:53,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:51:53,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131773075] [2025-03-17 15:51:53,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:53,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:51:53,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-03-17 15:51:53,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-03-17 15:51:53,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:53,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:53,322 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 66 proven. 324 refuted. 0 times theorem prover too weak. 8454 trivial. 0 not checked. [2025-03-17 15:51:53,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:51:53,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131773075] [2025-03-17 15:51:53,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131773075] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:51:53,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577486282] [2025-03-17 15:51:53,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:53,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:51:53,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:51:53,324 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-17 15:51:53,325 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-17 15:51:53,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-03-17 15:51:53,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-03-17 15:51:53,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:53,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:53,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-17 15:51:53,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:51:53,852 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 537 proven. 561 refuted. 0 times theorem prover too weak. 7746 trivial. 0 not checked. [2025-03-17 15:51:53,852 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:51:54,267 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 537 proven. 561 refuted. 0 times theorem prover too weak. 7746 trivial. 0 not checked. [2025-03-17 15:51:54,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577486282] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:51:54,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:51:54,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 14, 16] total 31 [2025-03-17 15:51:54,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097784920] [2025-03-17 15:51:54,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:51:54,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-17 15:51:54,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:51:54,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-17 15:51:54,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2025-03-17 15:51:54,269 INFO L87 Difference]: Start difference. First operand 122 states and 192 transitions. Second operand has 32 states, 29 states have (on average 4.137931034482759) internal successors, (120), 32 states have internal predecessors, (120), 15 states have call successors, (187), 1 states have call predecessors, (187), 2 states have return successors, (189), 15 states have call predecessors, (189), 15 states have call successors, (189) [2025-03-17 15:51:55,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:51:55,103 INFO L93 Difference]: Finished difference Result 130 states and 202 transitions. [2025-03-17 15:51:55,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 15:51:55,104 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 4.137931034482759) internal successors, (120), 32 states have internal predecessors, (120), 15 states have call successors, (187), 1 states have call predecessors, (187), 2 states have return successors, (189), 15 states have call predecessors, (189), 15 states have call successors, (189) Word has length 375 [2025-03-17 15:51:55,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:51:55,105 INFO L225 Difference]: With dead ends: 130 [2025-03-17 15:51:55,105 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 15:51:55,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 726 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=269, Invalid=1623, Unknown=0, NotChecked=0, Total=1892 [2025-03-17 15:51:55,106 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 192 mSDsluCounter, 1573 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 1868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 15:51:55,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 1678 Invalid, 1868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 15:51:55,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 15:51:55,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 15:51:55,107 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-17 15:51:55,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 15:51:55,107 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 375 [2025-03-17 15:51:55,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:51:55,107 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 15:51:55,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 4.137931034482759) internal successors, (120), 32 states have internal predecessors, (120), 15 states have call successors, (187), 1 states have call predecessors, (187), 2 states have return successors, (189), 15 states have call predecessors, (189), 15 states have call successors, (189) [2025-03-17 15:51:55,107 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 15:51:55,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 15:51:55,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2025-03-17 15:51:55,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2025-03-17 15:51:55,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2025-03-17 15:51:55,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2025-03-17 15:51:55,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2025-03-17 15:51:55,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2025-03-17 15:51:55,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2025-03-17 15:51:55,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2025-03-17 15:51:55,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2025-03-17 15:51:55,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2025-03-17 15:51:55,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2025-03-17 15:51:55,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2025-03-17 15:51:55,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2025-03-17 15:51:55,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2025-03-17 15:51:55,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2025-03-17 15:51:55,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2025-03-17 15:51:55,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2025-03-17 15:51:55,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2025-03-17 15:51:55,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2025-03-17 15:51:55,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2025-03-17 15:51:55,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2025-03-17 15:51:55,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2025-03-17 15:51:55,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2025-03-17 15:51:55,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2025-03-17 15:51:55,118 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-17 15:51:55,311 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-17 15:51:55,314 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] [2025-03-17 15:51:55,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 15:51:58,451 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 15:51:58,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:51:58 BoogieIcfgContainer [2025-03-17 15:51:58,457 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 15:51:58,457 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 15:51:58,457 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 15:51:58,458 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 15:51:58,458 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:51:18" (3/4) ... [2025-03-17 15:51:58,459 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 15:51:58,465 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume [2025-03-17 15:51:58,470 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-17 15:51:58,471 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 15:51:58,471 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 15:51:58,471 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 15:51:58,556 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 15:51:58,556 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 15:51:58,556 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 15:51:58,557 INFO L158 Benchmark]: Toolchain (without parser) took 40962.37ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 113.8MB in the beginning and 372.2MB in the end (delta: -258.4MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2025-03-17 15:51:58,557 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:51:58,557 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.93ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 101.7MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:51:58,557 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.13ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 99.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:51:58,557 INFO L158 Benchmark]: Boogie Preprocessor took 32.41ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 98.2MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:51:58,557 INFO L158 Benchmark]: IcfgBuilder took 364.35ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 76.1MB in the end (delta: 22.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 15:51:58,557 INFO L158 Benchmark]: TraceAbstraction took 40226.19ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 75.6MB in the beginning and 380.4MB in the end (delta: -304.7MB). Peak memory consumption was 220.6MB. Max. memory is 16.1GB. [2025-03-17 15:51:58,558 INFO L158 Benchmark]: Witness Printer took 98.72ms. Allocated memory is still 419.4MB. Free memory was 380.4MB in the beginning and 372.2MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:51:58,559 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.93ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 101.7MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.13ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 99.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.41ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 98.2MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 364.35ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 76.1MB in the end (delta: 22.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 40226.19ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 75.6MB in the beginning and 380.4MB in the end (delta: -304.7MB). Peak memory consumption was 220.6MB. Max. memory is 16.1GB. * Witness Printer took 98.72ms. Allocated memory is still 419.4MB. Free memory was 380.4MB in the beginning and 372.2MB in the end (delta: 8.1MB). 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: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 133]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 130]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 130]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 129]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 129]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 127]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 127]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 126]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 126]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 124]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 124]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 123]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 123]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 121]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 121]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 120]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 120]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 118]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 118]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 117]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 117]: 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, 150 locations, 291 edges, 24 error locations. Started 1 CEGAR loops. OverallTime: 37.0s, OverallIterations: 21, TraceHistogramMax: 67, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1203 SdHoareTripleChecker+Valid, 8.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1203 mSDsluCounter, 19081 SdHoareTripleChecker+Invalid, 6.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16353 mSDsCounter, 1202 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16376 IncrementalHoareTripleChecker+Invalid, 17578 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1202 mSolverCounterUnsat, 2728 mSDtfsCounter, 16376 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13860 GetRequests, 13436 SyntacticMatches, 12 SemanticMatches, 412 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2564 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=150occurred in iteration=0, InterpolantAutomatonStates: 225, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 65 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 18.6s InterpolantComputationTime, 14317 NumberOfCodeBlocks, 14317 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 20925 ConstructedInterpolants, 0 QuantifiedInterpolants, 51991 SizeOfPredicates, 75 NumberOfNonLiveVariables, 13147 ConjunctsInSsa, 374 ConjunctsInUnsatCore, 60 InterpolantComputations, 2 PerfectInterpolantSequences, 473947/491088 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 24 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 15:51:58,577 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