./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 e2fb8bed 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-?-e2fb8be-m [2025-03-09 02:48:19,201 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:48:19,251 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:48:19,254 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:48:19,254 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:48:19,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:48:19,272 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:48:19,272 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:48:19,272 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:48:19,272 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:48:19,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:48:19,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:48:19,272 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:48:19,272 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:48:19,272 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:48:19,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:48:19,274 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:48:19,274 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:48:19,274 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:48:19,274 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:48:19,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:48:19,275 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:48:19,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:48:19,275 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:48:19,275 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:48:19,275 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:48:19,275 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:48:19,275 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:48:19,275 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:48:19,275 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:48:19,276 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:48:19,276 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:48:19,276 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:48:19,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:48:19,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:48:19,276 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:48:19,276 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:48:19,276 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:48:19,276 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:48:19,277 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:48:19,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:48:19,277 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:48:19,277 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:48:19,277 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:48:19,277 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:48:19,277 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-09 02:48:19,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:48:19,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:48:19,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:48:19,503 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:48:19,504 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:48:19,506 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-09 02:48:20,630 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf7f3dfc4/84e0ffda5e1644cebd2a9db03ebbb21c/FLAG46adc9790 [2025-03-09 02:48:20,847 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:48:20,848 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/xcsp/AllInterval-007.c [2025-03-09 02:48:20,854 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf7f3dfc4/84e0ffda5e1644cebd2a9db03ebbb21c/FLAG46adc9790 [2025-03-09 02:48:21,202 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf7f3dfc4/84e0ffda5e1644cebd2a9db03ebbb21c [2025-03-09 02:48:21,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:48:21,204 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:48:21,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:48:21,206 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:48:21,208 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:48:21,209 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:48:21" (1/1) ... [2025-03-09 02:48:21,210 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b9cecc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:21, skipping insertion in model container [2025-03-09 02:48:21,210 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:48:21" (1/1) ... [2025-03-09 02:48:21,219 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:48:21,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:48:21,324 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:48:21,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:48:21,368 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:48:21,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:21 WrapperNode [2025-03-09 02:48:21,369 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:48:21,370 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:48:21,370 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:48:21,370 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:48:21,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:21" (1/1) ... [2025-03-09 02:48:21,379 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:21" (1/1) ... [2025-03-09 02:48:21,394 INFO L138 Inliner]: procedures = 13, calls = 76, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 211 [2025-03-09 02:48:21,394 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:48:21,395 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:48:21,395 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:48:21,395 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:48:21,400 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:21" (1/1) ... [2025-03-09 02:48:21,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:21" (1/1) ... [2025-03-09 02:48:21,402 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:21" (1/1) ... [2025-03-09 02:48:21,410 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-09 02:48:21,411 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:21" (1/1) ... [2025-03-09 02:48:21,411 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:21" (1/1) ... [2025-03-09 02:48:21,414 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:21" (1/1) ... [2025-03-09 02:48:21,415 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:21" (1/1) ... [2025-03-09 02:48:21,416 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:21" (1/1) ... [2025-03-09 02:48:21,416 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:21" (1/1) ... [2025-03-09 02:48:21,418 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:48:21,418 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:48:21,418 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:48:21,418 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:48:21,419 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:21" (1/1) ... [2025-03-09 02:48:21,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:48:21,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:21,448 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-09 02:48:21,449 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-09 02:48:21,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:48:21,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:48:21,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:48:21,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:48:21,468 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2025-03-09 02:48:21,468 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2025-03-09 02:48:21,524 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:48:21,525 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:48:21,770 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2025-03-09 02:48:21,771 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:48:21,780 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:48:21,780 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:48:21,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:48:21 BoogieIcfgContainer [2025-03-09 02:48:21,783 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:48:21,785 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:48:21,785 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:48:21,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:48:21,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:48:21" (1/3) ... [2025-03-09 02:48:21,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@149ef5f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:48:21, skipping insertion in model container [2025-03-09 02:48:21,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:21" (2/3) ... [2025-03-09 02:48:21,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@149ef5f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:48:21, skipping insertion in model container [2025-03-09 02:48:21,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:48:21" (3/3) ... [2025-03-09 02:48:21,792 INFO L128 eAbstractionObserver]: Analyzing ICFG AllInterval-007.c [2025-03-09 02:48:21,804 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:48:21,809 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG AllInterval-007.c that has 2 procedures, 153 locations, 1 initial locations, 0 loop locations, and 24 error locations. [2025-03-09 02:48:21,866 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:48:21,877 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;@46124e12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:48:21,878 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-03-09 02:48:21,881 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 83 states have internal predecessors, (90), 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-09 02:48:21,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-03-09 02:48:21,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:21,898 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-09 02:48:21,898 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-09 02:48:21,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:21,904 INFO L85 PathProgramCache]: Analyzing trace with hash -76087298, now seen corresponding path program 1 times [2025-03-09 02:48:21,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:21,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415062382] [2025-03-09 02:48:21,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:21,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:21,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-03-09 02:48:22,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-03-09 02:48:22,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:22,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:22,191 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-09 02:48:22,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:22,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415062382] [2025-03-09 02:48:22,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415062382] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:22,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362933389] [2025-03-09 02:48:22,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:22,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:22,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:22,199 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-09 02:48:22,203 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-09 02:48:22,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-03-09 02:48:22,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-03-09 02:48:22,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:22,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:22,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-09 02:48:22,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:22,461 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-09 02:48:22,461 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:48:22,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362933389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:22,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:48:22,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-09 02:48:22,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291476371] [2025-03-09 02:48:22,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:22,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 02:48:22,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:22,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 02:48:22,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 02:48:22,486 INFO L87 Difference]: Start difference. First operand has 153 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 83 states have internal predecessors, (90), 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 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-09 02:48:22,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:22,528 INFO L93 Difference]: Finished difference Result 299 states and 513 transitions. [2025-03-09 02:48:22,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 02:48:22,529 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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 327 [2025-03-09 02:48:22,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:22,533 INFO L225 Difference]: With dead ends: 299 [2025-03-09 02:48:22,534 INFO L226 Difference]: Without dead ends: 146 [2025-03-09 02:48:22,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 328 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-09 02:48:22,538 INFO L435 NwaCegarLoop]: 221 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, 221 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-09 02:48:22,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:48:22,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-09 02:48:22,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2025-03-09 02:48:22,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 77 states have internal predecessors, (82), 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-09 02:48:22,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 216 transitions. [2025-03-09 02:48:22,592 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 216 transitions. Word has length 327 [2025-03-09 02:48:22,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:22,593 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 216 transitions. [2025-03-09 02:48:22,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-09 02:48:22,594 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 216 transitions. [2025-03-09 02:48:22,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-03-09 02:48:22,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:22,600 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-09 02:48:22,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 02:48:22,801 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-09 02:48:22,801 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-09 02:48:22,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:22,802 INFO L85 PathProgramCache]: Analyzing trace with hash -312781154, now seen corresponding path program 1 times [2025-03-09 02:48:22,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:22,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825725051] [2025-03-09 02:48:22,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:22,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:22,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-03-09 02:48:22,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-03-09 02:48:22,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:22,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:23,495 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-09 02:48:23,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:23,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825725051] [2025-03-09 02:48:23,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825725051] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:23,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684465567] [2025-03-09 02:48:23,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:23,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:23,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:23,500 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-09 02:48:23,501 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-09 02:48:23,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-03-09 02:48:23,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-03-09 02:48:23,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:23,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:23,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 02:48:23,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:24,048 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-09 02:48:24,048 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:24,458 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-09 02:48:24,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684465567] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:24,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:24,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-09 02:48:24,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785987378] [2025-03-09 02:48:24,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:24,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 02:48:24,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:24,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 02:48:24,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:48:24,462 INFO L87 Difference]: Start difference. First operand 146 states and 216 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 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-09 02:48:24,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:24,889 INFO L93 Difference]: Finished difference Result 146 states and 216 transitions. [2025-03-09 02:48:24,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:48:24,890 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 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 327 [2025-03-09 02:48:24,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:24,892 INFO L225 Difference]: With dead ends: 146 [2025-03-09 02:48:24,893 INFO L226 Difference]: Without dead ends: 145 [2025-03-09 02:48:24,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 651 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-09 02:48:24,895 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 2 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 878 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.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:24,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 878 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:48:24,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-09 02:48:24,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2025-03-09 02:48:24,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 54 states have (on average 1.5) 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-09 02:48:24,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 215 transitions. [2025-03-09 02:48:24,920 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 215 transitions. Word has length 327 [2025-03-09 02:48:24,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:24,921 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 215 transitions. [2025-03-09 02:48:24,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 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-09 02:48:24,923 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 215 transitions. [2025-03-09 02:48:24,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-09 02:48:24,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:24,926 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] [2025-03-09 02:48:24,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 02:48:25,130 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-09 02:48:25,130 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-09 02:48:25,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:25,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1106281140, now seen corresponding path program 1 times [2025-03-09 02:48:25,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:25,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822401582] [2025-03-09 02:48:25,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:25,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:25,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-09 02:48:25,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-09 02:48:25,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:25,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:25,385 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-09 02:48:25,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:25,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822401582] [2025-03-09 02:48:25,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822401582] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:25,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90773227] [2025-03-09 02:48:25,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:25,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:25,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:25,389 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-09 02:48:25,398 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-09 02:48:25,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-09 02:48:25,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-09 02:48:25,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:25,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:25,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 02:48:25,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:25,765 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-09 02:48:25,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:26,047 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-09 02:48:26,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90773227] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:26,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:26,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-09 02:48:26,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726061048] [2025-03-09 02:48:26,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:26,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 02:48:26,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:26,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 02:48:26,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:48:26,050 INFO L87 Difference]: Start difference. First operand 145 states and 215 transitions. Second operand has 10 states, 8 states have (on average 7.125) internal successors, (57), 10 states have internal predecessors, (57), 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-09 02:48:26,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:26,386 INFO L93 Difference]: Finished difference Result 145 states and 215 transitions. [2025-03-09 02:48:26,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:48:26,387 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.125) internal successors, (57), 10 states have internal predecessors, (57), 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 328 [2025-03-09 02:48:26,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:26,392 INFO L225 Difference]: With dead ends: 145 [2025-03-09 02:48:26,392 INFO L226 Difference]: Without dead ends: 144 [2025-03-09 02:48:26,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 651 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-09 02:48:26,393 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:26,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 874 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:48:26,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-09 02:48:26,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-03-09 02:48:26,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 54 states have (on average 1.4814814814814814) 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-09 02:48:26,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 214 transitions. [2025-03-09 02:48:26,419 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 214 transitions. Word has length 328 [2025-03-09 02:48:26,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:26,420 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 214 transitions. [2025-03-09 02:48:26,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.125) internal successors, (57), 10 states have internal predecessors, (57), 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-09 02:48:26,420 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 214 transitions. [2025-03-09 02:48:26,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-03-09 02:48:26,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:26,424 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-09 02:48:26,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 02:48:26,624 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-09 02:48:26,625 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-09 02:48:26,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:26,626 INFO L85 PathProgramCache]: Analyzing trace with hash 2015715178, now seen corresponding path program 1 times [2025-03-09 02:48:26,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:26,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116214120] [2025-03-09 02:48:26,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:26,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:26,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-03-09 02:48:26,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-03-09 02:48:26,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:26,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:26,745 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-09 02:48:26,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:26,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116214120] [2025-03-09 02:48:26,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116214120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:26,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:26,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:48:26,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534797289] [2025-03-09 02:48:26,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:26,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:48:26,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:26,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:48:26,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:48:26,747 INFO L87 Difference]: Start difference. First operand 144 states and 214 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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-09 02:48:26,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:26,798 INFO L93 Difference]: Finished difference Result 144 states and 214 transitions. [2025-03-09 02:48:26,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:48:26,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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 330 [2025-03-09 02:48:26,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:26,800 INFO L225 Difference]: With dead ends: 144 [2025-03-09 02:48:26,800 INFO L226 Difference]: Without dead ends: 138 [2025-03-09 02:48:26,801 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-09 02:48:26,801 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 6 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 358 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-09 02:48:26,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 358 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:48:26,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-09 02:48:26,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-03-09 02:48:26,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 69 states have internal predecessors, (74), 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-09 02:48:26,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 208 transitions. [2025-03-09 02:48:26,821 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 208 transitions. Word has length 330 [2025-03-09 02:48:26,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:26,822 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 208 transitions. [2025-03-09 02:48:26,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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-09 02:48:26,822 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 208 transitions. [2025-03-09 02:48:26,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-03-09 02:48:26,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:26,825 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, 1] [2025-03-09 02:48:26,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:48:26,826 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-09 02:48:26,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:26,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1937338885, now seen corresponding path program 1 times [2025-03-09 02:48:26,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:26,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601108362] [2025-03-09 02:48:26,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:26,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:26,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-03-09 02:48:26,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-03-09 02:48:26,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:26,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:27,134 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-09 02:48:27,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:27,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601108362] [2025-03-09 02:48:27,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601108362] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:27,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593607377] [2025-03-09 02:48:27,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:27,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:27,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:27,138 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-09 02:48:27,139 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-09 02:48:27,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-03-09 02:48:27,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-03-09 02:48:27,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:27,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:27,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:48:27,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:27,471 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-09 02:48:27,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:27,776 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-09 02:48:27,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593607377] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:27,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:27,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-09 02:48:27,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455844737] [2025-03-09 02:48:27,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:27,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 02:48:27,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:27,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 02:48:27,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:48:27,778 INFO L87 Difference]: Start difference. First operand 138 states and 208 transitions. Second operand has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 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-09 02:48:28,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:28,104 INFO L93 Difference]: Finished difference Result 138 states and 208 transitions. [2025-03-09 02:48:28,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:48:28,105 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 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 331 [2025-03-09 02:48:28,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:28,107 INFO L225 Difference]: With dead ends: 138 [2025-03-09 02:48:28,107 INFO L226 Difference]: Without dead ends: 137 [2025-03-09 02:48:28,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 658 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:48:28,107 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:28,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 854 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:48:28,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-09 02:48:28,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-03-09 02:48:28,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 54 states have (on average 1.3518518518518519) 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-09 02:48:28,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 207 transitions. [2025-03-09 02:48:28,123 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 207 transitions. Word has length 331 [2025-03-09 02:48:28,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:28,124 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 207 transitions. [2025-03-09 02:48:28,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 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-09 02:48:28,124 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 207 transitions. [2025-03-09 02:48:28,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-03-09 02:48:28,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:28,126 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-09 02:48:28,136 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-09 02:48:28,326 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-09 02:48:28,327 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-09 02:48:28,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:28,327 INFO L85 PathProgramCache]: Analyzing trace with hash 2032294453, now seen corresponding path program 1 times [2025-03-09 02:48:28,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:28,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706272629] [2025-03-09 02:48:28,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:28,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:28,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-03-09 02:48:28,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-03-09 02:48:28,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:28,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:28,548 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-09 02:48:28,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:28,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706272629] [2025-03-09 02:48:28,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706272629] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:28,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455457746] [2025-03-09 02:48:28,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:28,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:28,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:28,550 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-09 02:48:28,552 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-09 02:48:28,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-03-09 02:48:28,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-03-09 02:48:28,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:28,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:28,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-09 02:48:28,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:29,018 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-09 02:48:29,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:29,406 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-09 02:48:29,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455457746] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:29,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:29,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 10] total 19 [2025-03-09 02:48:29,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760165016] [2025-03-09 02:48:29,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:29,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 02:48:29,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:29,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 02:48:29,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-03-09 02:48:29,410 INFO L87 Difference]: Start difference. First operand 137 states and 207 transitions. Second operand has 20 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 states have internal predecessors, (67), 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-09 02:48:30,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:30,014 INFO L93 Difference]: Finished difference Result 141 states and 214 transitions. [2025-03-09 02:48:30,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 02:48:30,015 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 states have internal predecessors, (67), 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 336 [2025-03-09 02:48:30,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:30,018 INFO L225 Difference]: With dead ends: 141 [2025-03-09 02:48:30,018 INFO L226 Difference]: Without dead ends: 140 [2025-03-09 02:48:30,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 657 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-09 02:48:30,019 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 34 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1350 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:30,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1350 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 02:48:30,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-09 02:48:30,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2025-03-09 02:48:30,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 54 states have (on average 1.3333333333333333) 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-09 02:48:30,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 206 transitions. [2025-03-09 02:48:30,037 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 206 transitions. Word has length 336 [2025-03-09 02:48:30,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:30,038 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 206 transitions. [2025-03-09 02:48:30,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 states have internal predecessors, (67), 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-09 02:48:30,039 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 206 transitions. [2025-03-09 02:48:30,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-03-09 02:48:30,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:30,041 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] [2025-03-09 02:48:30,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 02:48:30,241 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-09 02:48:30,242 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-09 02:48:30,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:30,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1423381367, now seen corresponding path program 1 times [2025-03-09 02:48:30,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:30,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536955890] [2025-03-09 02:48:30,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:30,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:30,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-03-09 02:48:30,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-03-09 02:48:30,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:30,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:30,440 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-09 02:48:30,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:30,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536955890] [2025-03-09 02:48:30,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536955890] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:30,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588271635] [2025-03-09 02:48:30,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:30,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:30,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:30,446 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-09 02:48:30,447 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-09 02:48:30,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-03-09 02:48:30,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-03-09 02:48:30,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:30,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:30,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 02:48:30,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:30,761 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-09 02:48:30,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:31,019 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-09 02:48:31,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588271635] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:31,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:31,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-09 02:48:31,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779307525] [2025-03-09 02:48:31,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:31,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:48:31,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:31,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:48:31,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:48:31,022 INFO L87 Difference]: Start difference. First operand 136 states and 206 transitions. Second operand has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 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-09 02:48:31,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:31,215 INFO L93 Difference]: Finished difference Result 136 states and 206 transitions. [2025-03-09 02:48:31,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:48:31,215 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 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 337 [2025-03-09 02:48:31,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:31,217 INFO L225 Difference]: With dead ends: 136 [2025-03-09 02:48:31,217 INFO L226 Difference]: Without dead ends: 135 [2025-03-09 02:48:31,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 677 GetRequests, 670 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-09 02:48:31,218 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 9 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:31,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 420 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:48:31,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-09 02:48:31,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-03-09 02:48:31,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 54 states have (on average 1.3148148148148149) 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-09 02:48:31,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 205 transitions. [2025-03-09 02:48:31,234 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 205 transitions. Word has length 337 [2025-03-09 02:48:31,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:31,235 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 205 transitions. [2025-03-09 02:48:31,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 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-09 02:48:31,235 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 205 transitions. [2025-03-09 02:48:31,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-09 02:48:31,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:31,237 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, 1] [2025-03-09 02:48:31,243 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-09 02:48:31,437 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-09 02:48:31,437 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-09 02:48:31,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:31,438 INFO L85 PathProgramCache]: Analyzing trace with hash 257837842, now seen corresponding path program 1 times [2025-03-09 02:48:31,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:31,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036804279] [2025-03-09 02:48:31,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:31,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:31,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-09 02:48:31,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-09 02:48:31,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:31,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:31,670 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 18 proven. 348 refuted. 0 times theorem prover too weak. 7446 trivial. 0 not checked. [2025-03-09 02:48:31,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:31,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036804279] [2025-03-09 02:48:31,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036804279] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:31,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118688232] [2025-03-09 02:48:31,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:31,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:31,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:31,673 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-09 02:48:31,675 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-09 02:48:31,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-09 02:48:31,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-09 02:48:31,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:31,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:31,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 02:48:31,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:32,102 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-09 02:48:32,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:32,497 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-09 02:48:32,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118688232] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:32,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:32,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 22 [2025-03-09 02:48:32,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184814906] [2025-03-09 02:48:32,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:32,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 02:48:32,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:32,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 02:48:32,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2025-03-09 02:48:32,499 INFO L87 Difference]: Start difference. First operand 135 states and 205 transitions. Second operand has 23 states, 21 states have (on average 3.761904761904762) internal successors, (79), 23 states have internal predecessors, (79), 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-09 02:48:33,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:33,114 INFO L93 Difference]: Finished difference Result 139 states and 210 transitions. [2025-03-09 02:48:33,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 02:48:33,115 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.761904761904762) internal successors, (79), 23 states have internal predecessors, (79), 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 340 [2025-03-09 02:48:33,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:33,116 INFO L225 Difference]: With dead ends: 139 [2025-03-09 02:48:33,116 INFO L226 Difference]: Without dead ends: 138 [2025-03-09 02:48:33,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 693 GetRequests, 665 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2025-03-09 02:48:33,117 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 49 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:33,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1293 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 02:48:33,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-09 02:48:33,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 134. [2025-03-09 02:48:33,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 54 states have (on average 1.2962962962962963) 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-09 02:48:33,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 204 transitions. [2025-03-09 02:48:33,135 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 204 transitions. Word has length 340 [2025-03-09 02:48:33,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:33,137 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 204 transitions. [2025-03-09 02:48:33,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.761904761904762) internal successors, (79), 23 states have internal predecessors, (79), 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-09 02:48:33,138 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 204 transitions. [2025-03-09 02:48:33,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-03-09 02:48:33,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:33,140 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-09 02:48:33,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 02:48:33,341 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-09 02:48:33,341 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-09 02:48:33,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:33,342 INFO L85 PathProgramCache]: Analyzing trace with hash -521623190, now seen corresponding path program 1 times [2025-03-09 02:48:33,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:33,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645185951] [2025-03-09 02:48:33,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:33,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:33,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-09 02:48:33,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-09 02:48:33,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:33,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:33,506 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-09 02:48:33,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:33,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645185951] [2025-03-09 02:48:33,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645185951] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:33,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684831108] [2025-03-09 02:48:33,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:33,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:33,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:33,508 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-09 02:48:33,515 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-09 02:48:33,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-09 02:48:33,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-09 02:48:33,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:33,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:33,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 02:48:33,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:33,806 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-09 02:48:33,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:34,059 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-09 02:48:34,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684831108] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:34,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:34,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-09 02:48:34,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837672939] [2025-03-09 02:48:34,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:34,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 02:48:34,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:34,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 02:48:34,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:48:34,063 INFO L87 Difference]: Start difference. First operand 134 states and 204 transitions. Second operand has 10 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 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-09 02:48:34,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:34,363 INFO L93 Difference]: Finished difference Result 134 states and 204 transitions. [2025-03-09 02:48:34,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:48:34,364 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 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 345 [2025-03-09 02:48:34,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:34,365 INFO L225 Difference]: With dead ends: 134 [2025-03-09 02:48:34,365 INFO L226 Difference]: Without dead ends: 133 [2025-03-09 02:48:34,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 693 GetRequests, 685 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:48:34,366 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 7 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:34,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 722 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:48:34,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-09 02:48:34,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-03-09 02:48:34,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 54 states have (on average 1.2777777777777777) 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-09 02:48:34,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 203 transitions. [2025-03-09 02:48:34,378 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 203 transitions. Word has length 345 [2025-03-09 02:48:34,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:34,378 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 203 transitions. [2025-03-09 02:48:34,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 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-09 02:48:34,379 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 203 transitions. [2025-03-09 02:48:34,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-03-09 02:48:34,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:34,380 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] [2025-03-09 02:48:34,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 02:48:34,580 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-09 02:48:34,581 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-09 02:48:34,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:34,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1009550312, now seen corresponding path program 1 times [2025-03-09 02:48:34,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:34,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696922376] [2025-03-09 02:48:34,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:34,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:34,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-03-09 02:48:34,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-03-09 02:48:34,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:34,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:34,758 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-09 02:48:34,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:34,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696922376] [2025-03-09 02:48:34,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696922376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:34,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157193208] [2025-03-09 02:48:34,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:34,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:34,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:34,761 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-09 02:48:34,763 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-09 02:48:34,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-03-09 02:48:34,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-03-09 02:48:34,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:34,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:34,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 02:48:34,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:35,035 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-09 02:48:35,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:35,263 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-09 02:48:35,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157193208] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:35,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:35,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-09 02:48:35,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8282071] [2025-03-09 02:48:35,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:35,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:48:35,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:35,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:48:35,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:48:35,265 INFO L87 Difference]: Start difference. First operand 133 states and 203 transitions. Second operand has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 8 states have internal predecessors, (55), 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-09 02:48:35,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:35,511 INFO L93 Difference]: Finished difference Result 133 states and 203 transitions. [2025-03-09 02:48:35,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:48:35,512 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 8 states have internal predecessors, (55), 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 346 [2025-03-09 02:48:35,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:35,514 INFO L225 Difference]: With dead ends: 133 [2025-03-09 02:48:35,514 INFO L226 Difference]: Without dead ends: 132 [2025-03-09 02:48:35,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 695 GetRequests, 688 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-09 02:48:35,515 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 18 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:35,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 457 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:48:35,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-09 02:48:35,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-03-09 02:48:35,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 54 states have (on average 1.2592592592592593) 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-09 02:48:35,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 202 transitions. [2025-03-09 02:48:35,528 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 202 transitions. Word has length 346 [2025-03-09 02:48:35,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:35,530 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 202 transitions. [2025-03-09 02:48:35,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 8 states have internal predecessors, (55), 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-09 02:48:35,530 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 202 transitions. [2025-03-09 02:48:35,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-03-09 02:48:35,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:35,532 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, 1] [2025-03-09 02:48:35,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 02:48:35,736 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-09 02:48:35,736 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-09 02:48:35,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:35,737 INFO L85 PathProgramCache]: Analyzing trace with hash -2142612281, now seen corresponding path program 1 times [2025-03-09 02:48:35,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:35,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343811393] [2025-03-09 02:48:35,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:35,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:35,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-09 02:48:35,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-09 02:48:35,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:35,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:35,930 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-09 02:48:35,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:35,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343811393] [2025-03-09 02:48:35,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343811393] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:35,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000601002] [2025-03-09 02:48:35,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:35,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:35,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:35,933 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-09 02:48:35,935 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-09 02:48:35,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-09 02:48:36,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-09 02:48:36,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:36,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:36,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:48:36,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:36,227 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-09 02:48:36,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:36,475 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-09 02:48:36,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000601002] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:36,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:36,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-09 02:48:36,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483984755] [2025-03-09 02:48:36,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:36,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:48:36,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:36,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:48:36,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:48:36,478 INFO L87 Difference]: Start difference. First operand 132 states and 202 transitions. Second operand has 9 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 4 states have call successors, (122), 1 states have call predecessors, (122), 2 states have return successors, (122), 4 states have call predecessors, (122), 4 states have call successors, (122) [2025-03-09 02:48:36,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:36,794 INFO L93 Difference]: Finished difference Result 132 states and 202 transitions. [2025-03-09 02:48:36,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:48:36,794 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 4 states have call successors, (122), 1 states have call predecessors, (122), 2 states have return successors, (122), 4 states have call predecessors, (122), 4 states have call successors, (122) Word has length 349 [2025-03-09 02:48:36,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:36,796 INFO L225 Difference]: With dead ends: 132 [2025-03-09 02:48:36,796 INFO L226 Difference]: Without dead ends: 131 [2025-03-09 02:48:36,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 702 GetRequests, 693 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:48:36,797 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 18 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:36,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 581 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:48:36,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-09 02:48:36,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-03-09 02:48:36,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 54 states have (on average 1.2407407407407407) 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-09 02:48:36,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 201 transitions. [2025-03-09 02:48:36,806 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 201 transitions. Word has length 349 [2025-03-09 02:48:36,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:36,807 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 201 transitions. [2025-03-09 02:48:36,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 4 states have call successors, (122), 1 states have call predecessors, (122), 2 states have return successors, (122), 4 states have call predecessors, (122), 4 states have call successors, (122) [2025-03-09 02:48:36,808 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 201 transitions. [2025-03-09 02:48:36,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-09 02:48:36,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:36,809 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-09 02:48:36,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 02:48:37,014 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-09 02:48:37,015 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-09 02:48:37,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:37,015 INFO L85 PathProgramCache]: Analyzing trace with hash -989339967, now seen corresponding path program 1 times [2025-03-09 02:48:37,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:37,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243526004] [2025-03-09 02:48:37,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:37,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:37,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-09 02:48:37,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-09 02:48:37,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:37,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:37,149 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-09 02:48:37,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:37,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243526004] [2025-03-09 02:48:37,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243526004] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:37,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667971335] [2025-03-09 02:48:37,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:37,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:37,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:37,153 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-09 02:48:37,155 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-09 02:48:37,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-09 02:48:37,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-09 02:48:37,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:37,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:37,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-09 02:48:37,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:37,561 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-09 02:48:37,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:37,955 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-09 02:48:37,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667971335] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:37,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:37,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 10] total 19 [2025-03-09 02:48:37,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601911544] [2025-03-09 02:48:37,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:37,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 02:48:37,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:37,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 02:48:37,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-03-09 02:48:37,958 INFO L87 Difference]: Start difference. First operand 131 states and 201 transitions. Second operand has 20 states, 18 states have (on average 4.833333333333333) internal successors, (87), 17 states have internal predecessors, (87), 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-09 02:48:38,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:38,473 INFO L93 Difference]: Finished difference Result 135 states and 208 transitions. [2025-03-09 02:48:38,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 02:48:38,474 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 4.833333333333333) internal successors, (87), 17 states have internal predecessors, (87), 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 354 [2025-03-09 02:48:38,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:38,475 INFO L225 Difference]: With dead ends: 135 [2025-03-09 02:48:38,475 INFO L226 Difference]: Without dead ends: 134 [2025-03-09 02:48:38,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 693 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-09 02:48:38,476 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 117 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:38,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1106 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:48:38,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-09 02:48:38,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2025-03-09 02:48:38,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 54 states have (on average 1.2222222222222223) 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-09 02:48:38,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 200 transitions. [2025-03-09 02:48:38,489 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 200 transitions. Word has length 354 [2025-03-09 02:48:38,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:38,490 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 200 transitions. [2025-03-09 02:48:38,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 4.833333333333333) internal successors, (87), 17 states have internal predecessors, (87), 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-09 02:48:38,490 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 200 transitions. [2025-03-09 02:48:38,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-09 02:48:38,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:38,492 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] [2025-03-09 02:48:38,498 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-09 02:48:38,692 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-09 02:48:38,692 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-09 02:48:38,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:38,693 INFO L85 PathProgramCache]: Analyzing trace with hash -604767899, now seen corresponding path program 1 times [2025-03-09 02:48:38,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:38,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660453430] [2025-03-09 02:48:38,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:38,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:38,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-09 02:48:38,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-09 02:48:38,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:38,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:38,834 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-09 02:48:38,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:38,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660453430] [2025-03-09 02:48:38,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660453430] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:38,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268946558] [2025-03-09 02:48:38,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:38,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:38,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:38,837 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-09 02:48:38,839 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-09 02:48:38,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-09 02:48:38,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-09 02:48:38,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:38,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:38,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 02:48:38,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:39,127 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-09 02:48:39,127 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:39,347 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-09 02:48:39,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268946558] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:39,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:39,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-09 02:48:39,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909571650] [2025-03-09 02:48:39,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:39,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:48:39,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:39,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:48:39,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:48:39,349 INFO L87 Difference]: Start difference. First operand 130 states and 200 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 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-09 02:48:39,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:39,581 INFO L93 Difference]: Finished difference Result 130 states and 200 transitions. [2025-03-09 02:48:39,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:48:39,581 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 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 355 [2025-03-09 02:48:39,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:39,582 INFO L225 Difference]: With dead ends: 130 [2025-03-09 02:48:39,582 INFO L226 Difference]: Without dead ends: 129 [2025-03-09 02:48:39,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 713 GetRequests, 706 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-09 02:48:39,583 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 9 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:39,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 521 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:48:39,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-09 02:48:39,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-03-09 02:48:39,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 54 states have (on average 1.2037037037037037) 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-09 02:48:39,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 199 transitions. [2025-03-09 02:48:39,596 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 199 transitions. Word has length 355 [2025-03-09 02:48:39,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:39,597 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 199 transitions. [2025-03-09 02:48:39,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 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-09 02:48:39,597 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 199 transitions. [2025-03-09 02:48:39,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-03-09 02:48:39,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:39,599 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, 1] [2025-03-09 02:48:39,606 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-09 02:48:39,799 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-09 02:48:39,800 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-09 02:48:39,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:39,800 INFO L85 PathProgramCache]: Analyzing trace with hash 747332510, now seen corresponding path program 1 times [2025-03-09 02:48:39,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:39,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567573726] [2025-03-09 02:48:39,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:39,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:39,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-03-09 02:48:39,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-03-09 02:48:39,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:39,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:39,950 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-09 02:48:39,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:39,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567573726] [2025-03-09 02:48:39,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567573726] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:39,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067723366] [2025-03-09 02:48:39,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:39,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:39,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:39,954 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-09 02:48:39,955 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-09 02:48:39,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-03-09 02:48:40,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-03-09 02:48:40,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:40,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:40,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 02:48:40,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:40,386 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-09 02:48:40,386 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:40,724 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-09 02:48:40,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067723366] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:40,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:40,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 20 [2025-03-09 02:48:40,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854811215] [2025-03-09 02:48:40,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:40,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 02:48:40,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:40,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 02:48:40,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-03-09 02:48:40,727 INFO L87 Difference]: Start difference. First operand 129 states and 199 transitions. Second operand has 21 states, 19 states have (on average 4.947368421052632) internal successors, (94), 20 states have internal predecessors, (94), 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-09 02:48:41,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:41,167 INFO L93 Difference]: Finished difference Result 133 states and 204 transitions. [2025-03-09 02:48:41,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 02:48:41,168 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 4.947368421052632) internal successors, (94), 20 states have internal predecessors, (94), 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 358 [2025-03-09 02:48:41,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:41,169 INFO L225 Difference]: With dead ends: 133 [2025-03-09 02:48:41,169 INFO L226 Difference]: Without dead ends: 132 [2025-03-09 02:48:41,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 700 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-09 02:48:41,170 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 102 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:41,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1035 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:48:41,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-09 02:48:41,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2025-03-09 02:48:41,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 54 states have (on average 1.1851851851851851) 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-09 02:48:41,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 198 transitions. [2025-03-09 02:48:41,186 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 198 transitions. Word has length 358 [2025-03-09 02:48:41,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:41,186 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 198 transitions. [2025-03-09 02:48:41,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 4.947368421052632) internal successors, (94), 20 states have internal predecessors, (94), 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-09 02:48:41,187 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 198 transitions. [2025-03-09 02:48:41,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-03-09 02:48:41,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:41,188 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-09 02:48:41,196 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-09 02:48:41,388 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-09 02:48:41,388 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-09 02:48:41,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:41,389 INFO L85 PathProgramCache]: Analyzing trace with hash -47057866, now seen corresponding path program 1 times [2025-03-09 02:48:41,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:41,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314483486] [2025-03-09 02:48:41,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:41,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:41,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-03-09 02:48:41,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-03-09 02:48:41,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:41,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:41,563 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-09 02:48:41,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:41,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314483486] [2025-03-09 02:48:41,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314483486] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:41,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986795135] [2025-03-09 02:48:41,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:41,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:41,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:41,567 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-09 02:48:41,568 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-09 02:48:41,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-03-09 02:48:41,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-03-09 02:48:41,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:41,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:41,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-09 02:48:41,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:42,084 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-09 02:48:42,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:42,523 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-09 02:48:42,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986795135] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:42,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:42,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13, 15] total 28 [2025-03-09 02:48:42,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032392975] [2025-03-09 02:48:42,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:42,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-09 02:48:42,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:42,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-09 02:48:42,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2025-03-09 02:48:42,525 INFO L87 Difference]: Start difference. First operand 128 states and 198 transitions. Second operand has 29 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 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-09 02:48:43,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:43,162 INFO L93 Difference]: Finished difference Result 136 states and 210 transitions. [2025-03-09 02:48:43,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 02:48:43,162 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 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 363 [2025-03-09 02:48:43,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:43,164 INFO L225 Difference]: With dead ends: 136 [2025-03-09 02:48:43,164 INFO L226 Difference]: Without dead ends: 135 [2025-03-09 02:48:43,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 702 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=262, Invalid=1378, Unknown=0, NotChecked=0, Total=1640 [2025-03-09 02:48:43,165 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 113 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:43,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1270 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 02:48:43,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-09 02:48:43,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 127. [2025-03-09 02:48:43,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 54 states have (on average 1.1666666666666667) 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-09 02:48:43,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 197 transitions. [2025-03-09 02:48:43,177 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 197 transitions. Word has length 363 [2025-03-09 02:48:43,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:43,178 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 197 transitions. [2025-03-09 02:48:43,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 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-09 02:48:43,178 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 197 transitions. [2025-03-09 02:48:43,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-03-09 02:48:43,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:43,179 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] [2025-03-09 02:48:43,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-09 02:48:43,384 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-09 02:48:43,384 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-09 02:48:43,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:43,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1458793852, now seen corresponding path program 1 times [2025-03-09 02:48:43,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:43,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029663820] [2025-03-09 02:48:43,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:43,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:43,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-03-09 02:48:43,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-03-09 02:48:43,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:43,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:43,557 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-09 02:48:43,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:43,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029663820] [2025-03-09 02:48:43,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029663820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:43,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181659778] [2025-03-09 02:48:43,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:43,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:43,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:43,560 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-09 02:48:43,561 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-09 02:48:43,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-03-09 02:48:43,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-03-09 02:48:43,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:43,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:43,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 02:48:43,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:43,860 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-09 02:48:43,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:44,119 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-09 02:48:44,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181659778] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:44,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:44,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2025-03-09 02:48:44,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935924444] [2025-03-09 02:48:44,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:44,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 02:48:44,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:44,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 02:48:44,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:48:44,122 INFO L87 Difference]: Start difference. First operand 127 states and 197 transitions. Second operand has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 states have internal predecessors, (97), 7 states have call successors, (182), 1 states have call predecessors, (182), 2 states have return successors, (183), 7 states have call predecessors, (183), 7 states have call successors, (183) [2025-03-09 02:48:44,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:44,610 INFO L93 Difference]: Finished difference Result 132 states and 204 transitions. [2025-03-09 02:48:44,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 02:48:44,610 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 states have internal predecessors, (97), 7 states have call successors, (182), 1 states have call predecessors, (182), 2 states have return successors, (183), 7 states have call predecessors, (183), 7 states have call successors, (183) Word has length 364 [2025-03-09 02:48:44,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:44,612 INFO L225 Difference]: With dead ends: 132 [2025-03-09 02:48:44,612 INFO L226 Difference]: Without dead ends: 131 [2025-03-09 02:48:44,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 723 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2025-03-09 02:48:44,612 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 48 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:44,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 925 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:48:44,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-09 02:48:44,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 126. [2025-03-09 02:48:44,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 54 states have (on average 1.1481481481481481) 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-09 02:48:44,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 196 transitions. [2025-03-09 02:48:44,624 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 196 transitions. Word has length 364 [2025-03-09 02:48:44,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:44,624 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 196 transitions. [2025-03-09 02:48:44,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 states have internal predecessors, (97), 7 states have call successors, (182), 1 states have call predecessors, (182), 2 states have return successors, (183), 7 states have call predecessors, (183), 7 states have call successors, (183) [2025-03-09 02:48:44,625 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 196 transitions. [2025-03-09 02:48:44,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-03-09 02:48:44,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:44,626 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, 1] [2025-03-09 02:48:44,633 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-09 02:48:44,826 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-09 02:48:44,827 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 02:48:44,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:44,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1846416275, now seen corresponding path program 1 times [2025-03-09 02:48:44,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:44,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869484290] [2025-03-09 02:48:44,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:44,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:44,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-03-09 02:48:44,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-03-09 02:48:44,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:44,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:45,012 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 54 proven. 330 refuted. 0 times theorem prover too weak. 8196 trivial. 0 not checked. [2025-03-09 02:48:45,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:45,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869484290] [2025-03-09 02:48:45,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869484290] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:45,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295953836] [2025-03-09 02:48:45,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:45,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:45,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:45,016 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-09 02:48:45,017 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-09 02:48:45,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-03-09 02:48:45,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-03-09 02:48:45,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:45,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:45,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 02:48:45,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:45,416 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-09 02:48:45,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:45,761 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-09 02:48:45,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295953836] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:45,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:45,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 22 [2025-03-09 02:48:45,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244393289] [2025-03-09 02:48:45,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:45,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 02:48:45,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:45,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 02:48:45,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2025-03-09 02:48:45,763 INFO L87 Difference]: Start difference. First operand 126 states and 196 transitions. Second operand has 23 states, 21 states have (on average 5.190476190476191) internal successors, (109), 23 states have internal predecessors, (109), 11 states have call successors, (184), 1 states have call predecessors, (184), 2 states have return successors, (186), 11 states have call predecessors, (186), 11 states have call successors, (186) [2025-03-09 02:48:46,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:46,374 INFO L93 Difference]: Finished difference Result 130 states and 201 transitions. [2025-03-09 02:48:46,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 02:48:46,375 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 5.190476190476191) internal successors, (109), 23 states have internal predecessors, (109), 11 states have call successors, (184), 1 states have call predecessors, (184), 2 states have return successors, (186), 11 states have call predecessors, (186), 11 states have call successors, (186) Word has length 367 [2025-03-09 02:48:46,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:46,376 INFO L225 Difference]: With dead ends: 130 [2025-03-09 02:48:46,376 INFO L226 Difference]: Without dead ends: 129 [2025-03-09 02:48:46,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 747 GetRequests, 719 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2025-03-09 02:48:46,377 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 120 mSDsluCounter, 1394 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:46,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1506 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 02:48:46,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-09 02:48:46,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2025-03-09 02:48:46,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 54 states have (on average 1.1296296296296295) 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-09 02:48:46,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 195 transitions. [2025-03-09 02:48:46,393 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 195 transitions. Word has length 367 [2025-03-09 02:48:46,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:46,393 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 195 transitions. [2025-03-09 02:48:46,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 5.190476190476191) internal successors, (109), 23 states have internal predecessors, (109), 11 states have call successors, (184), 1 states have call predecessors, (184), 2 states have return successors, (186), 11 states have call predecessors, (186), 11 states have call successors, (186) [2025-03-09 02:48:46,394 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 195 transitions. [2025-03-09 02:48:46,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-03-09 02:48:46,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:46,395 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-09 02:48:46,402 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-09 02:48:46,595 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-09 02:48:46,596 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 02:48:46,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:46,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1339528371, now seen corresponding path program 1 times [2025-03-09 02:48:46,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:46,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612452154] [2025-03-09 02:48:46,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:46,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:46,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-09 02:48:46,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-09 02:48:46,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:46,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:46,734 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-09 02:48:46,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:46,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612452154] [2025-03-09 02:48:46,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612452154] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:46,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221542063] [2025-03-09 02:48:46,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:46,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:46,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:46,736 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-09 02:48:46,738 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-09 02:48:46,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-09 02:48:46,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-09 02:48:46,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:46,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:46,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-09 02:48:46,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:47,241 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-09 02:48:47,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:47,769 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-09 02:48:47,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221542063] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:47,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:47,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13, 15] total 28 [2025-03-09 02:48:47,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624127025] [2025-03-09 02:48:47,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:47,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-09 02:48:47,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:47,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-09 02:48:47,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2025-03-09 02:48:47,772 INFO L87 Difference]: Start difference. First operand 125 states and 195 transitions. Second operand has 29 states, 26 states have (on average 4.1923076923076925) internal successors, (109), 26 states have internal predecessors, (109), 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-09 02:48:48,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:48,470 INFO L93 Difference]: Finished difference Result 133 states and 207 transitions. [2025-03-09 02:48:48,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 02:48:48,470 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 4.1923076923076925) internal successors, (109), 26 states have internal predecessors, (109), 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 372 [2025-03-09 02:48:48,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:48,472 INFO L225 Difference]: With dead ends: 133 [2025-03-09 02:48:48,472 INFO L226 Difference]: Without dead ends: 132 [2025-03-09 02:48:48,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 759 GetRequests, 720 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=262, Invalid=1378, Unknown=0, NotChecked=0, Total=1640 [2025-03-09 02:48:48,472 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 97 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:48,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1283 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1276 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 02:48:48,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-09 02:48:48,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 124. [2025-03-09 02:48:48,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 54 states have (on average 1.1111111111111112) 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-09 02:48:48,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 194 transitions. [2025-03-09 02:48:48,483 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 194 transitions. Word has length 372 [2025-03-09 02:48:48,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:48,484 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 194 transitions. [2025-03-09 02:48:48,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 4.1923076923076925) internal successors, (109), 26 states have internal predecessors, (109), 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-09 02:48:48,484 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 194 transitions. [2025-03-09 02:48:48,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-03-09 02:48:48,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:48,486 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] [2025-03-09 02:48:48,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-09 02:48:48,686 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-09 02:48:48,686 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 02:48:48,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:48,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1424293441, now seen corresponding path program 1 times [2025-03-09 02:48:48,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:48,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871441090] [2025-03-09 02:48:48,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:48,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:48,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-03-09 02:48:48,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-03-09 02:48:48,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:48,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:48,899 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-09 02:48:48,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:48,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871441090] [2025-03-09 02:48:48,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871441090] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:48,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698819041] [2025-03-09 02:48:48,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:48,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:48,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:48,902 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-09 02:48:48,903 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-09 02:48:48,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-03-09 02:48:48,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-03-09 02:48:48,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:48,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:48,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 02:48:48,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:49,157 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-09 02:48:49,157 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:49,355 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-09 02:48:49,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698819041] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:49,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:49,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 14 [2025-03-09 02:48:49,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832379043] [2025-03-09 02:48:49,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:49,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 02:48:49,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:49,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 02:48:49,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:48:49,357 INFO L87 Difference]: Start difference. First operand 124 states and 194 transitions. Second operand has 15 states, 14 states have (on average 7.714285714285714) internal successors, (108), 15 states have internal predecessors, (108), 8 states have call successors, (183), 1 states have call predecessors, (183), 2 states have return successors, (184), 8 states have call predecessors, (184), 8 states have call successors, (184) [2025-03-09 02:48:49,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:49,806 INFO L93 Difference]: Finished difference Result 136 states and 210 transitions. [2025-03-09 02:48:49,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 02:48:49,807 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.714285714285714) internal successors, (108), 15 states have internal predecessors, (108), 8 states have call successors, (183), 1 states have call predecessors, (183), 2 states have return successors, (184), 8 states have call predecessors, (184), 8 states have call successors, (184) Word has length 373 [2025-03-09 02:48:49,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:49,808 INFO L225 Difference]: With dead ends: 136 [2025-03-09 02:48:49,808 INFO L226 Difference]: Without dead ends: 135 [2025-03-09 02:48:49,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 765 GetRequests, 741 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2025-03-09 02:48:49,808 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 83 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:49,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 927 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:48:49,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-09 02:48:49,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2025-03-09 02:48:49,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 54 states have (on average 1.0925925925925926) 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-09 02:48:49,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 193 transitions. [2025-03-09 02:48:49,819 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 193 transitions. Word has length 373 [2025-03-09 02:48:49,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:49,819 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 193 transitions. [2025-03-09 02:48:49,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.714285714285714) internal successors, (108), 15 states have internal predecessors, (108), 8 states have call successors, (183), 1 states have call predecessors, (183), 2 states have return successors, (184), 8 states have call predecessors, (184), 8 states have call successors, (184) [2025-03-09 02:48:49,820 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 193 transitions. [2025-03-09 02:48:49,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-03-09 02:48:49,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:49,821 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, 1] [2025-03-09 02:48:49,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-09 02:48:50,021 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-09 02:48:50,022 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 02:48:50,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:50,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1143964714, now seen corresponding path program 1 times [2025-03-09 02:48:50,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:50,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469323742] [2025-03-09 02:48:50,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:50,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:50,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-03-09 02:48:50,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-03-09 02:48:50,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:50,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:50,152 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-09 02:48:50,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:50,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469323742] [2025-03-09 02:48:50,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469323742] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:50,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880950020] [2025-03-09 02:48:50,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:50,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:50,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:50,155 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-09 02:48:50,156 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-09 02:48:50,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-03-09 02:48:50,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-03-09 02:48:50,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:50,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:50,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-09 02:48:50,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:50,651 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-09 02:48:50,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:51,054 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-09 02:48:51,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880950020] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:51,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:51,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 14, 16] total 29 [2025-03-09 02:48:51,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624123814] [2025-03-09 02:48:51,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:51,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-09 02:48:51,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:51,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-09 02:48:51,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=772, Unknown=0, NotChecked=0, Total=870 [2025-03-09 02:48:51,056 INFO L87 Difference]: Start difference. First operand 123 states and 193 transitions. Second operand has 30 states, 27 states have (on average 4.296296296296297) internal successors, (116), 29 states have internal predecessors, (116), 15 states have call successors, (187), 1 states have call predecessors, (187), 2 states have return successors, (189), 14 states have call predecessors, (189), 15 states have call successors, (189) [2025-03-09 02:48:51,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:51,819 INFO L93 Difference]: Finished difference Result 131 states and 203 transitions. [2025-03-09 02:48:51,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 02:48:51,819 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 4.296296296296297) internal successors, (116), 29 states have internal predecessors, (116), 15 states have call successors, (187), 1 states have call predecessors, (187), 2 states have return successors, (189), 14 states have call predecessors, (189), 15 states have call successors, (189) Word has length 376 [2025-03-09 02:48:51,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:51,820 INFO L225 Difference]: With dead ends: 131 [2025-03-09 02:48:51,820 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 02:48:51,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 727 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=249, Invalid=1473, Unknown=0, NotChecked=0, Total=1722 [2025-03-09 02:48:51,822 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 158 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 1644 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 1766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:51,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1474 Invalid, 1766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1644 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 02:48:51,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 02:48:51,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 02:48:51,822 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-09 02:48:51,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 02:48:51,822 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 376 [2025-03-09 02:48:51,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:51,823 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 02:48:51,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 4.296296296296297) internal successors, (116), 29 states have internal predecessors, (116), 15 states have call successors, (187), 1 states have call predecessors, (187), 2 states have return successors, (189), 14 states have call predecessors, (189), 15 states have call successors, (189) [2025-03-09 02:48:51,823 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 02:48:51,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 02:48:51,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2025-03-09 02:48:51,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2025-03-09 02:48:51,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2025-03-09 02:48:51,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2025-03-09 02:48:51,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2025-03-09 02:48:51,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2025-03-09 02:48:51,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2025-03-09 02:48:51,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2025-03-09 02:48:51,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2025-03-09 02:48:51,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2025-03-09 02:48:51,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2025-03-09 02:48:51,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2025-03-09 02:48:51,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2025-03-09 02:48:51,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2025-03-09 02:48:51,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2025-03-09 02:48:51,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2025-03-09 02:48:51,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2025-03-09 02:48:51,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2025-03-09 02:48:51,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2025-03-09 02:48:51,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2025-03-09 02:48:51,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2025-03-09 02:48:51,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2025-03-09 02:48:51,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2025-03-09 02:48:51,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2025-03-09 02:48:51,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-09 02:48:52,028 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-09 02:48:52,031 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] [2025-03-09 02:48:52,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 02:48:53,463 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 02:48:53,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 02:48:53 BoogieIcfgContainer [2025-03-09 02:48:53,469 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 02:48:53,469 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 02:48:53,469 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 02:48:53,470 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 02:48:53,470 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:48:21" (3/4) ... [2025-03-09 02:48:53,472 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 02:48:53,477 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume [2025-03-09 02:48:53,482 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-09 02:48:53,482 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 02:48:53,482 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 02:48:53,483 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 02:48:53,553 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 02:48:53,554 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 02:48:53,554 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 02:48:53,555 INFO L158 Benchmark]: Toolchain (without parser) took 32350.05ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 134.4MB in the beginning and 366.1MB in the end (delta: -231.7MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2025-03-09 02:48:53,555 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:48:53,555 INFO L158 Benchmark]: CACSL2BoogieTranslator took 163.86ms. Allocated memory is still 167.8MB. Free memory was 134.4MB in the beginning and 122.0MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:48:53,557 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.51ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 120.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:48:53,557 INFO L158 Benchmark]: Boogie Preprocessor took 23.19ms. Allocated memory is still 167.8MB. Free memory was 120.0MB in the beginning and 118.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:48:53,558 INFO L158 Benchmark]: IcfgBuilder took 365.24ms. Allocated memory is still 167.8MB. Free memory was 118.7MB in the beginning and 96.9MB in the end (delta: 21.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 02:48:53,558 INFO L158 Benchmark]: TraceAbstraction took 31683.95ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 96.5MB in the beginning and 374.1MB in the end (delta: -277.6MB). Peak memory consumption was 220.3MB. Max. memory is 16.1GB. [2025-03-09 02:48:53,558 INFO L158 Benchmark]: Witness Printer took 84.54ms. Allocated memory is still 427.8MB. Free memory was 374.1MB in the beginning and 366.1MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:48:53,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.35ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 163.86ms. Allocated memory is still 167.8MB. Free memory was 134.4MB in the beginning and 122.0MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.51ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 120.0MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.19ms. Allocated memory is still 167.8MB. Free memory was 120.0MB in the beginning and 118.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 365.24ms. Allocated memory is still 167.8MB. Free memory was 118.7MB in the beginning and 96.9MB in the end (delta: 21.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 31683.95ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 96.5MB in the beginning and 374.1MB in the end (delta: -277.6MB). Peak memory consumption was 220.3MB. Max. memory is 16.1GB. * Witness Printer took 84.54ms. Allocated memory is still 427.8MB. Free memory was 374.1MB in the beginning and 366.1MB in the end (delta: 8.0MB). 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, 153 locations, 294 edges, 24 error locations. Started 1 CEGAR loops. OverallTime: 30.2s, OverallIterations: 20, TraceHistogramMax: 67, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 990 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 990 mSDsluCounter, 18055 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15435 mSDsCounter, 900 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14507 IncrementalHoareTripleChecker+Invalid, 15407 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 900 mSolverCounterUnsat, 2620 mSDtfsCounter, 14507 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13141 GetRequests, 12778 SyntacticMatches, 11 SemanticMatches, 352 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1350 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=0, InterpolantAutomatonStates: 201, 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, 20 MinimizatonAttempts, 53 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 14.6s InterpolantComputationTime, 13626 NumberOfCodeBlocks, 13626 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 19890 ConstructedInterpolants, 0 QuantifiedInterpolants, 46818 SizeOfPredicates, 63 NumberOfNonLiveVariables, 12461 ConjunctsInSsa, 308 ConjunctsInUnsatCore, 57 InterpolantComputations, 2 PerfectInterpolantSequences, 449896/465348 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-09 02:48:53,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE