./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound1.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/nla-digbench-scaling/ps5-ll_valuebound1.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 bd4ff7f95c7aab1abb3428488ee9247a9f3cbeb30d436182472263a0c2dcf758 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:35:51,200 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:35:51,255 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:35:51,258 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:35:51,258 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:35:51,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:35:51,277 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:35:51,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:35:51,278 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:35:51,278 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:35:51,278 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:35:51,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:35:51,279 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:35:51,279 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:35:51,279 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:35:51,280 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:35:51,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:35:51,280 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:35:51,280 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:35:51,280 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:35:51,280 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:35:51,280 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:35:51,280 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:35:51,280 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:35:51,281 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:35:51,281 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:35:51,281 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:35:51,281 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:35:51,281 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:35:51,281 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:35:51,281 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:35:51,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:35:51,282 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:35:51,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:35:51,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:35:51,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:35:51,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:35:51,282 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:35:51,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:35:51,282 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:35:51,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:35:51,282 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:35:51,283 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:35:51,283 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:35:51,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:35:51,283 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 -> bd4ff7f95c7aab1abb3428488ee9247a9f3cbeb30d436182472263a0c2dcf758 [2025-03-09 02:35:51,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:35:51,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:35:51,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:35:51,514 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:35:51,515 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:35:51,516 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound1.c [2025-03-09 02:35:52,615 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8af135f1e/77040e62faab4f22a3b1bd5354097378/FLAG163b7294a [2025-03-09 02:35:52,812 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:35:52,812 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound1.c [2025-03-09 02:35:52,830 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8af135f1e/77040e62faab4f22a3b1bd5354097378/FLAG163b7294a [2025-03-09 02:35:52,842 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8af135f1e/77040e62faab4f22a3b1bd5354097378 [2025-03-09 02:35:52,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:35:52,844 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:35:52,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:35:52,845 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:35:52,851 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:35:52,851 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:35:52" (1/1) ... [2025-03-09 02:35:52,852 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@649a78e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:35:52, skipping insertion in model container [2025-03-09 02:35:52,852 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:35:52" (1/1) ... [2025-03-09 02:35:52,864 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:35:52,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:35:52,987 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:35:53,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:35:53,018 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:35:53,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:35:53 WrapperNode [2025-03-09 02:35:53,019 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:35:53,020 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:35:53,020 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:35:53,020 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:35:53,024 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:35:53" (1/1) ... [2025-03-09 02:35:53,028 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:35:53" (1/1) ... [2025-03-09 02:35:53,053 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 123 [2025-03-09 02:35:53,057 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:35:53,058 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:35:53,058 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:35:53,058 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:35:53,065 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:35:53" (1/1) ... [2025-03-09 02:35:53,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:35:53" (1/1) ... [2025-03-09 02:35:53,069 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:35:53" (1/1) ... [2025-03-09 02:35:53,079 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:35:53,082 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:35:53" (1/1) ... [2025-03-09 02:35:53,085 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:35:53" (1/1) ... [2025-03-09 02:35:53,087 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:35:53" (1/1) ... [2025-03-09 02:35:53,088 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:35:53" (1/1) ... [2025-03-09 02:35:53,092 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:35:53" (1/1) ... [2025-03-09 02:35:53,093 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:35:53" (1/1) ... [2025-03-09 02:35:53,094 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:35:53,094 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:35:53,094 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:35:53,094 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:35:53,095 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:35:53" (1/1) ... [2025-03-09 02:35:53,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:35:53,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:35:53,122 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:35:53,124 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:35:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:35:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 02:35:53,140 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 02:35:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:35:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:35:53,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:35:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 02:35:53,140 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 02:35:53,179 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:35:53,180 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:35:53,555 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2025-03-09 02:35:53,555 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:35:53,564 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:35:53,565 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:35:53,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:35:53 BoogieIcfgContainer [2025-03-09 02:35:53,565 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:35:53,567 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:35:53,567 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:35:53,571 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:35:53,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:35:52" (1/3) ... [2025-03-09 02:35:53,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@509f482e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:35:53, skipping insertion in model container [2025-03-09 02:35:53,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:35:53" (2/3) ... [2025-03-09 02:35:53,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@509f482e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:35:53, skipping insertion in model container [2025-03-09 02:35:53,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:35:53" (3/3) ... [2025-03-09 02:35:53,574 INFO L128 eAbstractionObserver]: Analyzing ICFG ps5-ll_valuebound1.c [2025-03-09 02:35:53,583 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:35:53,584 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps5-ll_valuebound1.c that has 3 procedures, 191 locations, 1 initial locations, 1 loop locations, and 84 error locations. [2025-03-09 02:35:53,624 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:35:53,633 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;@16c6edd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:35:53,634 INFO L334 AbstractCegarLoop]: Starting to check reachability of 84 error locations. [2025-03-09 02:35:53,636 INFO L276 IsEmpty]: Start isEmpty. Operand has 191 states, 99 states have (on average 1.8888888888888888) internal successors, (187), 183 states have internal predecessors, (187), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:35:53,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-09 02:35:53,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:35:53,641 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:35:53,641 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-09 02:35:53,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:35:53,646 INFO L85 PathProgramCache]: Analyzing trace with hash 444888282, now seen corresponding path program 1 times [2025-03-09 02:35:53,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:35:53,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290331928] [2025-03-09 02:35:53,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:53,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:35:53,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 02:35:53,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 02:35:53,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:53,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:35:53,729 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 02:35:53,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:35:53,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290331928] [2025-03-09 02:35:53,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290331928] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:35:53,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872206248] [2025-03-09 02:35:53,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:53,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:35:53,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:35:53,733 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:35:53,734 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:35:53,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 02:35:53,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 02:35:53,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:53,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:35:53,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-09 02:35:53,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:35:53,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 02:35:53,776 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:35:53,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872206248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:35:53,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:35:53,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-09 02:35:53,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200994969] [2025-03-09 02:35:53,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:35:53,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 02:35:53,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:35:53,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 02:35:53,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 02:35:53,793 INFO L87 Difference]: Start difference. First operand has 191 states, 99 states have (on average 1.8888888888888888) internal successors, (187), 183 states have internal predecessors, (187), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:35:53,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:35:53,810 INFO L93 Difference]: Finished difference Result 365 states and 394 transitions. [2025-03-09 02:35:53,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 02:35:53,812 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2025-03-09 02:35:53,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:35:53,817 INFO L225 Difference]: With dead ends: 365 [2025-03-09 02:35:53,817 INFO L226 Difference]: Without dead ends: 171 [2025-03-09 02:35:53,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 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:35:53,821 INFO L435 NwaCegarLoop]: 180 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, 180 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:35:53,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:35:53,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-09 02:35:53,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2025-03-09 02:35:53,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 94 states have (on average 1.7553191489361701) internal successors, (165), 164 states have internal predecessors, (165), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:35:53,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2025-03-09 02:35:53,855 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 14 [2025-03-09 02:35:53,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:35:53,855 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2025-03-09 02:35:53,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:35:53,856 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2025-03-09 02:35:53,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-09 02:35:53,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:35:53,856 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:35:53,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 02:35:54,057 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:35:54,057 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-09 02:35:54,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:35:54,058 INFO L85 PathProgramCache]: Analyzing trace with hash 249298298, now seen corresponding path program 1 times [2025-03-09 02:35:54,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:35:54,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064323900] [2025-03-09 02:35:54,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:54,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:35:54,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 02:35:54,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 02:35:54,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:54,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:35:54,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:35:54,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:35:54,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064323900] [2025-03-09 02:35:54,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064323900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:35:54,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:35:54,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:35:54,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618249618] [2025-03-09 02:35:54,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:35:54,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:35:54,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:35:54,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:35:54,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:35:54,129 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:35:54,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:35:54,450 INFO L93 Difference]: Finished difference Result 307 states and 319 transitions. [2025-03-09 02:35:54,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:35:54,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2025-03-09 02:35:54,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:35:54,451 INFO L225 Difference]: With dead ends: 307 [2025-03-09 02:35:54,451 INFO L226 Difference]: Without dead ends: 251 [2025-03-09 02:35:54,452 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:35:54,452 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 82 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:35:54,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 125 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:35:54,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-09 02:35:54,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 245. [2025-03-09 02:35:54,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 167 states have (on average 1.5089820359281436) internal successors, (252), 237 states have internal predecessors, (252), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:35:54,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 262 transitions. [2025-03-09 02:35:54,465 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 262 transitions. Word has length 14 [2025-03-09 02:35:54,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:35:54,465 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 262 transitions. [2025-03-09 02:35:54,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:35:54,465 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 262 transitions. [2025-03-09 02:35:54,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-09 02:35:54,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:35:54,466 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:54,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:35:54,466 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-09 02:35:54,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:35:54,467 INFO L85 PathProgramCache]: Analyzing trace with hash 277918430, now seen corresponding path program 1 times [2025-03-09 02:35:54,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:35:54,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4102381] [2025-03-09 02:35:54,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:54,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:35:54,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 02:35:54,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 02:35:54,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:54,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:35:54,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:35:54,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:35:54,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4102381] [2025-03-09 02:35:54,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4102381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:35:54,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:35:54,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:35:54,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654117433] [2025-03-09 02:35:54,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:35:54,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:35:54,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:35:54,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:35:54,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:35:54,556 INFO L87 Difference]: Start difference. First operand 245 states and 262 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:35:54,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:35:54,613 INFO L93 Difference]: Finished difference Result 264 states and 276 transitions. [2025-03-09 02:35:54,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:35:54,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2025-03-09 02:35:54,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:35:54,615 INFO L225 Difference]: With dead ends: 264 [2025-03-09 02:35:54,615 INFO L226 Difference]: Without dead ends: 259 [2025-03-09 02:35:54,615 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:35:54,616 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 58 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:35:54,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 294 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:35:54,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-09 02:35:54,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 252. [2025-03-09 02:35:54,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 174 states have (on average 1.4885057471264367) internal successors, (259), 244 states have internal predecessors, (259), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:35:54,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 269 transitions. [2025-03-09 02:35:54,630 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 269 transitions. Word has length 42 [2025-03-09 02:35:54,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:35:54,630 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 269 transitions. [2025-03-09 02:35:54,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:35:54,630 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 269 transitions. [2025-03-09 02:35:54,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-09 02:35:54,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:35:54,631 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:54,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:35:54,631 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-09 02:35:54,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:35:54,631 INFO L85 PathProgramCache]: Analyzing trace with hash 791641628, now seen corresponding path program 1 times [2025-03-09 02:35:54,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:35:54,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648299510] [2025-03-09 02:35:54,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:54,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:35:54,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 02:35:54,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 02:35:54,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:54,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:35:54,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:35:54,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:35:54,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648299510] [2025-03-09 02:35:54,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648299510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:35:54,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:35:54,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:35:54,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363231488] [2025-03-09 02:35:54,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:35:54,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:35:54,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:35:54,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:35:54,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:35:54,737 INFO L87 Difference]: Start difference. First operand 252 states and 269 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:35:54,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:35:54,878 INFO L93 Difference]: Finished difference Result 263 states and 271 transitions. [2025-03-09 02:35:54,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:35:54,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2025-03-09 02:35:54,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:35:54,880 INFO L225 Difference]: With dead ends: 263 [2025-03-09 02:35:54,880 INFO L226 Difference]: Without dead ends: 258 [2025-03-09 02:35:54,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:35:54,882 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 132 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:35:54,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 231 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:35:54,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-09 02:35:54,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 252. [2025-03-09 02:35:54,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 174 states have (on average 1.4597701149425288) internal successors, (254), 244 states have internal predecessors, (254), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:35:54,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 264 transitions. [2025-03-09 02:35:54,899 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 264 transitions. Word has length 44 [2025-03-09 02:35:54,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:35:54,899 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 264 transitions. [2025-03-09 02:35:54,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:35:54,900 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 264 transitions. [2025-03-09 02:35:54,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-09 02:35:54,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:35:54,900 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:54,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:35:54,900 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-09 02:35:54,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:35:54,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1228913226, now seen corresponding path program 1 times [2025-03-09 02:35:54,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:35:54,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322039021] [2025-03-09 02:35:54,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:54,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:35:54,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 02:35:54,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 02:35:54,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:54,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:35:54,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:35:54,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:35:54,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322039021] [2025-03-09 02:35:54,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322039021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:35:54,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:35:54,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:35:54,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391878626] [2025-03-09 02:35:54,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:35:54,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:35:54,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:35:54,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:35:54,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:35:54,990 INFO L87 Difference]: Start difference. First operand 252 states and 264 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:35:55,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:35:55,270 INFO L93 Difference]: Finished difference Result 262 states and 266 transitions. [2025-03-09 02:35:55,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:35:55,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2025-03-09 02:35:55,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:35:55,271 INFO L225 Difference]: With dead ends: 262 [2025-03-09 02:35:55,271 INFO L226 Difference]: Without dead ends: 224 [2025-03-09 02:35:55,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:35:55,272 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 81 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:35:55,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 265 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:35:55,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-09 02:35:55,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 218. [2025-03-09 02:35:55,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 140 states have (on average 1.542857142857143) internal successors, (216), 210 states have internal predecessors, (216), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:35:55,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 226 transitions. [2025-03-09 02:35:55,277 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 226 transitions. Word has length 45 [2025-03-09 02:35:55,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:35:55,278 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 226 transitions. [2025-03-09 02:35:55,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:35:55,278 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 226 transitions. [2025-03-09 02:35:55,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-09 02:35:55,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:35:55,279 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:55,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 02:35:55,279 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-09 02:35:55,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:35:55,279 INFO L85 PathProgramCache]: Analyzing trace with hash -218506347, now seen corresponding path program 1 times [2025-03-09 02:35:55,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:35:55,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397572251] [2025-03-09 02:35:55,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:55,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:35:55,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-09 02:35:55,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 02:35:55,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:55,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:35:55,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:35:55,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:35:55,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397572251] [2025-03-09 02:35:55,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397572251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:35:55,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:35:55,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:35:55,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356651590] [2025-03-09 02:35:55,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:35:55,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:35:55,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:35:55,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:35:55,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:35:55,330 INFO L87 Difference]: Start difference. First operand 218 states and 226 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:35:55,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:35:55,344 INFO L93 Difference]: Finished difference Result 220 states and 226 transitions. [2025-03-09 02:35:55,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:35:55,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2025-03-09 02:35:55,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:35:55,345 INFO L225 Difference]: With dead ends: 220 [2025-03-09 02:35:55,345 INFO L226 Difference]: Without dead ends: 218 [2025-03-09 02:35:55,345 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:35:55,346 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 1 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:35:55,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 335 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:35:55,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-09 02:35:55,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-03-09 02:35:55,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 140 states have (on average 1.5285714285714285) internal successors, (214), 210 states have internal predecessors, (214), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:35:55,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 224 transitions. [2025-03-09 02:35:55,355 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 224 transitions. Word has length 54 [2025-03-09 02:35:55,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:35:55,356 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 224 transitions. [2025-03-09 02:35:55,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:35:55,356 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 224 transitions. [2025-03-09 02:35:55,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-09 02:35:55,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:35:55,358 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:55,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 02:35:55,358 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-09 02:35:55,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:35:55,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1203634290, now seen corresponding path program 1 times [2025-03-09 02:35:55,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:35:55,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131093108] [2025-03-09 02:35:55,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:55,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:35:55,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 02:35:55,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 02:35:55,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:55,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:35:55,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1364457345] [2025-03-09 02:35:55,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:55,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:35:55,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:35:55,382 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:35:55,383 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:35:55,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 02:35:55,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 02:35:55,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:55,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:35:55,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:35:55,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:35:55,480 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:35:55,480 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:35:55,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:35:55,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131093108] [2025-03-09 02:35:55,480 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:35:55,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364457345] [2025-03-09 02:35:55,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364457345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:35:55,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:35:55,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:35:55,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607324875] [2025-03-09 02:35:55,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:35:55,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:35:55,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:35:55,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:35:55,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:35:55,481 INFO L87 Difference]: Start difference. First operand 218 states and 224 transitions. Second operand has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:35:55,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:35:55,769 INFO L93 Difference]: Finished difference Result 356 states and 372 transitions. [2025-03-09 02:35:55,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:35:55,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2025-03-09 02:35:55,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:35:55,771 INFO L225 Difference]: With dead ends: 356 [2025-03-09 02:35:55,771 INFO L226 Difference]: Without dead ends: 302 [2025-03-09 02:35:55,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:35:55,771 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 89 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:35:55,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 149 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:35:55,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-03-09 02:35:55,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 296. [2025-03-09 02:35:55,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 216 states have (on average 1.4074074074074074) internal successors, (304), 286 states have internal predecessors, (304), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-09 02:35:55,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 318 transitions. [2025-03-09 02:35:55,780 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 318 transitions. Word has length 59 [2025-03-09 02:35:55,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:35:55,780 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 318 transitions. [2025-03-09 02:35:55,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:35:55,781 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 318 transitions. [2025-03-09 02:35:55,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-09 02:35:55,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:35:55,781 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:55,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 02:35:55,982 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,SelfDestructingSolverStorable6 [2025-03-09 02:35:55,982 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-09 02:35:55,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:35:55,983 INFO L85 PathProgramCache]: Analyzing trace with hash -609393688, now seen corresponding path program 1 times [2025-03-09 02:35:55,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:35:55,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954889736] [2025-03-09 02:35:55,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:55,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:35:55,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-09 02:35:55,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-09 02:35:55,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:55,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:35:56,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:35:56,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:35:56,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954889736] [2025-03-09 02:35:56,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954889736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:35:56,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:35:56,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:35:56,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779214396] [2025-03-09 02:35:56,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:35:56,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:35:56,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:35:56,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:35:56,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:35:56,060 INFO L87 Difference]: Start difference. First operand 296 states and 318 transitions. Second operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:35:56,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:35:56,128 INFO L93 Difference]: Finished difference Result 297 states and 318 transitions. [2025-03-09 02:35:56,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:35:56,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2025-03-09 02:35:56,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:35:56,129 INFO L225 Difference]: With dead ends: 297 [2025-03-09 02:35:56,129 INFO L226 Difference]: Without dead ends: 296 [2025-03-09 02:35:56,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:35:56,130 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 38 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:35:56,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 278 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:35:56,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-09 02:35:56,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2025-03-09 02:35:56,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 216 states have (on average 1.4027777777777777) internal successors, (303), 286 states have internal predecessors, (303), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-09 02:35:56,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 317 transitions. [2025-03-09 02:35:56,138 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 317 transitions. Word has length 65 [2025-03-09 02:35:56,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:35:56,138 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 317 transitions. [2025-03-09 02:35:56,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:35:56,138 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 317 transitions. [2025-03-09 02:35:56,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-09 02:35:56,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:35:56,139 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:56,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 02:35:56,139 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-09 02:35:56,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:35:56,140 INFO L85 PathProgramCache]: Analyzing trace with hash -2104697332, now seen corresponding path program 1 times [2025-03-09 02:35:56,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:35:56,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385000432] [2025-03-09 02:35:56,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:56,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:35:56,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-09 02:35:56,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-09 02:35:56,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:56,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:35:56,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1543144743] [2025-03-09 02:35:56,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:56,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:35:56,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:35:56,166 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:35:56,167 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:35:56,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-09 02:35:56,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-09 02:35:56,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:56,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:35:56,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:35:56,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:35:56,324 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-09 02:35:56,325 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:35:56,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:35:56,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385000432] [2025-03-09 02:35:56,325 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:35:56,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543144743] [2025-03-09 02:35:56,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543144743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:35:56,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:35:56,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:35:56,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80853896] [2025-03-09 02:35:56,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:35:56,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:35:56,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:35:56,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:35:56,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:35:56,326 INFO L87 Difference]: Start difference. First operand 296 states and 317 transitions. Second operand has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:35:56,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:35:56,370 INFO L93 Difference]: Finished difference Result 296 states and 317 transitions. [2025-03-09 02:35:56,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:35:56,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 94 [2025-03-09 02:35:56,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:35:56,371 INFO L225 Difference]: With dead ends: 296 [2025-03-09 02:35:56,371 INFO L226 Difference]: Without dead ends: 293 [2025-03-09 02:35:56,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 91 SyntacticMatches, 1 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:35:56,372 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 95 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:35:56,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 158 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:35:56,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-09 02:35:56,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2025-03-09 02:35:56,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 216 states have (on average 1.3796296296296295) internal successors, (298), 283 states have internal predecessors, (298), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-09 02:35:56,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 312 transitions. [2025-03-09 02:35:56,379 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 312 transitions. Word has length 94 [2025-03-09 02:35:56,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:35:56,380 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 312 transitions. [2025-03-09 02:35:56,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:35:56,380 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 312 transitions. [2025-03-09 02:35:56,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-09 02:35:56,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:35:56,381 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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:35:56,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 02:35:56,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:35:56,585 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-09 02:35:56,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:35:56,585 INFO L85 PathProgramCache]: Analyzing trace with hash -821107766, now seen corresponding path program 1 times [2025-03-09 02:35:56,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:35:56,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906234911] [2025-03-09 02:35:56,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:56,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:35:56,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-09 02:35:56,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-09 02:35:56,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:56,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:35:56,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2114191206] [2025-03-09 02:35:56,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:56,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:35:56,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:35:56,609 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:35:56,611 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:35:56,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-09 02:35:56,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-09 02:35:56,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:56,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:35:56,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 02:35:56,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:35:56,868 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:35:56,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:35:57,030 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:35:57,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:35:57,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906234911] [2025-03-09 02:35:57,031 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:35:57,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114191206] [2025-03-09 02:35:57,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114191206] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:35:57,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:35:57,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-09 02:35:57,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900194178] [2025-03-09 02:35:57,031 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:35:57,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:35:57,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:35:57,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:35:57,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:35:57,035 INFO L87 Difference]: Start difference. First operand 293 states and 312 transitions. Second operand has 8 states, 7 states have (on average 23.428571428571427) internal successors, (164), 8 states have internal predecessors, (164), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 02:35:57,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:35:57,608 INFO L93 Difference]: Finished difference Result 364 states and 379 transitions. [2025-03-09 02:35:57,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:35:57,612 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 23.428571428571427) internal successors, (164), 8 states have internal predecessors, (164), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 95 [2025-03-09 02:35:57,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:35:57,614 INFO L225 Difference]: With dead ends: 364 [2025-03-09 02:35:57,614 INFO L226 Difference]: Without dead ends: 357 [2025-03-09 02:35:57,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:35:57,615 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 285 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 02:35:57,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 310 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 02:35:57,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-09 02:35:57,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 330. [2025-03-09 02:35:57,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 254 states have (on average 1.4015748031496063) internal successors, (356), 320 states have internal predecessors, (356), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-09 02:35:57,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 370 transitions. [2025-03-09 02:35:57,625 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 370 transitions. Word has length 95 [2025-03-09 02:35:57,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:35:57,626 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 370 transitions. [2025-03-09 02:35:57,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 23.428571428571427) internal successors, (164), 8 states have internal predecessors, (164), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 02:35:57,626 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 370 transitions. [2025-03-09 02:35:57,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-09 02:35:57,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:35:57,627 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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:35:57,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 02:35:57,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:35:57,828 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-09 02:35:57,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:35:57,828 INFO L85 PathProgramCache]: Analyzing trace with hash 315463114, now seen corresponding path program 1 times [2025-03-09 02:35:57,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:35:57,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606935029] [2025-03-09 02:35:57,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:57,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:35:57,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-09 02:35:57,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-09 02:35:57,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:57,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:35:57,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [603276118] [2025-03-09 02:35:57,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:35:57,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:35:57,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:35:57,855 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:35:57,857 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:35:57,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-09 02:35:57,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-09 02:35:57,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:35:57,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:35:57,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 02:35:57,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:35:58,126 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:35:58,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:35:58,778 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:35:58,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:35:58,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606935029] [2025-03-09 02:35:58,778 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:35:58,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603276118] [2025-03-09 02:35:58,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603276118] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 02:35:58,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:35:58,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2025-03-09 02:35:58,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259312106] [2025-03-09 02:35:58,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:35:58,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:35:58,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:35:58,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:35:58,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:35:58,780 INFO L87 Difference]: Start difference. First operand 330 states and 370 transitions. Second operand has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:36:01,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:36:05,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:36:09,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:36:14,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:36:16,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:36:19,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:36:21,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:36:24,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:36:26,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:36:28,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:36:31,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:36:33,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:36:33,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:36:33,867 INFO L93 Difference]: Finished difference Result 330 states and 370 transitions. [2025-03-09 02:36:33,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:36:33,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 96 [2025-03-09 02:36:33,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:36:33,869 INFO L225 Difference]: With dead ends: 330 [2025-03-09 02:36:33,869 INFO L226 Difference]: Without dead ends: 328 [2025-03-09 02:36:33,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:36:33,869 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 145 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 8 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:36:33,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 81 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 482 Invalid, 3 Unknown, 0 Unchecked, 35.0s Time] [2025-03-09 02:36:33,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-09 02:36:33,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2025-03-09 02:36:33,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 254 states have (on average 1.3858267716535433) internal successors, (352), 318 states have internal predecessors, (352), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-09 02:36:33,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 366 transitions. [2025-03-09 02:36:33,877 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 366 transitions. Word has length 96 [2025-03-09 02:36:33,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:36:33,877 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 366 transitions. [2025-03-09 02:36:33,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:36:33,877 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 366 transitions. [2025-03-09 02:36:33,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-09 02:36:33,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:36:33,878 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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:36:33,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 02:36:34,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-09 02:36:34,079 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-09 02:36:34,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:36:34,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1189422024, now seen corresponding path program 1 times [2025-03-09 02:36:34,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:36:34,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760255719] [2025-03-09 02:36:34,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:34,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:36:34,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-09 02:36:34,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-09 02:36:34,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:36:34,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:36:34,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [498650622] [2025-03-09 02:36:34,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:34,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:36:34,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:36:34,103 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:36:34,104 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:36:34,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-09 02:36:34,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-09 02:36:34,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:36:34,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:36:34,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:36:34,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:36:34,246 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:36:34,246 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:36:34,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:36:34,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760255719] [2025-03-09 02:36:34,246 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:36:34,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498650622] [2025-03-09 02:36:34,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498650622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:36:34,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:36:34,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:36:34,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507725474] [2025-03-09 02:36:34,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:36:34,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:36:34,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:36:34,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:36:34,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:36:34,247 INFO L87 Difference]: Start difference. First operand 328 states and 366 transitions. Second operand has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:36:34,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:36:34,465 INFO L93 Difference]: Finished difference Result 328 states and 366 transitions. [2025-03-09 02:36:34,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:36:34,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 97 [2025-03-09 02:36:34,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:36:34,467 INFO L225 Difference]: With dead ends: 328 [2025-03-09 02:36:34,467 INFO L226 Difference]: Without dead ends: 308 [2025-03-09 02:36:34,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:36:34,467 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 200 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:36:34,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 46 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:36:34,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-09 02:36:34,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2025-03-09 02:36:34,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 254 states have (on average 1.2677165354330708) internal successors, (322), 298 states have internal predecessors, (322), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-09 02:36:34,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 336 transitions. [2025-03-09 02:36:34,475 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 336 transitions. Word has length 97 [2025-03-09 02:36:34,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:36:34,476 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 336 transitions. [2025-03-09 02:36:34,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:36:34,476 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 336 transitions. [2025-03-09 02:36:34,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-09 02:36:34,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:36:34,477 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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:36:34,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 02:36:34,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:36:34,678 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-09 02:36:34,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:36:34,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1782622840, now seen corresponding path program 1 times [2025-03-09 02:36:34,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:36:34,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939697398] [2025-03-09 02:36:34,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:34,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:36:34,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-09 02:36:34,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-09 02:36:34,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:36:34,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:36:34,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1892492914] [2025-03-09 02:36:34,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:34,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:36:34,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:36:34,699 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:36:34,700 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:36:34,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-09 02:36:34,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-09 02:36:34,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:36:34,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:36:34,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 02:36:34,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:36:34,915 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:36:34,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:36:35,083 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-09 02:36:35,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:36:35,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939697398] [2025-03-09 02:36:35,084 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:36:35,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892492914] [2025-03-09 02:36:35,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892492914] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 02:36:35,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:36:35,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-09 02:36:35,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72362284] [2025-03-09 02:36:35,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:36:35,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:36:35,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:36:35,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:36:35,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:36:35,086 INFO L87 Difference]: Start difference. First operand 308 states and 336 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:36:37,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:36:42,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:36:44,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:36:49,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:36:52,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-09 02:36:52,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:36:52,414 INFO L93 Difference]: Finished difference Result 308 states and 336 transitions. [2025-03-09 02:36:52,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:36:52,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 98 [2025-03-09 02:36:52,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:36:52,416 INFO L225 Difference]: With dead ends: 308 [2025-03-09 02:36:52,416 INFO L226 Difference]: Without dead ends: 306 [2025-03-09 02:36:52,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:36:52,416 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 78 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:36:52,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 55 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 279 Invalid, 2 Unknown, 0 Unchecked, 17.3s Time] [2025-03-09 02:36:52,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-09 02:36:52,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2025-03-09 02:36:52,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 254 states have (on average 1.2519685039370079) internal successors, (318), 296 states have internal predecessors, (318), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-09 02:36:52,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 332 transitions. [2025-03-09 02:36:52,426 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 332 transitions. Word has length 98 [2025-03-09 02:36:52,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:36:52,427 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 332 transitions. [2025-03-09 02:36:52,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:36:52,427 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 332 transitions. [2025-03-09 02:36:52,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-09 02:36:52,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:36:52,428 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:36:52,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 02:36:52,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:36:52,633 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-09 02:36:52,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:36:52,633 INFO L85 PathProgramCache]: Analyzing trace with hash 681095619, now seen corresponding path program 1 times [2025-03-09 02:36:52,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:36:52,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693933147] [2025-03-09 02:36:52,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:52,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:36:52,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-09 02:36:52,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-09 02:36:52,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:36:52,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:36:52,740 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 02:36:52,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:36:52,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693933147] [2025-03-09 02:36:52,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693933147] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:36:52,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033454757] [2025-03-09 02:36:52,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:52,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:36:52,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:36:52,743 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:36:52,744 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:36:52,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-09 02:36:52,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-09 02:36:52,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:36:52,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:36:52,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:36:52,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:36:52,848 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 02:36:52,848 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:36:52,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033454757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:36:52,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:36:52,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 02:36:52,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200675707] [2025-03-09 02:36:52,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:36:52,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:36:52,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:36:52,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:36:52,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:36:52,849 INFO L87 Difference]: Start difference. First operand 306 states and 332 transitions. Second operand has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 4 states have internal predecessors, (92), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 02:36:52,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:36:52,867 INFO L93 Difference]: Finished difference Result 306 states and 332 transitions. [2025-03-09 02:36:52,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:36:52,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 4 states have internal predecessors, (92), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 106 [2025-03-09 02:36:52,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:36:52,869 INFO L225 Difference]: With dead ends: 306 [2025-03-09 02:36:52,869 INFO L226 Difference]: Without dead ends: 305 [2025-03-09 02:36:52,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:36:52,869 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 25 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:36:52,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 347 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:36:52,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-03-09 02:36:52,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2025-03-09 02:36:52,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 254 states have (on average 1.2440944881889764) internal successors, (316), 295 states have internal predecessors, (316), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-09 02:36:52,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 330 transitions. [2025-03-09 02:36:52,877 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 330 transitions. Word has length 106 [2025-03-09 02:36:52,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:36:52,877 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 330 transitions. [2025-03-09 02:36:52,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 4 states have internal predecessors, (92), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 02:36:52,877 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 330 transitions. [2025-03-09 02:36:52,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-09 02:36:52,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:36:52,878 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:36:52,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 02:36:53,082 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,SelfDestructingSolverStorable13 [2025-03-09 02:36:53,082 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-09 02:36:53,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:36:53,082 INFO L85 PathProgramCache]: Analyzing trace with hash -360872220, now seen corresponding path program 1 times [2025-03-09 02:36:53,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:36:53,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662980914] [2025-03-09 02:36:53,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:53,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:36:53,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-09 02:36:53,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-09 02:36:53,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:36:53,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:36:53,141 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 02:36:53,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:36:53,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662980914] [2025-03-09 02:36:53,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662980914] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:36:53,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717716113] [2025-03-09 02:36:53,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:53,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:36:53,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:36:53,144 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:36:53,145 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:36:53,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-09 02:36:53,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-09 02:36:53,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:36:53,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:36:53,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:36:53,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:36:53,238 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 02:36:53,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:36:53,325 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 02:36:53,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717716113] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:36:53,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:36:53,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 02:36:53,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085792694] [2025-03-09 02:36:53,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:36:53,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:36:53,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:36:53,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:36:53,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:36:53,327 INFO L87 Difference]: Start difference. First operand 305 states and 330 transitions. Second operand has 7 states, 6 states have (on average 36.0) internal successors, (216), 7 states have internal predecessors, (216), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-09 02:36:53,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:36:53,360 INFO L93 Difference]: Finished difference Result 403 states and 416 transitions. [2025-03-09 02:36:53,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:36:53,361 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 36.0) internal successors, (216), 7 states have internal predecessors, (216), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 107 [2025-03-09 02:36:53,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:36:53,362 INFO L225 Difference]: With dead ends: 403 [2025-03-09 02:36:53,362 INFO L226 Difference]: Without dead ends: 402 [2025-03-09 02:36:53,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:36:53,363 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 51 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:36:53,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 729 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:36:53,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-03-09 02:36:53,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 361. [2025-03-09 02:36:53,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 308 states have (on average 1.2824675324675325) internal successors, (395), 349 states have internal predecessors, (395), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 02:36:53,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 413 transitions. [2025-03-09 02:36:53,372 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 413 transitions. Word has length 107 [2025-03-09 02:36:53,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:36:53,372 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 413 transitions. [2025-03-09 02:36:53,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 36.0) internal successors, (216), 7 states have internal predecessors, (216), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-09 02:36:53,372 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 413 transitions. [2025-03-09 02:36:53,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-09 02:36:53,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:36:53,373 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:36:53,379 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:36:53,573 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,SelfDestructingSolverStorable14 [2025-03-09 02:36:53,574 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-09 02:36:53,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:36:53,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1248322858, now seen corresponding path program 1 times [2025-03-09 02:36:53,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:36:53,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418880027] [2025-03-09 02:36:53,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:53,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:36:53,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-09 02:36:53,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-09 02:36:53,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:36:53,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:36:53,626 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-09 02:36:53,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:36:53,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418880027] [2025-03-09 02:36:53,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418880027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:36:53,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:36:53,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:36:53,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267586894] [2025-03-09 02:36:53,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:36:53,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:36:53,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:36:53,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:36:53,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:36:53,627 INFO L87 Difference]: Start difference. First operand 361 states and 413 transitions. Second operand has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:36:53,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:36:53,764 INFO L93 Difference]: Finished difference Result 361 states and 413 transitions. [2025-03-09 02:36:53,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:36:53,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 118 [2025-03-09 02:36:53,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:36:53,766 INFO L225 Difference]: With dead ends: 361 [2025-03-09 02:36:53,766 INFO L226 Difference]: Without dead ends: 354 [2025-03-09 02:36:53,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:36:53,766 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 78 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:36:53,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 53 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:36:53,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-09 02:36:53,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2025-03-09 02:36:53,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 308 states have (on average 1.2370129870129871) internal successors, (381), 342 states have internal predecessors, (381), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 02:36:53,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 399 transitions. [2025-03-09 02:36:53,775 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 399 transitions. Word has length 118 [2025-03-09 02:36:53,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:36:53,775 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 399 transitions. [2025-03-09 02:36:53,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:36:53,776 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 399 transitions. [2025-03-09 02:36:53,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-09 02:36:53,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:36:53,776 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:36:53,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 02:36:53,776 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-09 02:36:53,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:36:53,777 INFO L85 PathProgramCache]: Analyzing trace with hash -43302792, now seen corresponding path program 1 times [2025-03-09 02:36:53,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:36:53,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351475432] [2025-03-09 02:36:53,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:53,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:36:53,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-09 02:36:53,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-09 02:36:53,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:36:53,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:36:53,820 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-09 02:36:53,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:36:53,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351475432] [2025-03-09 02:36:53,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351475432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:36:53,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:36:53,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:36:53,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737949044] [2025-03-09 02:36:53,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:36:53,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:36:53,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:36:53,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:36:53,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:36:53,821 INFO L87 Difference]: Start difference. First operand 354 states and 399 transitions. Second operand has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:36:53,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:36:53,932 INFO L93 Difference]: Finished difference Result 354 states and 399 transitions. [2025-03-09 02:36:53,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:36:53,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 119 [2025-03-09 02:36:53,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:36:53,934 INFO L225 Difference]: With dead ends: 354 [2025-03-09 02:36:53,934 INFO L226 Difference]: Without dead ends: 353 [2025-03-09 02:36:53,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:36:53,934 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 107 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:36:53,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 40 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:36:53,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-09 02:36:53,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2025-03-09 02:36:53,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 308 states have (on average 1.2272727272727273) internal successors, (378), 341 states have internal predecessors, (378), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 02:36:53,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 396 transitions. [2025-03-09 02:36:53,944 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 396 transitions. Word has length 119 [2025-03-09 02:36:53,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:36:53,944 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 396 transitions. [2025-03-09 02:36:53,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:36:53,944 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 396 transitions. [2025-03-09 02:36:53,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-09 02:36:53,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:36:53,945 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:36:53,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 02:36:53,945 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-09 02:36:53,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:36:53,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1335694326, now seen corresponding path program 1 times [2025-03-09 02:36:53,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:36:53,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630783050] [2025-03-09 02:36:53,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:53,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:36:53,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-09 02:36:53,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-09 02:36:53,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:36:53,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:36:54,104 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 20 proven. 39 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 02:36:54,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:36:54,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630783050] [2025-03-09 02:36:54,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630783050] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:36:54,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213765866] [2025-03-09 02:36:54,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:54,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:36:54,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:36:54,107 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:36:54,108 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:36:54,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-09 02:36:54,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-09 02:36:54,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:36:54,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:36:54,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:36:54,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:36:54,435 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 02:36:54,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:36:54,555 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 02:36:54,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213765866] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:36:54,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:36:54,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-09 02:36:54,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46453944] [2025-03-09 02:36:54,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:36:54,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 02:36:54,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:36:54,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 02:36:54,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:36:54,557 INFO L87 Difference]: Start difference. First operand 353 states and 396 transitions. Second operand has 13 states, 13 states have (on average 21.384615384615383) internal successors, (278), 11 states have internal predecessors, (278), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2025-03-09 02:36:54,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:36:54,616 INFO L93 Difference]: Finished difference Result 361 states and 401 transitions. [2025-03-09 02:36:54,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:36:54,616 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 21.384615384615383) internal successors, (278), 11 states have internal predecessors, (278), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 121 [2025-03-09 02:36:54,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:36:54,617 INFO L225 Difference]: With dead ends: 361 [2025-03-09 02:36:54,617 INFO L226 Difference]: Without dead ends: 138 [2025-03-09 02:36:54,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-09 02:36:54,618 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 37 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:36:54,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 556 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:36:54,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-09 02:36:54,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2025-03-09 02:36:54,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 127 states have (on average 1.0078740157480315) internal successors, (128), 128 states have internal predecessors, (128), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:36:54,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2025-03-09 02:36:54,623 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 121 [2025-03-09 02:36:54,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:36:54,623 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2025-03-09 02:36:54,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 21.384615384615383) internal successors, (278), 11 states have internal predecessors, (278), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2025-03-09 02:36:54,623 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2025-03-09 02:36:54,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-09 02:36:54,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:36:54,624 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:54,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 02:36:54,828 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,SelfDestructingSolverStorable17 [2025-03-09 02:36:54,828 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-09 02:36:54,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:36:54,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1237571047, now seen corresponding path program 1 times [2025-03-09 02:36:54,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:36:54,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540273047] [2025-03-09 02:36:54,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:54,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:36:54,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-09 02:36:54,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-09 02:36:54,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:36:54,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:36:54,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [73425634] [2025-03-09 02:36:54,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:54,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:36:54,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:36:54,846 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:36:54,847 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:36:54,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-09 02:36:54,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-09 02:36:54,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:36:54,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:36:54,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 02:36:54,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:36:55,131 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 02:36:55,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:36:55,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:36:55,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540273047] [2025-03-09 02:36:55,639 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:36:55,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73425634] [2025-03-09 02:36:55,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73425634] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:36:55,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:36:55,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-09 02:36:55,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921956617] [2025-03-09 02:36:55,639 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 02:36:55,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:36:55,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:36:55,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:36:55,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:36:55,640 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand has 7 states, 6 states have (on average 21.0) internal successors, (126), 7 states have internal predecessors, (126), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-09 02:36:55,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:36:55,760 INFO L93 Difference]: Finished difference Result 136 states and 138 transitions. [2025-03-09 02:36:55,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:36:55,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 21.0) internal successors, (126), 7 states have internal predecessors, (126), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 145 [2025-03-09 02:36:55,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:36:55,761 INFO L225 Difference]: With dead ends: 136 [2025-03-09 02:36:55,761 INFO L226 Difference]: Without dead ends: 135 [2025-03-09 02:36:55,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:36:55,762 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 17 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:36:55,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 153 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:36:55,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-09 02:36:55,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-03-09 02:36:55,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 127 states have (on average 1.0) internal successors, (127), 127 states have internal predecessors, (127), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:36:55,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 137 transitions. [2025-03-09 02:36:55,768 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 137 transitions. Word has length 145 [2025-03-09 02:36:55,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:36:55,769 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 137 transitions. [2025-03-09 02:36:55,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 21.0) internal successors, (126), 7 states have internal predecessors, (126), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-09 02:36:55,769 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 137 transitions. [2025-03-09 02:36:55,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-09 02:36:55,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:36:55,770 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:55,777 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:36:55,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:36:55,971 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-09 02:36:55,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:36:55,971 INFO L85 PathProgramCache]: Analyzing trace with hash -290003229, now seen corresponding path program 1 times [2025-03-09 02:36:55,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:36:55,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798215591] [2025-03-09 02:36:55,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:55,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:36:55,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-09 02:36:55,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-09 02:36:55,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:36:55,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:36:55,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [798562503] [2025-03-09 02:36:55,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:36:55,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:36:55,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:36:55,988 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:36:55,990 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:36:56,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-09 02:36:56,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-09 02:36:56,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:36:56,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:36:56,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 02:36:56,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:36:56,275 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-09 02:36:56,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:36:56,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:36:56,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798215591] [2025-03-09 02:36:56,949 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:36:56,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798562503] [2025-03-09 02:36:56,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798562503] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:36:56,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:36:56,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-09 02:36:56,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869130702] [2025-03-09 02:36:56,949 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 02:36:56,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:36:56,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:36:56,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:36:56,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:36:56,950 INFO L87 Difference]: Start difference. First operand 135 states and 137 transitions. Second operand has 7 states, 6 states have (on average 21.166666666666668) internal successors, (127), 7 states have internal predecessors, (127), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-09 02:36:57,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:36:57,113 INFO L93 Difference]: Finished difference Result 135 states and 137 transitions. [2025-03-09 02:36:57,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:36:57,113 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 21.166666666666668) internal successors, (127), 7 states have internal predecessors, (127), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 146 [2025-03-09 02:36:57,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:36:57,114 INFO L225 Difference]: With dead ends: 135 [2025-03-09 02:36:57,114 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 02:36:57,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:36:57,114 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 17 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:36:57,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 171 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:36:57,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 02:36:57,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 02:36:57,115 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:36:57,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 02:36:57,115 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 146 [2025-03-09 02:36:57,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:36:57,115 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 02:36:57,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 21.166666666666668) internal successors, (127), 7 states have internal predecessors, (127), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-09 02:36:57,115 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 02:36:57,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 02:36:57,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 84 remaining) [2025-03-09 02:36:57,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 84 remaining) [2025-03-09 02:36:57,117 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 84 remaining) [2025-03-09 02:36:57,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 84 remaining) [2025-03-09 02:36:57,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 84 remaining) [2025-03-09 02:36:57,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 84 remaining) [2025-03-09 02:36:57,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 84 remaining) [2025-03-09 02:36:57,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 84 remaining) [2025-03-09 02:36:57,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 84 remaining) [2025-03-09 02:36:57,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 84 remaining) [2025-03-09 02:36:57,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 84 remaining) [2025-03-09 02:36:57,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 84 remaining) [2025-03-09 02:36:57,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 84 remaining) [2025-03-09 02:36:57,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 84 remaining) [2025-03-09 02:36:57,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 84 remaining) [2025-03-09 02:36:57,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 84 remaining) [2025-03-09 02:36:57,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 84 remaining) [2025-03-09 02:36:57,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 84 remaining) [2025-03-09 02:36:57,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 84 remaining) [2025-03-09 02:36:57,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 84 remaining) [2025-03-09 02:36:57,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 84 remaining) [2025-03-09 02:36:57,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 84 remaining) [2025-03-09 02:36:57,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 84 remaining) [2025-03-09 02:36:57,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 84 remaining) [2025-03-09 02:36:57,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 84 remaining) [2025-03-09 02:36:57,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 84 remaining) [2025-03-09 02:36:57,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 84 remaining) [2025-03-09 02:36:57,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 84 remaining) [2025-03-09 02:36:57,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 84 remaining) [2025-03-09 02:36:57,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 84 remaining) [2025-03-09 02:36:57,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 84 remaining) [2025-03-09 02:36:57,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 84 remaining) [2025-03-09 02:36:57,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 84 remaining) [2025-03-09 02:36:57,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 84 remaining) [2025-03-09 02:36:57,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 84 remaining) [2025-03-09 02:36:57,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 84 remaining) [2025-03-09 02:36:57,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 84 remaining) [2025-03-09 02:36:57,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 84 remaining) [2025-03-09 02:36:57,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 84 remaining) [2025-03-09 02:36:57,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 84 remaining) [2025-03-09 02:36:57,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 84 remaining) [2025-03-09 02:36:57,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 84 remaining) [2025-03-09 02:36:57,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 84 remaining) [2025-03-09 02:36:57,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 84 remaining) [2025-03-09 02:36:57,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 84 remaining) [2025-03-09 02:36:57,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 84 remaining) [2025-03-09 02:36:57,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 84 remaining) [2025-03-09 02:36:57,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 84 remaining) [2025-03-09 02:36:57,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 84 remaining) [2025-03-09 02:36:57,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 84 remaining) [2025-03-09 02:36:57,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 84 remaining) [2025-03-09 02:36:57,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 84 remaining) [2025-03-09 02:36:57,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 84 remaining) [2025-03-09 02:36:57,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 84 remaining) [2025-03-09 02:36:57,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 84 remaining) [2025-03-09 02:36:57,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 84 remaining) [2025-03-09 02:36:57,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 84 remaining) [2025-03-09 02:36:57,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 84 remaining) [2025-03-09 02:36:57,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 84 remaining) [2025-03-09 02:36:57,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 84 remaining) [2025-03-09 02:36:57,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 84 remaining) [2025-03-09 02:36:57,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 84 remaining) [2025-03-09 02:36:57,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 84 remaining) [2025-03-09 02:36:57,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 84 remaining) [2025-03-09 02:36:57,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 84 remaining) [2025-03-09 02:36:57,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 84 remaining) [2025-03-09 02:36:57,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 84 remaining) [2025-03-09 02:36:57,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 84 remaining) [2025-03-09 02:36:57,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 84 remaining) [2025-03-09 02:36:57,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 84 remaining) [2025-03-09 02:36:57,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 84 remaining) [2025-03-09 02:36:57,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 84 remaining) [2025-03-09 02:36:57,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 84 remaining) [2025-03-09 02:36:57,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 84 remaining) [2025-03-09 02:36:57,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 84 remaining) [2025-03-09 02:36:57,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 84 remaining) [2025-03-09 02:36:57,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 84 remaining) [2025-03-09 02:36:57,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 84 remaining) [2025-03-09 02:36:57,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 84 remaining) [2025-03-09 02:36:57,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 84 remaining) [2025-03-09 02:36:57,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 84 remaining) [2025-03-09 02:36:57,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 84 remaining) [2025-03-09 02:36:57,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 84 remaining) [2025-03-09 02:36:57,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 84 remaining) [2025-03-09 02:36:57,130 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:36:57,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:36:57,325 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:36:57,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 02:36:57,378 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 02:36:57,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 02:36:57 BoogieIcfgContainer [2025-03-09 02:36:57,389 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 02:36:57,390 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 02:36:57,390 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 02:36:57,390 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 02:36:57,390 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:35:53" (3/4) ... [2025-03-09 02:36:57,391 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 02:36:57,398 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-09 02:36:57,398 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-09 02:36:57,402 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-09 02:36:57,402 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 02:36:57,402 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 02:36:57,402 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 02:36:57,466 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 02:36:57,466 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 02:36:57,466 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 02:36:57,466 INFO L158 Benchmark]: Toolchain (without parser) took 64622.27ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 113.7MB in the beginning and 386.7MB in the end (delta: -273.0MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2025-03-09 02:36:57,466 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:36:57,467 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.22ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 102.4MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:36:57,467 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.94ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 100.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:36:57,467 INFO L158 Benchmark]: Boogie Preprocessor took 35.72ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 99.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:36:57,467 INFO L158 Benchmark]: IcfgBuilder took 471.30ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 69.7MB in the end (delta: 29.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-09 02:36:57,467 INFO L158 Benchmark]: TraceAbstraction took 63821.89ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 69.2MB in the beginning and 394.9MB in the end (delta: -325.7MB). Peak memory consumption was 204.3MB. Max. memory is 16.1GB. [2025-03-09 02:36:57,468 INFO L158 Benchmark]: Witness Printer took 76.21ms. Allocated memory is still 427.8MB. Free memory was 394.9MB in the beginning and 386.7MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:36:57,468 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.43ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 174.22ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 102.4MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.94ms. Allocated memory is still 142.6MB. Free memory was 102.4MB in the beginning and 100.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.72ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 99.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 471.30ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 69.7MB in the end (delta: 29.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 63821.89ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 69.2MB in the beginning and 394.9MB in the end (delta: -325.7MB). Peak memory consumption was 204.3MB. Max. memory is 16.1GB. * Witness Printer took 76.21ms. Allocated memory is still 427.8MB. Free memory was 394.9MB in the beginning and 386.7MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: 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 3 procedures, 191 locations, 202 edges, 84 error locations. Started 1 CEGAR loops. OverallTime: 63.7s, OverallIterations: 20, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 55.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 1637 SdHoareTripleChecker+Valid, 54.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1616 mSDsluCounter, 4556 SdHoareTripleChecker+Invalid, 54.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2616 mSDsCounter, 186 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3958 IncrementalHoareTripleChecker+Invalid, 4149 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 186 mSolverCounterUnsat, 1940 mSDtfsCounter, 3958 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1907 GetRequests, 1825 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=361occurred in iteration=15, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 101 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 2857 NumberOfCodeBlocks, 2857 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2515 ConstructedInterpolants, 0 QuantifiedInterpolants, 16903 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1728 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 29 InterpolantComputations, 15 PerfectInterpolantSequences, 565/959 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 84 specifications checked. All of them hold - InvariantResult [Line: 28]: Location Invariant Derived location invariant: (((((k == 1) && (c == 1)) && (x == 1)) && (y == 1)) || (((((0 <= k) && (c == 0)) && (k <= 1)) && (y == 0)) && (x == 0))) RESULT: Ultimate proved your program to be correct! [2025-03-09 02:36:57,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE