./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound1.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_unwindbound1.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 7bf1fedabded59b54ffeedfdca15b4d2afc329082dbabcf446dea84149cd8668 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:34:46,958 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:34:47,010 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:34:47,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:34:47,014 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:34:47,038 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:34:47,038 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:34:47,039 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:34:47,039 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:34:47,039 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:34:47,039 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:34:47,039 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:34:47,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:34:47,039 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:34:47,039 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:34:47,039 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:34:47,039 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:34:47,039 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:34:47,039 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:34:47,039 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:34:47,039 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:34:47,040 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:34:47,040 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:34:47,040 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:34:47,040 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:34:47,040 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:34:47,040 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:34:47,040 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:34:47,040 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:34:47,040 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:34:47,040 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:34:47,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:34:47,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:34:47,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:34:47,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:34:47,040 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:34:47,042 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:34:47,042 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:34:47,042 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:34:47,042 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:34:47,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:34:47,043 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:34:47,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:34:47,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:34:47,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:34:47,043 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 -> 7bf1fedabded59b54ffeedfdca15b4d2afc329082dbabcf446dea84149cd8668 [2025-03-09 02:34:47,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:34:47,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:34:47,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:34:47,254 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:34:47,254 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:34:47,255 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound1.c [2025-03-09 02:34:48,327 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/451b7a9f0/7f1ce629efdb4a9d89913e4f3e898c5e/FLAG71b36a762 [2025-03-09 02:34:48,528 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:34:48,528 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_unwindbound1.c [2025-03-09 02:34:48,536 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/451b7a9f0/7f1ce629efdb4a9d89913e4f3e898c5e/FLAG71b36a762 [2025-03-09 02:34:48,574 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/451b7a9f0/7f1ce629efdb4a9d89913e4f3e898c5e [2025-03-09 02:34:48,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:34:48,583 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:34:48,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:34:48,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:34:48,589 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:34:48,590 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:34:48" (1/1) ... [2025-03-09 02:34:48,591 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4289cee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:34:48, skipping insertion in model container [2025-03-09 02:34:48,591 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:34:48" (1/1) ... [2025-03-09 02:34:48,604 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:34:48,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:34:48,733 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:34:48,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:34:48,760 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:34:48,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:34:48 WrapperNode [2025-03-09 02:34:48,761 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:34:48,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:34:48,762 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:34:48,762 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:34:48,765 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:34:48" (1/1) ... [2025-03-09 02:34:48,770 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:34:48" (1/1) ... [2025-03-09 02:34:48,788 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 134 [2025-03-09 02:34:48,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:34:48,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:34:48,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:34:48,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:34:48,796 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:34:48" (1/1) ... [2025-03-09 02:34:48,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:34:48" (1/1) ... [2025-03-09 02:34:48,798 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:34:48" (1/1) ... [2025-03-09 02:34:48,808 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:34:48,808 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:34:48" (1/1) ... [2025-03-09 02:34:48,808 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:34:48" (1/1) ... [2025-03-09 02:34:48,810 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:34:48" (1/1) ... [2025-03-09 02:34:48,812 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:34:48" (1/1) ... [2025-03-09 02:34:48,813 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:34:48" (1/1) ... [2025-03-09 02:34:48,813 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:34:48" (1/1) ... [2025-03-09 02:34:48,814 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:34:48,815 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:34:48,815 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:34:48,815 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:34:48,815 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:34:48" (1/1) ... [2025-03-09 02:34:48,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:34:48,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:34:48,839 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:34:48,841 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:34:48,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:34:48,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:34:48,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:34:48,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:34:48,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 02:34:48,858 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 02:34:48,894 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:34:48,896 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:34:49,270 INFO L? ?]: Removed 92 outVars from TransFormulas that were not future-live. [2025-03-09 02:34:49,270 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:34:49,280 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:34:49,280 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:34:49,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:34:49 BoogieIcfgContainer [2025-03-09 02:34:49,281 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:34:49,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:34:49,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:34:49,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:34:49,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:34:48" (1/3) ... [2025-03-09 02:34:49,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@559d0bc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:34:49, skipping insertion in model container [2025-03-09 02:34:49,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:34:48" (2/3) ... [2025-03-09 02:34:49,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@559d0bc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:34:49, skipping insertion in model container [2025-03-09 02:34:49,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:34:49" (3/3) ... [2025-03-09 02:34:49,287 INFO L128 eAbstractionObserver]: Analyzing ICFG ps5-ll_unwindbound1.c [2025-03-09 02:34:49,298 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:34:49,300 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps5-ll_unwindbound1.c that has 2 procedures, 192 locations, 1 initial locations, 1 loop locations, and 86 error locations. [2025-03-09 02:34:49,337 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:34:49,344 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;@4add69b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:34:49,344 INFO L334 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2025-03-09 02:34:49,347 INFO L276 IsEmpty]: Start isEmpty. Operand has 192 states, 101 states have (on average 1.900990099009901) internal successors, (192), 187 states have internal predecessors, (192), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:34:49,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 02:34:49,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:49,351 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 02:34:49,351 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:34:49,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:49,355 INFO L85 PathProgramCache]: Analyzing trace with hash -2141758114, now seen corresponding path program 1 times [2025-03-09 02:34:49,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:49,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38709360] [2025-03-09 02:34:49,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:49,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:49,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 02:34:49,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 02:34:49,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:49,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:49,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:34:49,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:49,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38709360] [2025-03-09 02:34:49,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38709360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:34:49,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:34:49,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:34:49,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220223758] [2025-03-09 02:34:49,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:34:49,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 02:34:49,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:49,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 02:34:49,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 02:34:49,469 INFO L87 Difference]: Start difference. First operand has 192 states, 101 states have (on average 1.900990099009901) internal successors, (192), 187 states have internal predecessors, (192), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:34:49,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:49,492 INFO L93 Difference]: Finished difference Result 367 states and 394 transitions. [2025-03-09 02:34:49,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 02:34:49,495 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Word has length 6 [2025-03-09 02:34:49,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:49,500 INFO L225 Difference]: With dead ends: 367 [2025-03-09 02:34:49,500 INFO L226 Difference]: Without dead ends: 172 [2025-03-09 02:34:49,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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:34:49,504 INFO L435 NwaCegarLoop]: 181 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, 181 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:34:49,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:34:49,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-09 02:34:49,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2025-03-09 02:34:49,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 96 states have (on average 1.7708333333333333) internal successors, (170), 168 states have internal predecessors, (170), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:34:49,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 174 transitions. [2025-03-09 02:34:49,539 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 174 transitions. Word has length 6 [2025-03-09 02:34:49,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:49,540 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 174 transitions. [2025-03-09 02:34:49,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:34:49,540 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 174 transitions. [2025-03-09 02:34:49,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 02:34:49,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:49,540 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 02:34:49,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:34:49,540 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:34:49,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:49,541 INFO L85 PathProgramCache]: Analyzing trace with hash -2141728323, now seen corresponding path program 1 times [2025-03-09 02:34:49,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:49,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962041386] [2025-03-09 02:34:49,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:49,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:49,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 02:34:49,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 02:34:49,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:49,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:49,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:34:49,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:49,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962041386] [2025-03-09 02:34:49,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962041386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:34:49,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:34:49,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:34:49,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838853411] [2025-03-09 02:34:49,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:34:49,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:34:49,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:49,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:34:49,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:34:49,626 INFO L87 Difference]: Start difference. First operand 172 states and 174 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:34:49,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:49,676 INFO L93 Difference]: Finished difference Result 253 states and 255 transitions. [2025-03-09 02:34:49,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:34:49,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2025-03-09 02:34:49,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:49,681 INFO L225 Difference]: With dead ends: 253 [2025-03-09 02:34:49,681 INFO L226 Difference]: Without dead ends: 176 [2025-03-09 02:34:49,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:34:49,682 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 4 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:34:49,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 503 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:34:49,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-09 02:34:49,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2025-03-09 02:34:49,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 100 states have (on average 1.74) internal successors, (174), 172 states have internal predecessors, (174), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:34:49,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 178 transitions. [2025-03-09 02:34:49,692 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 178 transitions. Word has length 6 [2025-03-09 02:34:49,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:49,693 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 178 transitions. [2025-03-09 02:34:49,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:34:49,693 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 178 transitions. [2025-03-09 02:34:49,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 02:34:49,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:49,693 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:34:49,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:34:49,693 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:34:49,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:49,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1805825781, now seen corresponding path program 1 times [2025-03-09 02:34:49,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:49,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313569544] [2025-03-09 02:34:49,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:49,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:49,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 02:34:49,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 02:34:49,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:49,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:49,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:34:49,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:49,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313569544] [2025-03-09 02:34:49,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313569544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:34:49,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:34:49,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:34:49,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701004344] [2025-03-09 02:34:49,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:34:49,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:34:49,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:49,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:34:49,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:34:49,743 INFO L87 Difference]: Start difference. First operand 176 states and 178 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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:34:50,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:50,038 INFO L93 Difference]: Finished difference Result 312 states and 324 transitions. [2025-03-09 02:34:50,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:34:50,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 9 [2025-03-09 02:34:50,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:50,040 INFO L225 Difference]: With dead ends: 312 [2025-03-09 02:34:50,040 INFO L226 Difference]: Without dead ends: 256 [2025-03-09 02:34:50,041 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:34:50,041 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 82 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 127 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:34:50,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 127 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:34:50,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-09 02:34:50,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 250. [2025-03-09 02:34:50,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 173 states have (on average 1.5086705202312138) internal successors, (261), 245 states have internal predecessors, (261), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:34:50,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 267 transitions. [2025-03-09 02:34:50,053 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 267 transitions. Word has length 9 [2025-03-09 02:34:50,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:50,053 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 267 transitions. [2025-03-09 02:34:50,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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:34:50,053 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 267 transitions. [2025-03-09 02:34:50,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-09 02:34:50,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:50,054 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:34:50,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:34:50,054 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:34:50,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:50,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1109740071, now seen corresponding path program 1 times [2025-03-09 02:34:50,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:50,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344831469] [2025-03-09 02:34:50,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:50,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:50,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 02:34:50,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 02:34:50,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:50,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:50,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:34:50,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:50,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344831469] [2025-03-09 02:34:50,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344831469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:34:50,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:34:50,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:34:50,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939408986] [2025-03-09 02:34:50,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:34:50,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:34:50,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:50,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:34:50,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:34:50,144 INFO L87 Difference]: Start difference. First operand 250 states and 267 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 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:34:50,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:50,200 INFO L93 Difference]: Finished difference Result 269 states and 281 transitions. [2025-03-09 02:34:50,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:34:50,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 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) Word has length 37 [2025-03-09 02:34:50,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:50,202 INFO L225 Difference]: With dead ends: 269 [2025-03-09 02:34:50,203 INFO L226 Difference]: Without dead ends: 264 [2025-03-09 02:34:50,203 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:34:50,204 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 58 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 296 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:34:50,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 296 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:34:50,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-09 02:34:50,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 257. [2025-03-09 02:34:50,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 180 states have (on average 1.488888888888889) internal successors, (268), 252 states have internal predecessors, (268), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:34:50,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 274 transitions. [2025-03-09 02:34:50,219 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 274 transitions. Word has length 37 [2025-03-09 02:34:50,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:50,219 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 274 transitions. [2025-03-09 02:34:50,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 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:34:50,220 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 274 transitions. [2025-03-09 02:34:50,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-09 02:34:50,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:50,220 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:34:50,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:34:50,220 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:34:50,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:50,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1308316073, now seen corresponding path program 1 times [2025-03-09 02:34:50,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:50,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044549345] [2025-03-09 02:34:50,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:50,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:50,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 02:34:50,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 02:34:50,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:50,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:50,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:34:50,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:50,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044549345] [2025-03-09 02:34:50,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044549345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:34:50,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:34:50,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:34:50,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407657822] [2025-03-09 02:34:50,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:34:50,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:34:50,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:50,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:34:50,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:34:50,319 INFO L87 Difference]: Start difference. First operand 257 states and 274 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 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:34:50,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:50,465 INFO L93 Difference]: Finished difference Result 268 states and 276 transitions. [2025-03-09 02:34:50,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:34:50,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 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) Word has length 39 [2025-03-09 02:34:50,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:50,466 INFO L225 Difference]: With dead ends: 268 [2025-03-09 02:34:50,466 INFO L226 Difference]: Without dead ends: 263 [2025-03-09 02:34:50,467 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:34:50,469 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 136 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 233 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:34:50,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 233 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:34:50,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-09 02:34:50,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 257. [2025-03-09 02:34:50,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 180 states have (on average 1.461111111111111) internal successors, (263), 252 states have internal predecessors, (263), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:34:50,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 269 transitions. [2025-03-09 02:34:50,485 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 269 transitions. Word has length 39 [2025-03-09 02:34:50,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:50,485 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 269 transitions. [2025-03-09 02:34:50,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 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:34:50,486 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 269 transitions. [2025-03-09 02:34:50,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-09 02:34:50,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:50,486 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:34:50,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 02:34:50,486 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:34:50,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:50,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1903092517, now seen corresponding path program 1 times [2025-03-09 02:34:50,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:50,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080979342] [2025-03-09 02:34:50,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:50,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:50,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 02:34:50,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 02:34:50,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:50,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:50,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:34:50,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:50,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080979342] [2025-03-09 02:34:50,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080979342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:34:50,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:34:50,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:34:50,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064907089] [2025-03-09 02:34:50,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:34:50,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:34:50,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:50,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:34:50,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:34:50,563 INFO L87 Difference]: Start difference. First operand 257 states and 269 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 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:34:50,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:50,688 INFO L93 Difference]: Finished difference Result 267 states and 271 transitions. [2025-03-09 02:34:50,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:34:50,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 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) Word has length 40 [2025-03-09 02:34:50,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:50,689 INFO L225 Difference]: With dead ends: 267 [2025-03-09 02:34:50,689 INFO L226 Difference]: Without dead ends: 229 [2025-03-09 02:34:50,690 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:34:50,690 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 128 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:34:50,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 246 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:34:50,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-03-09 02:34:50,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 223. [2025-03-09 02:34:50,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 146 states have (on average 1.5410958904109588) internal successors, (225), 218 states have internal predecessors, (225), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:34:50,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 231 transitions. [2025-03-09 02:34:50,700 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 231 transitions. Word has length 40 [2025-03-09 02:34:50,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:50,700 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 231 transitions. [2025-03-09 02:34:50,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 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:34:50,700 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 231 transitions. [2025-03-09 02:34:50,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-09 02:34:50,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:50,701 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:50,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 02:34:50,701 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:34:50,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:50,702 INFO L85 PathProgramCache]: Analyzing trace with hash -2050676589, now seen corresponding path program 1 times [2025-03-09 02:34:50,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:50,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749541661] [2025-03-09 02:34:50,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:50,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:50,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 02:34:50,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 02:34:50,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:50,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:50,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:34:50,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:50,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749541661] [2025-03-09 02:34:50,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749541661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:34:50,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:34:50,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:34:50,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451383557] [2025-03-09 02:34:50,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:34:50,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:34:50,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:50,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:34:50,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:34:50,768 INFO L87 Difference]: Start difference. First operand 223 states and 231 transitions. Second operand has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:34:50,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:50,782 INFO L93 Difference]: Finished difference Result 225 states and 231 transitions. [2025-03-09 02:34:50,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:34:50,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-09 02:34:50,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:50,784 INFO L225 Difference]: With dead ends: 225 [2025-03-09 02:34:50,784 INFO L226 Difference]: Without dead ends: 223 [2025-03-09 02:34:50,784 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:34:50,785 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 1 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 337 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:34:50,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 337 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:34:50,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-09 02:34:50,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2025-03-09 02:34:50,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 146 states have (on average 1.5273972602739727) internal successors, (223), 218 states have internal predecessors, (223), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:34:50,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 229 transitions. [2025-03-09 02:34:50,790 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 229 transitions. Word has length 49 [2025-03-09 02:34:50,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:50,791 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 229 transitions. [2025-03-09 02:34:50,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:34:50,791 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 229 transitions. [2025-03-09 02:34:50,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-09 02:34:50,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:50,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:50,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 02:34:50,792 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:34:50,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:50,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1911217840, now seen corresponding path program 1 times [2025-03-09 02:34:50,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:50,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019856383] [2025-03-09 02:34:50,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:50,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:50,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-09 02:34:50,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 02:34:50,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:50,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:34:50,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1721929] [2025-03-09 02:34:50,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:50,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:34:50,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:34:50,809 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:34:50,810 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:34:50,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-09 02:34:50,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 02:34:50,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:50,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:50,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:34:50,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:34:50,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:34:50,929 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:34:50,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:50,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019856383] [2025-03-09 02:34:50,929 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:34:50,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721929] [2025-03-09 02:34:50,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:34:50,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:34:50,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:34:50,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059298071] [2025-03-09 02:34:50,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:34:50,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:34:50,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:50,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:34:50,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:34:50,931 INFO L87 Difference]: Start difference. First operand 223 states and 229 transitions. Second operand has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:34:51,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:51,238 INFO L93 Difference]: Finished difference Result 367 states and 384 transitions. [2025-03-09 02:34:51,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:34:51,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-03-09 02:34:51,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:51,241 INFO L225 Difference]: With dead ends: 367 [2025-03-09 02:34:51,244 INFO L226 Difference]: Without dead ends: 313 [2025-03-09 02:34:51,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 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:34:51,245 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 96 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 156 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:34:51,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 156 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:34:51,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-09 02:34:51,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 305. [2025-03-09 02:34:51,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 226 states have (on average 1.415929203539823) internal successors, (320), 298 states have internal predecessors, (320), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:34:51,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 330 transitions. [2025-03-09 02:34:51,254 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 330 transitions. Word has length 54 [2025-03-09 02:34:51,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:51,254 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 330 transitions. [2025-03-09 02:34:51,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:34:51,254 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 330 transitions. [2025-03-09 02:34:51,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-09 02:34:51,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:51,257 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:51,263 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:34:51,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:34:51,461 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:34:51,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:51,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1956860886, now seen corresponding path program 1 times [2025-03-09 02:34:51,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:51,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683517494] [2025-03-09 02:34:51,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:51,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:51,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-09 02:34:51,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 02:34:51,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:51,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:51,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:34:51,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:51,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683517494] [2025-03-09 02:34:51,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683517494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:34:51,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:34:51,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:34:51,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846308450] [2025-03-09 02:34:51,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:34:51,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:34:51,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:51,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:34:51,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:34:51,526 INFO L87 Difference]: Start difference. First operand 305 states and 330 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:34:51,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:51,707 INFO L93 Difference]: Finished difference Result 306 states and 330 transitions. [2025-03-09 02:34:51,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:34:51,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2025-03-09 02:34:51,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:51,710 INFO L225 Difference]: With dead ends: 306 [2025-03-09 02:34:51,710 INFO L226 Difference]: Without dead ends: 305 [2025-03-09 02:34:51,711 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:34:51,711 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 42 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:34:51,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 302 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:34:51,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-03-09 02:34:51,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2025-03-09 02:34:51,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 226 states have (on average 1.4115044247787611) internal successors, (319), 298 states have internal predecessors, (319), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:34:51,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 329 transitions. [2025-03-09 02:34:51,721 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 329 transitions. Word has length 60 [2025-03-09 02:34:51,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:51,721 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 329 transitions. [2025-03-09 02:34:51,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:34:51,721 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 329 transitions. [2025-03-09 02:34:51,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-09 02:34:51,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:51,722 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-03-09 02:34:51,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 02:34:51,722 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:34:51,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:51,722 INFO L85 PathProgramCache]: Analyzing trace with hash 652369064, now seen corresponding path program 1 times [2025-03-09 02:34:51,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:51,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563793049] [2025-03-09 02:34:51,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:51,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:51,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 02:34:51,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 02:34:51,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:51,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:51,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:34:51,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:51,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563793049] [2025-03-09 02:34:51,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563793049] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:34:51,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991436008] [2025-03-09 02:34:51,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:51,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:34:51,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:34:51,839 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:34:51,841 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:34:51,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 02:34:51,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 02:34:51,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:51,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:51,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:34:51,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:34:51,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:34:51,999 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:34:51,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991436008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:34:51,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:34:51,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-09 02:34:51,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003040971] [2025-03-09 02:34:51,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:34:51,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:34:51,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:51,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:34:51,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:34:52,000 INFO L87 Difference]: Start difference. First operand 305 states and 329 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:34:52,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:52,023 INFO L93 Difference]: Finished difference Result 305 states and 329 transitions. [2025-03-09 02:34:52,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:34:52,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2025-03-09 02:34:52,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:52,024 INFO L225 Difference]: With dead ends: 305 [2025-03-09 02:34:52,025 INFO L226 Difference]: Without dead ends: 304 [2025-03-09 02:34:52,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:34:52,025 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 121 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 333 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:34:52,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 333 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:34:52,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-03-09 02:34:52,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2025-03-09 02:34:52,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 226 states have (on average 1.4026548672566372) internal successors, (317), 297 states have internal predecessors, (317), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:34:52,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 327 transitions. [2025-03-09 02:34:52,034 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 327 transitions. Word has length 62 [2025-03-09 02:34:52,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:52,034 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 327 transitions. [2025-03-09 02:34:52,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:34:52,035 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 327 transitions. [2025-03-09 02:34:52,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-09 02:34:52,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:52,035 INFO L218 NwaCegarLoop]: trace histogram [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:34:52,042 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:34:52,240 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,SelfDestructingSolverStorable9 [2025-03-09 02:34:52,240 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:34:52,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:52,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1251395348, now seen corresponding path program 1 times [2025-03-09 02:34:52,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:52,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862812970] [2025-03-09 02:34:52,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:52,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:52,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 02:34:52,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 02:34:52,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:52,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:52,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:34:52,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:52,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862812970] [2025-03-09 02:34:52,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862812970] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:34:52,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472572393] [2025-03-09 02:34:52,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:52,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:34:52,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:34:52,360 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:34:52,365 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:34:52,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-09 02:34:52,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 02:34:52,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:52,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:52,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:34:52,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:34:52,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:34:52,482 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:34:52,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472572393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:34:52,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:34:52,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-09 02:34:52,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067851685] [2025-03-09 02:34:52,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:34:52,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:34:52,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:52,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:34:52,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:34:52,484 INFO L87 Difference]: Start difference. First operand 304 states and 327 transitions. Second operand has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:34:52,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:52,521 INFO L93 Difference]: Finished difference Result 416 states and 446 transitions. [2025-03-09 02:34:52,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:34:52,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2025-03-09 02:34:52,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:52,523 INFO L225 Difference]: With dead ends: 416 [2025-03-09 02:34:52,523 INFO L226 Difference]: Without dead ends: 415 [2025-03-09 02:34:52,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:34:52,524 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 118 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:34:52,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 781 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:34:52,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-09 02:34:52,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 377. [2025-03-09 02:34:52,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 297 states have (on average 1.4175084175084176) internal successors, (421), 369 states have internal predecessors, (421), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-09 02:34:52,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 435 transitions. [2025-03-09 02:34:52,534 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 435 transitions. Word has length 63 [2025-03-09 02:34:52,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:52,534 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 435 transitions. [2025-03-09 02:34:52,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:34:52,534 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 435 transitions. [2025-03-09 02:34:52,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-09 02:34:52,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:52,535 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] [2025-03-09 02:34:52,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 02:34:52,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:34:52,736 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:34:52,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:52,736 INFO L85 PathProgramCache]: Analyzing trace with hash -859206258, now seen corresponding path program 1 times [2025-03-09 02:34:52,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:52,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412931205] [2025-03-09 02:34:52,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:52,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:52,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-09 02:34:52,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-09 02:34:52,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:52,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:52,830 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:34:52,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:52,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412931205] [2025-03-09 02:34:52,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412931205] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:34:52,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161113473] [2025-03-09 02:34:52,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:52,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:34:52,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:34:52,832 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:34:52,837 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:34:52,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-09 02:34:52,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-09 02:34:52,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:52,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:52,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:34:52,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:34:52,955 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:34:52,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:34:53,031 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:34:53,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161113473] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:34:53,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:34:53,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 9 [2025-03-09 02:34:53,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149521199] [2025-03-09 02:34:53,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:34:53,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:34:53,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:53,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:34:53,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:34:53,033 INFO L87 Difference]: Start difference. First operand 377 states and 435 transitions. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:34:53,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:53,070 INFO L93 Difference]: Finished difference Result 395 states and 444 transitions. [2025-03-09 02:34:53,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:34:53,070 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 93 [2025-03-09 02:34:53,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:53,071 INFO L225 Difference]: With dead ends: 395 [2025-03-09 02:34:53,071 INFO L226 Difference]: Without dead ends: 113 [2025-03-09 02:34:53,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 181 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:34:53,072 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 96 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:34:53,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 497 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:34:53,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-09 02:34:53,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-09 02:34:53,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 101 states have (on average 1.0693069306930694) internal successors, (108), 108 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:34:53,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 112 transitions. [2025-03-09 02:34:53,076 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 112 transitions. Word has length 93 [2025-03-09 02:34:53,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:53,076 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 112 transitions. [2025-03-09 02:34:53,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:34:53,076 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 112 transitions. [2025-03-09 02:34:53,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-09 02:34:53,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:53,077 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, 1, 1, 1, 1, 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:34:53,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 02:34:53,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:34:53,281 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:34:53,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:53,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1263759118, now seen corresponding path program 1 times [2025-03-09 02:34:53,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:53,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146131478] [2025-03-09 02:34:53,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:53,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:53,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-09 02:34:53,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-09 02:34:53,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:53,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:34:53,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2109359157] [2025-03-09 02:34:53,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:53,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:34:53,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:34:53,304 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:34:53,305 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:34:53,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-09 02:34:53,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-09 02:34:53,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:53,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:53,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:34:53,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:34:53,447 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:34:53,448 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:34:53,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:53,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146131478] [2025-03-09 02:34:53,448 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:34:53,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109359157] [2025-03-09 02:34:53,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109359157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:34:53,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:34:53,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:34:53,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125403695] [2025-03-09 02:34:53,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:34:53,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:34:53,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:53,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:34:53,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:34:53,449 INFO L87 Difference]: Start difference. First operand 113 states and 112 transitions. Second operand has 3 states, 2 states have (on average 44.0) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:34:53,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:53,474 INFO L93 Difference]: Finished difference Result 113 states and 112 transitions. [2025-03-09 02:34:53,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:34:53,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 44.0) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2025-03-09 02:34:53,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:53,476 INFO L225 Difference]: With dead ends: 113 [2025-03-09 02:34:53,476 INFO L226 Difference]: Without dead ends: 112 [2025-03-09 02:34:53,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 90 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:34:53,476 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 9 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:34:53,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 93 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:34:53,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-09 02:34:53,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-09 02:34:53,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 101 states have (on average 1.0594059405940595) internal successors, (107), 107 states have internal predecessors, (107), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:34:53,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 111 transitions. [2025-03-09 02:34:53,481 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 111 transitions. Word has length 93 [2025-03-09 02:34:53,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:53,481 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 111 transitions. [2025-03-09 02:34:53,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 44.0) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:34:53,482 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 111 transitions. [2025-03-09 02:34:53,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-09 02:34:53,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:53,482 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, 1, 1, 1, 1, 1, 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:34:53,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 02:34:53,687 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,SelfDestructingSolverStorable12 [2025-03-09 02:34:53,687 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:34:53,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:53,687 INFO L85 PathProgramCache]: Analyzing trace with hash 521826985, now seen corresponding path program 1 times [2025-03-09 02:34:53,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:53,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056791842] [2025-03-09 02:34:53,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:53,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:53,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-09 02:34:53,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-09 02:34:53,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:53,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:34:53,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [931989089] [2025-03-09 02:34:53,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:53,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:34:53,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:34:53,710 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:34:53,711 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:34:53,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-09 02:34:53,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-09 02:34:53,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:53,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:53,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 02:34:53,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:34:53,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:34:53,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:34:54,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:34:54,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:54,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056791842] [2025-03-09 02:34:54,111 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:34:54,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931989089] [2025-03-09 02:34:54,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931989089] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:34:54,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:34:54,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-09 02:34:54,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962916417] [2025-03-09 02:34:54,111 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:34:54,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:34:54,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:54,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:34:54,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:34:54,112 INFO L87 Difference]: Start difference. First operand 112 states and 111 transitions. Second operand has 8 states, 7 states have (on average 25.428571428571427) internal successors, (178), 8 states have internal predecessors, (178), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:34:54,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:54,310 INFO L93 Difference]: Finished difference Result 112 states and 111 transitions. [2025-03-09 02:34:54,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:34:54,311 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 25.428571428571427) internal successors, (178), 8 states have internal predecessors, (178), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 94 [2025-03-09 02:34:54,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:54,312 INFO L225 Difference]: With dead ends: 112 [2025-03-09 02:34:54,312 INFO L226 Difference]: Without dead ends: 111 [2025-03-09 02:34:54,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:34:54,312 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 85 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:34:54,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 65 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:34:54,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-09 02:34:54,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-09 02:34:54,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 106 states have internal predecessors, (106), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:34:54,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 110 transitions. [2025-03-09 02:34:54,316 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 110 transitions. Word has length 94 [2025-03-09 02:34:54,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:54,317 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 110 transitions. [2025-03-09 02:34:54,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 25.428571428571427) internal successors, (178), 8 states have internal predecessors, (178), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:34:54,317 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 110 transitions. [2025-03-09 02:34:54,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-09 02:34:54,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:54,317 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, 1, 1, 1, 1, 1, 1, 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:34:54,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 02:34:54,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:34:54,518 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:34:54,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:54,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1003232660, now seen corresponding path program 1 times [2025-03-09 02:34:54,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:54,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855734937] [2025-03-09 02:34:54,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:54,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:54,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-09 02:34:54,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-09 02:34:54,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:54,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:34:54,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1340353316] [2025-03-09 02:34:54,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:54,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:34:54,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:34:54,556 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:34:54,557 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:34:54,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-09 02:34:54,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-09 02:34:54,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:54,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:54,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 02:34:54,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:34:54,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:34:54,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:34:55,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:34:55,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:55,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855734937] [2025-03-09 02:34:55,444 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:34:55,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340353316] [2025-03-09 02:34:55,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340353316] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:34:55,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:34:55,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2025-03-09 02:34:55,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296816054] [2025-03-09 02:34:55,444 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:34:55,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:34:55,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:55,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:34:55,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:34:55,446 INFO L87 Difference]: Start difference. First operand 111 states and 110 transitions. Second operand has 9 states, 8 states have (on average 22.5) internal successors, (180), 9 states have internal predecessors, (180), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:34:55,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:55,582 INFO L93 Difference]: Finished difference Result 111 states and 110 transitions. [2025-03-09 02:34:55,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:34:55,583 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 22.5) internal successors, (180), 9 states have internal predecessors, (180), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 95 [2025-03-09 02:34:55,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:55,584 INFO L225 Difference]: With dead ends: 111 [2025-03-09 02:34:55,584 INFO L226 Difference]: Without dead ends: 107 [2025-03-09 02:34:55,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:34:55,584 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:34:55,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 72 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:34:55,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-09 02:34:55,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-09 02:34:55,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 101 states have (on average 1.00990099009901) internal successors, (102), 102 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:34:55,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 106 transitions. [2025-03-09 02:34:55,591 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 106 transitions. Word has length 95 [2025-03-09 02:34:55,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:55,591 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 106 transitions. [2025-03-09 02:34:55,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 22.5) internal successors, (180), 9 states have internal predecessors, (180), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:34:55,591 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 106 transitions. [2025-03-09 02:34:55,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-09 02:34:55,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:55,592 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:55,598 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:34:55,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:34:55,793 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:34:55,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:55,794 INFO L85 PathProgramCache]: Analyzing trace with hash 823309030, now seen corresponding path program 1 times [2025-03-09 02:34:55,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:55,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954379743] [2025-03-09 02:34:55,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:55,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:55,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-09 02:34:55,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-09 02:34:55,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:55,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:34:55,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1435599715] [2025-03-09 02:34:55,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:55,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:34:55,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:34:55,813 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:34:55,815 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:34:55,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-09 02:34:55,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-09 02:34:55,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:55,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:55,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:34:55,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:34:56,098 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:34:56,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:34:56,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:56,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954379743] [2025-03-09 02:34:56,269 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:34:56,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435599715] [2025-03-09 02:34:56,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435599715] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:34:56,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:34:56,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-09 02:34:56,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185944219] [2025-03-09 02:34:56,269 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-09 02:34:56,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:34:56,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:56,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:34:56,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:34:56,270 INFO L87 Difference]: Start difference. First operand 107 states and 106 transitions. Second operand has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:34:56,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:56,379 INFO L93 Difference]: Finished difference Result 107 states and 106 transitions. [2025-03-09 02:34:56,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:34:56,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 104 [2025-03-09 02:34:56,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:56,380 INFO L225 Difference]: With dead ends: 107 [2025-03-09 02:34:56,380 INFO L226 Difference]: Without dead ends: 106 [2025-03-09 02:34:56,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:34:56,381 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 48 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:34:56,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 56 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:34:56,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-09 02:34:56,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-09 02:34:56,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.0) internal successors, (101), 101 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:34:56,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 105 transitions. [2025-03-09 02:34:56,387 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 105 transitions. Word has length 104 [2025-03-09 02:34:56,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:56,387 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 105 transitions. [2025-03-09 02:34:56,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:34:56,387 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 105 transitions. [2025-03-09 02:34:56,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-09 02:34:56,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:34:56,388 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:56,394 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:34:56,588 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,SelfDestructingSolverStorable15 [2025-03-09 02:34:56,589 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-03-09 02:34:56,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:34:56,589 INFO L85 PathProgramCache]: Analyzing trace with hash -247223868, now seen corresponding path program 1 times [2025-03-09 02:34:56,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:34:56,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112279908] [2025-03-09 02:34:56,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:56,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:34:56,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 02:34:56,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 02:34:56,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:56,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:34:56,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [645156395] [2025-03-09 02:34:56,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:34:56,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:34:56,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:34:56,617 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:34:56,618 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:34:56,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 02:34:56,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 02:34:56,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:34:56,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:34:56,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 02:34:56,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:34:56,919 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:34:56,919 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:34:57,437 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:34:57,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:34:57,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112279908] [2025-03-09 02:34:57,438 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:34:57,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645156395] [2025-03-09 02:34:57,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645156395] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:34:57,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:34:57,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-09 02:34:57,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866707910] [2025-03-09 02:34:57,438 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:34:57,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 02:34:57,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:34:57,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 02:34:57,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:34:57,440 INFO L87 Difference]: Start difference. First operand 106 states and 105 transitions. Second operand has 10 states, 9 states have (on average 21.333333333333332) internal successors, (192), 10 states have internal predecessors, (192), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:34:57,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:34:57,594 INFO L93 Difference]: Finished difference Result 106 states and 105 transitions. [2025-03-09 02:34:57,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:34:57,594 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 21.333333333333332) internal successors, (192), 10 states have internal predecessors, (192), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 105 [2025-03-09 02:34:57,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:34:57,595 INFO L225 Difference]: With dead ends: 106 [2025-03-09 02:34:57,595 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 02:34:57,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:34:57,595 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:34:57,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:34:57,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 02:34:57,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 02:34:57,596 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:34:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 02:34:57,596 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2025-03-09 02:34:57,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:34:57,596 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 02:34:57,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 21.333333333333332) internal successors, (192), 10 states have internal predecessors, (192), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:34:57,596 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 02:34:57,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 02:34:57,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 86 remaining) [2025-03-09 02:34:57,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 86 remaining) [2025-03-09 02:34:57,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 86 remaining) [2025-03-09 02:34:57,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 86 remaining) [2025-03-09 02:34:57,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 86 remaining) [2025-03-09 02:34:57,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 86 remaining) [2025-03-09 02:34:57,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 86 remaining) [2025-03-09 02:34:57,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 86 remaining) [2025-03-09 02:34:57,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 86 remaining) [2025-03-09 02:34:57,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 86 remaining) [2025-03-09 02:34:57,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 86 remaining) [2025-03-09 02:34:57,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 86 remaining) [2025-03-09 02:34:57,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 86 remaining) [2025-03-09 02:34:57,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 86 remaining) [2025-03-09 02:34:57,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 86 remaining) [2025-03-09 02:34:57,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 86 remaining) [2025-03-09 02:34:57,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 86 remaining) [2025-03-09 02:34:57,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 86 remaining) [2025-03-09 02:34:57,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 86 remaining) [2025-03-09 02:34:57,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 86 remaining) [2025-03-09 02:34:57,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 86 remaining) [2025-03-09 02:34:57,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 86 remaining) [2025-03-09 02:34:57,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 86 remaining) [2025-03-09 02:34:57,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 86 remaining) [2025-03-09 02:34:57,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 86 remaining) [2025-03-09 02:34:57,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 86 remaining) [2025-03-09 02:34:57,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 86 remaining) [2025-03-09 02:34:57,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 86 remaining) [2025-03-09 02:34:57,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 86 remaining) [2025-03-09 02:34:57,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 86 remaining) [2025-03-09 02:34:57,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 86 remaining) [2025-03-09 02:34:57,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 86 remaining) [2025-03-09 02:34:57,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 86 remaining) [2025-03-09 02:34:57,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 86 remaining) [2025-03-09 02:34:57,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 86 remaining) [2025-03-09 02:34:57,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 86 remaining) [2025-03-09 02:34:57,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 86 remaining) [2025-03-09 02:34:57,600 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 86 remaining) [2025-03-09 02:34:57,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 86 remaining) [2025-03-09 02:34:57,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 86 remaining) [2025-03-09 02:34:57,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 86 remaining) [2025-03-09 02:34:57,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 86 remaining) [2025-03-09 02:34:57,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 86 remaining) [2025-03-09 02:34:57,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 86 remaining) [2025-03-09 02:34:57,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 86 remaining) [2025-03-09 02:34:57,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 86 remaining) [2025-03-09 02:34:57,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 86 remaining) [2025-03-09 02:34:57,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 86 remaining) [2025-03-09 02:34:57,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 86 remaining) [2025-03-09 02:34:57,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 86 remaining) [2025-03-09 02:34:57,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 86 remaining) [2025-03-09 02:34:57,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 86 remaining) [2025-03-09 02:34:57,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 86 remaining) [2025-03-09 02:34:57,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 86 remaining) [2025-03-09 02:34:57,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 86 remaining) [2025-03-09 02:34:57,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 86 remaining) [2025-03-09 02:34:57,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 86 remaining) [2025-03-09 02:34:57,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 86 remaining) [2025-03-09 02:34:57,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 86 remaining) [2025-03-09 02:34:57,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 86 remaining) [2025-03-09 02:34:57,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 86 remaining) [2025-03-09 02:34:57,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 86 remaining) [2025-03-09 02:34:57,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 86 remaining) [2025-03-09 02:34:57,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 86 remaining) [2025-03-09 02:34:57,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 86 remaining) [2025-03-09 02:34:57,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 86 remaining) [2025-03-09 02:34:57,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 86 remaining) [2025-03-09 02:34:57,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 86 remaining) [2025-03-09 02:34:57,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 86 remaining) [2025-03-09 02:34:57,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 86 remaining) [2025-03-09 02:34:57,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 86 remaining) [2025-03-09 02:34:57,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 86 remaining) [2025-03-09 02:34:57,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 86 remaining) [2025-03-09 02:34:57,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 86 remaining) [2025-03-09 02:34:57,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 86 remaining) [2025-03-09 02:34:57,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 86 remaining) [2025-03-09 02:34:57,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 86 remaining) [2025-03-09 02:34:57,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 86 remaining) [2025-03-09 02:34:57,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 86 remaining) [2025-03-09 02:34:57,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 86 remaining) [2025-03-09 02:34:57,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 86 remaining) [2025-03-09 02:34:57,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 86 remaining) [2025-03-09 02:34:57,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 86 remaining) [2025-03-09 02:34:57,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 86 remaining) [2025-03-09 02:34:57,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 86 remaining) [2025-03-09 02:34:57,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 86 remaining) [2025-03-09 02:34:57,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 02:34:57,804 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,SelfDestructingSolverStorable16 [2025-03-09 02:34:57,806 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:34:57,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 02:34:57,847 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 02:34:57,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 02:34:57 BoogieIcfgContainer [2025-03-09 02:34:57,856 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 02:34:57,856 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 02:34:57,856 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 02:34:57,856 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 02:34:57,857 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:34:49" (3/4) ... [2025-03-09 02:34:57,858 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 02:34:57,862 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-09 02:34:57,867 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-09 02:34:57,867 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 02:34:57,868 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 02:34:57,868 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 02:34:57,931 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 02:34:57,931 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 02:34:57,931 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 02:34:57,932 INFO L158 Benchmark]: Toolchain (without parser) took 9354.60ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 124.8MB in the beginning and 245.1MB in the end (delta: -120.3MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. [2025-03-09 02:34:57,932 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:34:57,932 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.38ms. Allocated memory is still 167.8MB. Free memory was 124.8MB in the beginning and 113.3MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:34:57,933 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.08ms. Allocated memory is still 167.8MB. Free memory was 113.3MB in the beginning and 111.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:34:57,933 INFO L158 Benchmark]: Boogie Preprocessor took 23.33ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 110.9MB in the end (delta: 997.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:34:57,933 INFO L158 Benchmark]: IcfgBuilder took 466.22ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 80.6MB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-09 02:34:57,934 INFO L158 Benchmark]: TraceAbstraction took 8573.09ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 79.6MB in the beginning and 249.9MB in the end (delta: -170.3MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2025-03-09 02:34:57,936 INFO L158 Benchmark]: Witness Printer took 75.37ms. Allocated memory is still 343.9MB. Free memory was 249.9MB in the beginning and 245.1MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:34:57,937 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.14ms. Allocated memory is still 201.3MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.38ms. Allocated memory is still 167.8MB. Free memory was 124.8MB in the beginning and 113.3MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.08ms. Allocated memory is still 167.8MB. Free memory was 113.3MB in the beginning and 111.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.33ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 110.9MB in the end (delta: 997.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 466.22ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 80.6MB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8573.09ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 79.6MB in the beginning and 249.9MB in the end (delta: -170.3MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * Witness Printer took 75.37ms. Allocated memory is still 343.9MB. Free memory was 249.9MB in the beginning and 245.1MB in the end (delta: 4.7MB). There was no memory consumed. 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 - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 192 locations, 201 edges, 86 error locations. Started 1 CEGAR loops. OverallTime: 8.5s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1044 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1034 mSDsluCounter, 4348 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2470 mSDsCounter, 139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2174 IncrementalHoareTripleChecker+Invalid, 2313 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 139 mSolverCounterUnsat, 1878 mSDtfsCounter, 2174 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1244 GetRequests, 1168 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=377occurred in iteration=11, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 71 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1772 NumberOfCodeBlocks, 1772 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1590 ConstructedInterpolants, 0 QuantifiedInterpolants, 10546 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1194 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 24 InterpolantComputations, 12 PerfectInterpolantSequences, 114/153 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 86 specifications checked. All of them hold - InvariantResult [Line: 28]: Location Invariant Derived location invariant: (((((((x == 1) && (0 <= c)) && (y == 1)) && (1 <= k)) && (k <= 256)) && (counter == 1)) || (((((c == 0) && (y == 0)) && (counter == 0)) && (k <= 256)) && (x == 0))) RESULT: Ultimate proved your program to be correct! [2025-03-09 02:34:57,952 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