./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound2.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 1c1067a232ccde2ed577e0679695f102973a28bf8615edad0a3c87e54d273eb4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:23:41,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:23:41,052 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:23:41,058 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:23:41,058 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:23:41,074 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:23:41,074 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:23:41,075 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:23:41,075 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:23:41,075 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:23:41,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:23:41,075 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:23:41,075 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:23:41,075 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:23:41,075 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:23:41,076 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:23:41,076 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:23:41,076 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:23:41,076 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:23:41,076 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:23:41,076 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:23:41,076 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:23:41,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:23:41,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:23:41,076 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:23:41,076 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:23:41,076 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:23:41,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:23:41,077 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:23:41,077 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:23:41,077 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:23:41,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:23:41,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:23:41,077 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:23:41,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:23:41,077 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:23:41,077 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:23:41,077 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:23:41,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:23:41,078 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:23:41,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:23:41,078 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:23:41,078 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:23:41,078 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:23:41,078 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:23:41,078 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 -> 1c1067a232ccde2ed577e0679695f102973a28bf8615edad0a3c87e54d273eb4 [2025-03-04 11:23:41,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:23:41,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:23:41,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:23:41,278 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:23:41,278 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:23:41,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound2.c [2025-03-04 11:23:42,355 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/912401229/7e82adf15d124a48aebf8a47abc74800/FLAG5145166d3 [2025-03-04 11:23:42,542 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:23:42,542 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound2.c [2025-03-04 11:23:42,548 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/912401229/7e82adf15d124a48aebf8a47abc74800/FLAG5145166d3 [2025-03-04 11:23:42,915 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/912401229/7e82adf15d124a48aebf8a47abc74800 [2025-03-04 11:23:42,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:23:42,917 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:23:42,918 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:23:42,918 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:23:42,921 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:23:42,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:23:42" (1/1) ... [2025-03-04 11:23:42,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@749ee39d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:23:42, skipping insertion in model container [2025-03-04 11:23:42,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:23:42" (1/1) ... [2025-03-04 11:23:42,930 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:23:43,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:23:43,035 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:23:43,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:23:43,057 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:23:43,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:23:43 WrapperNode [2025-03-04 11:23:43,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:23:43,058 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:23:43,058 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:23:43,058 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:23:43,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:23:43" (1/1) ... [2025-03-04 11:23:43,069 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:23:43" (1/1) ... [2025-03-04 11:23:43,095 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 123 [2025-03-04 11:23:43,095 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:23:43,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:23:43,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:23:43,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:23:43,104 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:23:43" (1/1) ... [2025-03-04 11:23:43,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:23:43" (1/1) ... [2025-03-04 11:23:43,105 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:23:43" (1/1) ... [2025-03-04 11:23:43,117 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 11:23:43,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:23:43" (1/1) ... [2025-03-04 11:23:43,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:23:43" (1/1) ... [2025-03-04 11:23:43,119 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:23:43" (1/1) ... [2025-03-04 11:23:43,123 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:23:43" (1/1) ... [2025-03-04 11:23:43,124 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:23:43" (1/1) ... [2025-03-04 11:23:43,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:23:43" (1/1) ... [2025-03-04 11:23:43,129 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:23:43,129 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:23:43,129 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:23:43,129 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:23:43,130 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:23:43" (1/1) ... [2025-03-04 11:23:43,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:23:43,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:23:43,159 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:23:43,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:23:43,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:23:43,180 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 11:23:43,180 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 11:23:43,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:23:43,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:23:43,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:23:43,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 11:23:43,181 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 11:23:43,222 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:23:43,223 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:23:43,640 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2025-03-04 11:23:43,640 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:23:43,650 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:23:43,651 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:23:43,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:23:43 BoogieIcfgContainer [2025-03-04 11:23:43,651 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:23:43,653 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:23:43,653 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:23:43,656 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:23:43,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:23:42" (1/3) ... [2025-03-04 11:23:43,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663e4c95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:23:43, skipping insertion in model container [2025-03-04 11:23:43,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:23:43" (2/3) ... [2025-03-04 11:23:43,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663e4c95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:23:43, skipping insertion in model container [2025-03-04 11:23:43,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:23:43" (3/3) ... [2025-03-04 11:23:43,659 INFO L128 eAbstractionObserver]: Analyzing ICFG ps5-ll_valuebound2.c [2025-03-04 11:23:43,668 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:23:43,669 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps5-ll_valuebound2.c that has 3 procedures, 191 locations, 1 initial locations, 1 loop locations, and 84 error locations. [2025-03-04 11:23:43,701 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:23:43,709 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;@1368691a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:23:43,709 INFO L334 AbstractCegarLoop]: Starting to check reachability of 84 error locations. [2025-03-04 11:23:43,712 INFO L276 IsEmpty]: Start isEmpty. Operand has 191 states, 99 states have (on average 1.8888888888888888) internal successors, (187), 183 states have internal predecessors, (187), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:23:43,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 11:23:43,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:23:43,718 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:23:43,718 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:23:43,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:23:43,723 INFO L85 PathProgramCache]: Analyzing trace with hash 444888282, now seen corresponding path program 1 times [2025-03-04 11:23:43,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:23:43,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047708925] [2025-03-04 11:23:43,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:23:43,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:23:43,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 11:23:43,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 11:23:43,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:23:43,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:23:43,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 11:23:43,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:23:43,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047708925] [2025-03-04 11:23:43,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047708925] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:23:43,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105023386] [2025-03-04 11:23:43,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:23:43,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:23:43,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:23:43,811 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:23:43,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:23:43,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 11:23:43,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 11:23:43,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:23:43,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:23:43,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 11:23:43,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:23:43,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 11:23:43,863 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:23:43,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105023386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:23:43,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:23:43,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 11:23:43,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393075765] [2025-03-04 11:23:43,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:23:43,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 11:23:43,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:23:43,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 11:23:43,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:23:43,884 INFO L87 Difference]: Start difference. First operand has 191 states, 99 states have (on average 1.8888888888888888) internal successors, (187), 183 states have internal predecessors, (187), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:23:43,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:23:43,913 INFO L93 Difference]: Finished difference Result 365 states and 394 transitions. [2025-03-04 11:23:43,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 11:23:43,915 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2025-03-04 11:23:43,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:23:43,919 INFO L225 Difference]: With dead ends: 365 [2025-03-04 11:23:43,920 INFO L226 Difference]: Without dead ends: 171 [2025-03-04 11:23:43,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:23:43,925 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:23:43,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:23:43,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-04 11:23:43,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2025-03-04 11:23:43,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 94 states have (on average 1.7553191489361701) internal successors, (165), 164 states have internal predecessors, (165), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 11:23:43,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2025-03-04 11:23:43,963 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 14 [2025-03-04 11:23:43,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:23:43,963 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2025-03-04 11:23:43,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:23:43,963 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2025-03-04 11:23:43,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 11:23:43,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:23:43,964 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:23:43,970 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-04 11:23:44,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 11:23:44,167 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:23:44,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:23:44,167 INFO L85 PathProgramCache]: Analyzing trace with hash 249298298, now seen corresponding path program 1 times [2025-03-04 11:23:44,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:23:44,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467720846] [2025-03-04 11:23:44,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:23:44,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:23:44,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 11:23:44,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 11:23:44,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:23:44,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:23:44,237 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-04 11:23:44,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:23:44,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467720846] [2025-03-04 11:23:44,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467720846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:23:44,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:23:44,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:23:44,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33312291] [2025-03-04 11:23:44,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:23:44,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:23:44,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:23:44,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:23:44,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:23:44,239 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:23:44,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:23:44,567 INFO L93 Difference]: Finished difference Result 307 states and 319 transitions. [2025-03-04 11:23:44,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:23:44,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2025-03-04 11:23:44,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:23:44,569 INFO L225 Difference]: With dead ends: 307 [2025-03-04 11:23:44,570 INFO L226 Difference]: Without dead ends: 251 [2025-03-04 11:23:44,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:23:44,571 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 82 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:23:44,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 125 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:23:44,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-04 11:23:44,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 245. [2025-03-04 11:23:44,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 167 states have (on average 1.5089820359281436) internal successors, (252), 237 states have internal predecessors, (252), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:23:44,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 262 transitions. [2025-03-04 11:23:44,582 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 262 transitions. Word has length 14 [2025-03-04 11:23:44,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:23:44,583 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 262 transitions. [2025-03-04 11:23:44,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:23:44,583 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 262 transitions. [2025-03-04 11:23:44,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 11:23:44,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:23:44,586 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:23:44,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:23:44,586 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:23:44,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:23:44,587 INFO L85 PathProgramCache]: Analyzing trace with hash 277918430, now seen corresponding path program 1 times [2025-03-04 11:23:44,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:23:44,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585254754] [2025-03-04 11:23:44,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:23:44,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:23:44,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 11:23:44,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 11:23:44,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:23:44,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:23:44,697 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-04 11:23:44,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:23:44,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585254754] [2025-03-04 11:23:44,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585254754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:23:44,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:23:44,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:23:44,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818259133] [2025-03-04 11:23:44,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:23:44,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:23:44,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:23:44,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:23:44,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:23:44,699 INFO L87 Difference]: Start difference. First operand 245 states and 262 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:23:44,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:23:44,753 INFO L93 Difference]: Finished difference Result 264 states and 276 transitions. [2025-03-04 11:23:44,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:23:44,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2025-03-04 11:23:44,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:23:44,754 INFO L225 Difference]: With dead ends: 264 [2025-03-04 11:23:44,754 INFO L226 Difference]: Without dead ends: 259 [2025-03-04 11:23:44,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:23:44,755 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 58 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:23:44,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 294 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:23:44,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-04 11:23:44,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 252. [2025-03-04 11:23:44,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 174 states have (on average 1.4885057471264367) internal successors, (259), 244 states have internal predecessors, (259), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:23:44,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 269 transitions. [2025-03-04 11:23:44,771 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 269 transitions. Word has length 42 [2025-03-04 11:23:44,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:23:44,771 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 269 transitions. [2025-03-04 11:23:44,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:23:44,771 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 269 transitions. [2025-03-04 11:23:44,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 11:23:44,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:23:44,772 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:23:44,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:23:44,772 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:23:44,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:23:44,772 INFO L85 PathProgramCache]: Analyzing trace with hash 791641628, now seen corresponding path program 1 times [2025-03-04 11:23:44,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:23:44,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465482771] [2025-03-04 11:23:44,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:23:44,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:23:44,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 11:23:44,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 11:23:44,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:23:44,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:23:44,888 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-04 11:23:44,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:23:44,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465482771] [2025-03-04 11:23:44,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465482771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:23:44,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:23:44,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:23:44,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826369057] [2025-03-04 11:23:44,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:23:44,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:23:44,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:23:44,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:23:44,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:23:44,890 INFO L87 Difference]: Start difference. First operand 252 states and 269 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:23:45,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:23:45,032 INFO L93 Difference]: Finished difference Result 263 states and 271 transitions. [2025-03-04 11:23:45,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:23:45,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2025-03-04 11:23:45,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:23:45,034 INFO L225 Difference]: With dead ends: 263 [2025-03-04 11:23:45,034 INFO L226 Difference]: Without dead ends: 258 [2025-03-04 11:23:45,034 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-04 11:23:45,035 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 132 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:23:45,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 231 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:23:45,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-04 11:23:45,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 252. [2025-03-04 11:23:45,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 174 states have (on average 1.4597701149425288) internal successors, (254), 244 states have internal predecessors, (254), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:23:45,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 264 transitions. [2025-03-04 11:23:45,051 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 264 transitions. Word has length 44 [2025-03-04 11:23:45,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:23:45,051 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 264 transitions. [2025-03-04 11:23:45,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:23:45,051 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 264 transitions. [2025-03-04 11:23:45,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 11:23:45,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:23:45,052 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:23:45,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:23:45,052 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:23:45,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:23:45,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1228913226, now seen corresponding path program 1 times [2025-03-04 11:23:45,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:23:45,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891867797] [2025-03-04 11:23:45,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:23:45,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:23:45,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 11:23:45,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 11:23:45,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:23:45,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:23:45,144 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-04 11:23:45,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:23:45,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891867797] [2025-03-04 11:23:45,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891867797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:23:45,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:23:45,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:23:45,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281562061] [2025-03-04 11:23:45,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:23:45,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:23:45,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:23:45,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:23:45,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:23:45,146 INFO L87 Difference]: Start difference. First operand 252 states and 264 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:23:45,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:23:45,450 INFO L93 Difference]: Finished difference Result 262 states and 266 transitions. [2025-03-04 11:23:45,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:23:45,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2025-03-04 11:23:45,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:23:45,451 INFO L225 Difference]: With dead ends: 262 [2025-03-04 11:23:45,452 INFO L226 Difference]: Without dead ends: 224 [2025-03-04 11:23:45,452 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-04 11:23:45,452 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 81 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:23:45,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 265 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:23:45,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-04 11:23:45,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 218. [2025-03-04 11:23:45,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 140 states have (on average 1.542857142857143) internal successors, (216), 210 states have internal predecessors, (216), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:23:45,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 226 transitions. [2025-03-04 11:23:45,459 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 226 transitions. Word has length 45 [2025-03-04 11:23:45,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:23:45,459 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 226 transitions. [2025-03-04 11:23:45,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:23:45,459 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 226 transitions. [2025-03-04 11:23:45,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 11:23:45,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:23:45,460 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:23:45,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:23:45,460 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:23:45,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:23:45,461 INFO L85 PathProgramCache]: Analyzing trace with hash -218506347, now seen corresponding path program 1 times [2025-03-04 11:23:45,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:23:45,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543188943] [2025-03-04 11:23:45,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:23:45,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:23:45,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 11:23:45,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 11:23:45,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:23:45,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:23:45,508 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-04 11:23:45,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:23:45,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543188943] [2025-03-04 11:23:45,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543188943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:23:45,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:23:45,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:23:45,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205512680] [2025-03-04 11:23:45,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:23:45,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:23:45,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:23:45,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:23:45,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:23:45,509 INFO L87 Difference]: Start difference. First operand 218 states and 226 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:23:45,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:23:45,521 INFO L93 Difference]: Finished difference Result 220 states and 226 transitions. [2025-03-04 11:23:45,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:23:45,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2025-03-04 11:23:45,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:23:45,523 INFO L225 Difference]: With dead ends: 220 [2025-03-04 11:23:45,523 INFO L226 Difference]: Without dead ends: 218 [2025-03-04 11:23:45,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:23:45,523 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 1 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:23:45,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 335 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:23:45,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-04 11:23:45,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-03-04 11:23:45,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 140 states have (on average 1.5285714285714285) internal successors, (214), 210 states have internal predecessors, (214), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:23:45,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 224 transitions. [2025-03-04 11:23:45,529 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 224 transitions. Word has length 54 [2025-03-04 11:23:45,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:23:45,529 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 224 transitions. [2025-03-04 11:23:45,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:23:45,530 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 224 transitions. [2025-03-04 11:23:45,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-04 11:23:45,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:23:45,530 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:23:45,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 11:23:45,531 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:23:45,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:23:45,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1203634290, now seen corresponding path program 1 times [2025-03-04 11:23:45,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:23:45,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089430635] [2025-03-04 11:23:45,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:23:45,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:23:45,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 11:23:45,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 11:23:45,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:23:45,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:23:45,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1235346706] [2025-03-04 11:23:45,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:23:45,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:23:45,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:23:45,553 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:23:45,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:23:45,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 11:23:45,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 11:23:45,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:23:45,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:23:45,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:23:45,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:23:45,669 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-04 11:23:45,669 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:23:45,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:23:45,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089430635] [2025-03-04 11:23:45,669 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:23:45,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235346706] [2025-03-04 11:23:45,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235346706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:23:45,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:23:45,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:23:45,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400502265] [2025-03-04 11:23:45,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:23:45,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:23:45,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:23:45,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:23:45,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:23:45,671 INFO L87 Difference]: Start difference. First operand 218 states and 224 transitions. Second operand has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:23:45,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:23:45,957 INFO L93 Difference]: Finished difference Result 356 states and 372 transitions. [2025-03-04 11:23:45,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:23:45,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2025-03-04 11:23:45,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:23:45,959 INFO L225 Difference]: With dead ends: 356 [2025-03-04 11:23:45,959 INFO L226 Difference]: Without dead ends: 302 [2025-03-04 11:23:45,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:23:45,960 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 89 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:23:45,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 149 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:23:45,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-03-04 11:23:45,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 296. [2025-03-04 11:23:45,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 216 states have (on average 1.4074074074074074) internal successors, (304), 286 states have internal predecessors, (304), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:23:45,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 318 transitions. [2025-03-04 11:23:45,966 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 318 transitions. Word has length 59 [2025-03-04 11:23:45,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:23:45,966 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 318 transitions. [2025-03-04 11:23:45,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:23:45,967 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 318 transitions. [2025-03-04 11:23:45,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 11:23:45,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:23:45,967 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:23:45,974 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-04 11:23:46,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 11:23:46,168 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:23:46,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:23:46,168 INFO L85 PathProgramCache]: Analyzing trace with hash -609393688, now seen corresponding path program 1 times [2025-03-04 11:23:46,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:23:46,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940693440] [2025-03-04 11:23:46,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:23:46,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:23:46,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 11:23:46,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 11:23:46,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:23:46,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:23:46,221 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-04 11:23:46,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:23:46,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940693440] [2025-03-04 11:23:46,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940693440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:23:46,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:23:46,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:23:46,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465457169] [2025-03-04 11:23:46,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:23:46,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:23:46,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:23:46,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:23:46,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:23:46,223 INFO L87 Difference]: Start difference. First operand 296 states and 318 transitions. Second operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:23:46,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:23:46,287 INFO L93 Difference]: Finished difference Result 297 states and 318 transitions. [2025-03-04 11:23:46,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:23:46,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2025-03-04 11:23:46,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:23:46,288 INFO L225 Difference]: With dead ends: 297 [2025-03-04 11:23:46,288 INFO L226 Difference]: Without dead ends: 296 [2025-03-04 11:23:46,289 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-04 11:23:46,289 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 38 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:23:46,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 278 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:23:46,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-04 11:23:46,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2025-03-04 11:23:46,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 216 states have (on average 1.4027777777777777) internal successors, (303), 286 states have internal predecessors, (303), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:23:46,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 317 transitions. [2025-03-04 11:23:46,295 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 317 transitions. Word has length 65 [2025-03-04 11:23:46,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:23:46,295 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 317 transitions. [2025-03-04 11:23:46,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:23:46,296 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 317 transitions. [2025-03-04 11:23:46,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 11:23:46,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:23:46,296 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:23:46,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 11:23:46,296 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:23:46,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:23:46,297 INFO L85 PathProgramCache]: Analyzing trace with hash -2104697332, now seen corresponding path program 1 times [2025-03-04 11:23:46,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:23:46,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337977520] [2025-03-04 11:23:46,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:23:46,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:23:46,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 11:23:46,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 11:23:46,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:23:46,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:23:46,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1078884534] [2025-03-04 11:23:46,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:23:46,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:23:46,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:23:46,316 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:23:46,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:23:46,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 11:23:46,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 11:23:46,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:23:46,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:23:46,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:23:46,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:23:46,474 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 11:23:46,474 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:23:46,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:23:46,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337977520] [2025-03-04 11:23:46,474 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:23:46,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078884534] [2025-03-04 11:23:46,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078884534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:23:46,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:23:46,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:23:46,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156030635] [2025-03-04 11:23:46,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:23:46,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:23:46,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:23:46,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:23:46,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:23:46,475 INFO L87 Difference]: Start difference. First operand 296 states and 317 transitions. Second operand has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:23:46,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:23:46,513 INFO L93 Difference]: Finished difference Result 296 states and 317 transitions. [2025-03-04 11:23:46,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:23:46,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 94 [2025-03-04 11:23:46,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:23:46,515 INFO L225 Difference]: With dead ends: 296 [2025-03-04 11:23:46,515 INFO L226 Difference]: Without dead ends: 293 [2025-03-04 11:23:46,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:23:46,516 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 95 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:23:46,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 158 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:23:46,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-04 11:23:46,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2025-03-04 11:23:46,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 216 states have (on average 1.3796296296296295) internal successors, (298), 283 states have internal predecessors, (298), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:23:46,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 312 transitions. [2025-03-04 11:23:46,529 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 312 transitions. Word has length 94 [2025-03-04 11:23:46,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:23:46,530 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 312 transitions. [2025-03-04 11:23:46,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:23:46,530 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 312 transitions. [2025-03-04 11:23:46,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 11:23:46,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:23:46,531 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:23:46,536 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-04 11:23:46,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:23:46,733 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:23:46,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:23:46,733 INFO L85 PathProgramCache]: Analyzing trace with hash -821107766, now seen corresponding path program 1 times [2025-03-04 11:23:46,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:23:46,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326873866] [2025-03-04 11:23:46,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:23:46,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:23:46,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 11:23:46,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 11:23:46,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:23:46,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:23:46,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1626714520] [2025-03-04 11:23:46,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:23:46,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:23:46,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:23:46,751 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:23:46,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:23:46,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 11:23:46,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 11:23:46,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:23:46,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:23:46,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:23:46,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:23:46,972 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:23:46,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:23:47,127 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:23:47,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:23:47,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326873866] [2025-03-04 11:23:47,128 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:23:47,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626714520] [2025-03-04 11:23:47,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626714520] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:23:47,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:23:47,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-04 11:23:47,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050756390] [2025-03-04 11:23:47,128 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:23:47,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:23:47,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:23:47,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:23:47,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:23:47,129 INFO L87 Difference]: Start difference. First operand 293 states and 312 transitions. Second operand has 8 states, 7 states have (on average 23.428571428571427) internal successors, (164), 8 states have internal predecessors, (164), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:23:47,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:23:47,689 INFO L93 Difference]: Finished difference Result 364 states and 379 transitions. [2025-03-04 11:23:47,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:23:47,689 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 23.428571428571427) internal successors, (164), 8 states have internal predecessors, (164), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 95 [2025-03-04 11:23:47,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:23:47,690 INFO L225 Difference]: With dead ends: 364 [2025-03-04 11:23:47,691 INFO L226 Difference]: Without dead ends: 357 [2025-03-04 11:23:47,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:23:47,691 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 285 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:23:47,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 310 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:23:47,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-04 11:23:47,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 330. [2025-03-04 11:23:47,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 254 states have (on average 1.4015748031496063) internal successors, (356), 320 states have internal predecessors, (356), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:23:47,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 370 transitions. [2025-03-04 11:23:47,698 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 370 transitions. Word has length 95 [2025-03-04 11:23:47,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:23:47,699 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 370 transitions. [2025-03-04 11:23:47,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 23.428571428571427) internal successors, (164), 8 states have internal predecessors, (164), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:23:47,699 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 370 transitions. [2025-03-04 11:23:47,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 11:23:47,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:23:47,700 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:23:47,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 11:23:47,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:23:47,900 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:23:47,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:23:47,900 INFO L85 PathProgramCache]: Analyzing trace with hash 315463114, now seen corresponding path program 1 times [2025-03-04 11:23:47,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:23:47,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054002714] [2025-03-04 11:23:47,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:23:47,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:23:47,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 11:23:47,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 11:23:47,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:23:47,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:23:47,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [702491121] [2025-03-04 11:23:47,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:23:47,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:23:47,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:23:47,926 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:23:47,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:23:47,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 11:23:47,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 11:23:47,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:23:47,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:23:47,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 11:23:47,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:23:48,185 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:23:48,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:23:48,888 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:23:48,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:23:48,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054002714] [2025-03-04 11:23:48,888 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:23:48,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702491121] [2025-03-04 11:23:48,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702491121] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 11:23:48,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:23:48,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2025-03-04 11:23:48,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690484489] [2025-03-04 11:23:48,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:23:48,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:23:48,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:23:48,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:23:48,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:23:48,889 INFO L87 Difference]: Start difference. First operand 330 states and 370 transitions. Second operand has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:23:51,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:23:55,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:23:59,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:04,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:06,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:09,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:11,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:14,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:16,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:18,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:21,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:23,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:23,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:23,643 INFO L93 Difference]: Finished difference Result 330 states and 370 transitions. [2025-03-04 11:24:23,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:24:23,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 96 [2025-03-04 11:24:23,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:23,645 INFO L225 Difference]: With dead ends: 330 [2025-03-04 11:24:23,645 INFO L226 Difference]: Without dead ends: 328 [2025-03-04 11:24:23,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:24:23,645 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 145 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 8 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.7s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:23,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 81 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 482 Invalid, 3 Unknown, 0 Unchecked, 34.7s Time] [2025-03-04 11:24:23,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-04 11:24:23,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2025-03-04 11:24:23,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 254 states have (on average 1.3858267716535433) internal successors, (352), 318 states have internal predecessors, (352), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:24:23,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 366 transitions. [2025-03-04 11:24:23,656 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 366 transitions. Word has length 96 [2025-03-04 11:24:23,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:23,656 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 366 transitions. [2025-03-04 11:24:23,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:24:23,657 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 366 transitions. [2025-03-04 11:24:23,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 11:24:23,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:23,657 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:23,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:24:23,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 11:24:23,859 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:24:23,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:23,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1189422024, now seen corresponding path program 1 times [2025-03-04 11:24:23,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:23,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178961850] [2025-03-04 11:24:23,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:23,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:23,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 11:24:23,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 11:24:23,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:23,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:24:23,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [951717040] [2025-03-04 11:24:23,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:23,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:23,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:23,890 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:23,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:24:23,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 11:24:23,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 11:24:23,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:23,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:23,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:24:23,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:24,055 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:24:24,055 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:24:24,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:24,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178961850] [2025-03-04 11:24:24,056 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:24:24,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951717040] [2025-03-04 11:24:24,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951717040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:24:24,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:24:24,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:24:24,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613973212] [2025-03-04 11:24:24,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:24:24,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:24:24,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:24,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:24:24,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:24:24,059 INFO L87 Difference]: Start difference. First operand 328 states and 366 transitions. Second operand has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:24:24,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:24,283 INFO L93 Difference]: Finished difference Result 328 states and 366 transitions. [2025-03-04 11:24:24,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:24:24,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 97 [2025-03-04 11:24:24,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:24,285 INFO L225 Difference]: With dead ends: 328 [2025-03-04 11:24:24,285 INFO L226 Difference]: Without dead ends: 308 [2025-03-04 11:24:24,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:24:24,286 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 200 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:24,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 46 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:24:24,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-04 11:24:24,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2025-03-04 11:24:24,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 254 states have (on average 1.2677165354330708) internal successors, (322), 298 states have internal predecessors, (322), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:24:24,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 336 transitions. [2025-03-04 11:24:24,294 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 336 transitions. Word has length 97 [2025-03-04 11:24:24,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:24,294 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 336 transitions. [2025-03-04 11:24:24,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:24:24,294 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 336 transitions. [2025-03-04 11:24:24,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 11:24:24,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:24,295 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:24,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 11:24:24,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:24,499 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:24:24,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:24,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1782622840, now seen corresponding path program 1 times [2025-03-04 11:24:24,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:24,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127480299] [2025-03-04 11:24:24,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:24,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:24,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 11:24:24,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 11:24:24,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:24,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:24:24,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [661814728] [2025-03-04 11:24:24,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:24,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:24,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:24,520 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:24,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:24:24,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 11:24:24,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 11:24:24,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:24,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:24,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:24:24,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:24,726 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:24:24,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:24:24,906 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 11:24:24,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:24,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127480299] [2025-03-04 11:24:24,906 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:24:24,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661814728] [2025-03-04 11:24:24,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661814728] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 11:24:24,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:24:24,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-04 11:24:24,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075184329] [2025-03-04 11:24:24,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:24:24,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:24:24,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:24,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:24:24,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:24:24,908 INFO L87 Difference]: Start difference. First operand 308 states and 336 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:24:27,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:31,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:35,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:39,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:46,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.63s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 11:24:46,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:46,226 INFO L93 Difference]: Finished difference Result 308 states and 336 transitions. [2025-03-04 11:24:46,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:24:46,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 98 [2025-03-04 11:24:46,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:46,227 INFO L225 Difference]: With dead ends: 308 [2025-03-04 11:24:46,228 INFO L226 Difference]: Without dead ends: 306 [2025-03-04 11:24:46,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:24:46,228 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 78 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:46,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 55 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 277 Invalid, 4 Unknown, 0 Unchecked, 21.3s Time] [2025-03-04 11:24:46,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-04 11:24:46,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2025-03-04 11:24:46,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 254 states have (on average 1.2519685039370079) internal successors, (318), 296 states have internal predecessors, (318), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:24:46,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 332 transitions. [2025-03-04 11:24:46,239 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 332 transitions. Word has length 98 [2025-03-04 11:24:46,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:46,239 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 332 transitions. [2025-03-04 11:24:46,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:24:46,240 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 332 transitions. [2025-03-04 11:24:46,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 11:24:46,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:46,240 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:46,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 11:24:46,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:46,441 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:24:46,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:46,441 INFO L85 PathProgramCache]: Analyzing trace with hash 681095619, now seen corresponding path program 1 times [2025-03-04 11:24:46,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:46,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273476682] [2025-03-04 11:24:46,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:46,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:46,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 11:24:46,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 11:24:46,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:46,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:46,551 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:24:46,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:46,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273476682] [2025-03-04 11:24:46,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273476682] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:24:46,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598481243] [2025-03-04 11:24:46,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:46,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:46,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:46,556 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:46,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:24:46,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 11:24:46,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 11:24:46,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:46,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:46,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:24:46,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:46,665 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:24:46,666 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:24:46,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598481243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:24:46,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:24:46,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 11:24:46,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143382277] [2025-03-04 11:24:46,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:24:46,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:24:46,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:46,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:24:46,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:24:46,667 INFO L87 Difference]: Start difference. First operand 306 states and 332 transitions. Second operand has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 4 states have internal predecessors, (92), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:24:46,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:46,686 INFO L93 Difference]: Finished difference Result 306 states and 332 transitions. [2025-03-04 11:24:46,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:24:46,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 4 states have internal predecessors, (92), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 106 [2025-03-04 11:24:46,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:46,687 INFO L225 Difference]: With dead ends: 306 [2025-03-04 11:24:46,687 INFO L226 Difference]: Without dead ends: 305 [2025-03-04 11:24:46,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:24:46,688 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 25 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:46,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 347 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:24:46,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-03-04 11:24:46,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2025-03-04 11:24:46,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 254 states have (on average 1.2440944881889764) internal successors, (316), 295 states have internal predecessors, (316), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:24:46,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 330 transitions. [2025-03-04 11:24:46,696 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 330 transitions. Word has length 106 [2025-03-04 11:24:46,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:46,696 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 330 transitions. [2025-03-04 11:24:46,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 4 states have internal predecessors, (92), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:24:46,696 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 330 transitions. [2025-03-04 11:24:46,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 11:24:46,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:46,697 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:46,703 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-04 11:24:46,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 11:24:46,898 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:24:46,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:46,898 INFO L85 PathProgramCache]: Analyzing trace with hash -360872220, now seen corresponding path program 1 times [2025-03-04 11:24:46,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:46,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600530240] [2025-03-04 11:24:46,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:46,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:46,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 11:24:46,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 11:24:46,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:46,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:46,967 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:24:46,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:46,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600530240] [2025-03-04 11:24:46,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600530240] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:24:46,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108970052] [2025-03-04 11:24:46,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:46,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:46,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:46,970 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:46,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:24:46,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 11:24:47,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 11:24:47,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:47,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:47,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:24:47,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:47,078 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:24:47,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:24:47,164 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:24:47,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108970052] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:24:47,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:24:47,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 11:24:47,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405632078] [2025-03-04 11:24:47,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:24:47,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:24:47,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:47,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:24:47,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:24:47,166 INFO L87 Difference]: Start difference. First operand 305 states and 330 transitions. Second operand has 7 states, 6 states have (on average 36.0) internal successors, (216), 7 states have internal predecessors, (216), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-04 11:24:47,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:47,200 INFO L93 Difference]: Finished difference Result 403 states and 416 transitions. [2025-03-04 11:24:47,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:24:47,200 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 36.0) internal successors, (216), 7 states have internal predecessors, (216), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 107 [2025-03-04 11:24:47,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:47,201 INFO L225 Difference]: With dead ends: 403 [2025-03-04 11:24:47,202 INFO L226 Difference]: Without dead ends: 402 [2025-03-04 11:24:47,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:24:47,202 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 51 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:47,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 729 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:24:47,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-03-04 11:24:47,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 361. [2025-03-04 11:24:47,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 308 states have (on average 1.2824675324675325) internal successors, (395), 349 states have internal predecessors, (395), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:24:47,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 413 transitions. [2025-03-04 11:24:47,211 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 413 transitions. Word has length 107 [2025-03-04 11:24:47,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:47,212 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 413 transitions. [2025-03-04 11:24:47,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 36.0) internal successors, (216), 7 states have internal predecessors, (216), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-04 11:24:47,212 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 413 transitions. [2025-03-04 11:24:47,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 11:24:47,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:47,212 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:47,218 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-04 11:24:47,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 11:24:47,413 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:24:47,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:47,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1248322858, now seen corresponding path program 1 times [2025-03-04 11:24:47,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:47,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808119491] [2025-03-04 11:24:47,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:47,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:47,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 11:24:47,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 11:24:47,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:47,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:47,459 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 11:24:47,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:47,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808119491] [2025-03-04 11:24:47,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808119491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:24:47,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:24:47,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:24:47,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43812934] [2025-03-04 11:24:47,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:24:47,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:24:47,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:47,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:24:47,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:24:47,461 INFO L87 Difference]: Start difference. First operand 361 states and 413 transitions. Second operand has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:24:47,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:47,600 INFO L93 Difference]: Finished difference Result 361 states and 413 transitions. [2025-03-04 11:24:47,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:24:47,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 118 [2025-03-04 11:24:47,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:47,602 INFO L225 Difference]: With dead ends: 361 [2025-03-04 11:24:47,602 INFO L226 Difference]: Without dead ends: 354 [2025-03-04 11:24:47,603 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-04 11:24:47,603 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 78 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:47,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 53 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:24:47,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-04 11:24:47,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2025-03-04 11:24:47,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 308 states have (on average 1.2370129870129871) internal successors, (381), 342 states have internal predecessors, (381), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:24:47,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 399 transitions. [2025-03-04 11:24:47,613 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 399 transitions. Word has length 118 [2025-03-04 11:24:47,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:47,613 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 399 transitions. [2025-03-04 11:24:47,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:24:47,613 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 399 transitions. [2025-03-04 11:24:47,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 11:24:47,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:47,614 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:47,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 11:24:47,614 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:24:47,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:47,614 INFO L85 PathProgramCache]: Analyzing trace with hash -43302792, now seen corresponding path program 1 times [2025-03-04 11:24:47,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:47,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289367499] [2025-03-04 11:24:47,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:47,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:47,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 11:24:47,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 11:24:47,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:47,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:47,681 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 11:24:47,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:47,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289367499] [2025-03-04 11:24:47,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289367499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:24:47,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:24:47,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:24:47,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234060187] [2025-03-04 11:24:47,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:24:47,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:24:47,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:47,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:24:47,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:24:47,683 INFO L87 Difference]: Start difference. First operand 354 states and 399 transitions. Second operand has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:24:47,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:47,803 INFO L93 Difference]: Finished difference Result 354 states and 399 transitions. [2025-03-04 11:24:47,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:24:47,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 119 [2025-03-04 11:24:47,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:47,804 INFO L225 Difference]: With dead ends: 354 [2025-03-04 11:24:47,804 INFO L226 Difference]: Without dead ends: 353 [2025-03-04 11:24:47,804 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-04 11:24:47,805 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 107 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:47,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 40 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:24:47,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-04 11:24:47,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2025-03-04 11:24:47,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 308 states have (on average 1.2272727272727273) internal successors, (378), 341 states have internal predecessors, (378), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:24:47,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 396 transitions. [2025-03-04 11:24:47,815 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 396 transitions. Word has length 119 [2025-03-04 11:24:47,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:47,815 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 396 transitions. [2025-03-04 11:24:47,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:24:47,815 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 396 transitions. [2025-03-04 11:24:47,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 11:24:47,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:47,816 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:47,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 11:24:47,816 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:24:47,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:47,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1335694326, now seen corresponding path program 1 times [2025-03-04 11:24:47,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:47,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544460101] [2025-03-04 11:24:47,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:47,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:47,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 11:24:47,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 11:24:47,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:47,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:24:47,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1112590753] [2025-03-04 11:24:47,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:47,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:47,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:47,838 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:47,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 11:24:47,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 11:24:47,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 11:24:47,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:47,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:47,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:24:47,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:47,963 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:24:47,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:24:48,116 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:24:48,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:48,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544460101] [2025-03-04 11:24:48,117 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:24:48,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112590753] [2025-03-04 11:24:48,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112590753] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:24:48,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:24:48,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-04 11:24:48,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398870365] [2025-03-04 11:24:48,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:24:48,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:24:48,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:48,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:24:48,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:24:48,118 INFO L87 Difference]: Start difference. First operand 353 states and 396 transitions. Second operand has 8 states, 7 states have (on average 29.428571428571427) internal successors, (206), 8 states have internal predecessors, (206), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:24:48,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:48,550 INFO L93 Difference]: Finished difference Result 414 states and 449 transitions. [2025-03-04 11:24:48,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:24:48,551 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 29.428571428571427) internal successors, (206), 8 states have internal predecessors, (206), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 121 [2025-03-04 11:24:48,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:48,552 INFO L225 Difference]: With dead ends: 414 [2025-03-04 11:24:48,552 INFO L226 Difference]: Without dead ends: 384 [2025-03-04 11:24:48,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:24:48,553 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 417 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:48,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 158 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:24:48,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-03-04 11:24:48,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 337. [2025-03-04 11:24:48,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 297 states have (on average 1.1683501683501682) internal successors, (347), 326 states have internal predecessors, (347), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:24:48,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 363 transitions. [2025-03-04 11:24:48,563 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 363 transitions. Word has length 121 [2025-03-04 11:24:48,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:48,563 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 363 transitions. [2025-03-04 11:24:48,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 29.428571428571427) internal successors, (206), 8 states have internal predecessors, (206), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 11:24:48,564 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 363 transitions. [2025-03-04 11:24:48,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-04 11:24:48,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:48,564 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:48,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 11:24:48,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 11:24:48,765 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:24:48,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:48,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1237571047, now seen corresponding path program 1 times [2025-03-04 11:24:48,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:48,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798195677] [2025-03-04 11:24:48,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:48,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:48,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 11:24:48,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 11:24:48,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:48,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:24:48,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1974979962] [2025-03-04 11:24:48,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:48,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:48,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:48,782 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:48,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 11:24:48,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-04 11:24:48,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-04 11:24:48,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:48,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:48,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:24:48,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:49,108 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:24:49,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:24:49,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:49,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798195677] [2025-03-04 11:24:49,605 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:24:49,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974979962] [2025-03-04 11:24:49,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974979962] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:24:49,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:24:49,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-04 11:24:49,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999795937] [2025-03-04 11:24:49,606 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:24:49,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:24:49,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:49,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:24:49,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:24:49,607 INFO L87 Difference]: Start difference. First operand 337 states and 363 transitions. Second operand has 7 states, 6 states have (on average 21.0) internal successors, (126), 7 states have internal predecessors, (126), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 11:24:49,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:49,882 INFO L93 Difference]: Finished difference Result 375 states and 402 transitions. [2025-03-04 11:24:49,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:24:49,882 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 21.0) internal successors, (126), 7 states have internal predecessors, (126), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 145 [2025-03-04 11:24:49,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:49,883 INFO L225 Difference]: With dead ends: 375 [2025-03-04 11:24:49,883 INFO L226 Difference]: Without dead ends: 374 [2025-03-04 11:24:49,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:24:49,884 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 19 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:49,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 271 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:24:49,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-03-04 11:24:49,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2025-03-04 11:24:49,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 332 states have (on average 1.1506024096385543) internal successors, (382), 361 states have internal predecessors, (382), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:24:49,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 400 transitions. [2025-03-04 11:24:49,897 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 400 transitions. Word has length 145 [2025-03-04 11:24:49,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:49,897 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 400 transitions. [2025-03-04 11:24:49,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 21.0) internal successors, (126), 7 states have internal predecessors, (126), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 11:24:49,897 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 400 transitions. [2025-03-04 11:24:49,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 11:24:49,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:49,899 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:49,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 11:24:50,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:50,099 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:24:50,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:50,100 INFO L85 PathProgramCache]: Analyzing trace with hash -290003229, now seen corresponding path program 1 times [2025-03-04 11:24:50,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:50,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831249932] [2025-03-04 11:24:50,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:50,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:50,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 11:24:50,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 11:24:50,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:50,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:24:50,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1423646814] [2025-03-04 11:24:50,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:50,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:50,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:50,115 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:50,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 11:24:50,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 11:24:50,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 11:24:50,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:50,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:50,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:24:50,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:50,392 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 11:24:50,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:24:50,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:50,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831249932] [2025-03-04 11:24:50,990 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:24:50,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423646814] [2025-03-04 11:24:50,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423646814] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:24:50,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:24:50,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-04 11:24:50,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872160638] [2025-03-04 11:24:50,991 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:24:50,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:24:50,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:50,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:24:50,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:24:50,991 INFO L87 Difference]: Start difference. First operand 373 states and 400 transitions. Second operand has 7 states, 6 states have (on average 21.166666666666668) internal successors, (127), 7 states have internal predecessors, (127), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 11:24:51,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:51,179 INFO L93 Difference]: Finished difference Result 375 states and 401 transitions. [2025-03-04 11:24:51,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:24:51,179 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 21.166666666666668) internal successors, (127), 7 states have internal predecessors, (127), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 146 [2025-03-04 11:24:51,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:51,180 INFO L225 Difference]: With dead ends: 375 [2025-03-04 11:24:51,180 INFO L226 Difference]: Without dead ends: 337 [2025-03-04 11:24:51,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:24:51,181 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 21 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:51,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 288 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:24:51,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-04 11:24:51,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2025-03-04 11:24:51,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 297 states have (on average 1.164983164983165) internal successors, (346), 326 states have internal predecessors, (346), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:24:51,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 362 transitions. [2025-03-04 11:24:51,190 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 362 transitions. Word has length 146 [2025-03-04 11:24:51,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:51,191 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 362 transitions. [2025-03-04 11:24:51,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 21.166666666666668) internal successors, (127), 7 states have internal predecessors, (127), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 11:24:51,191 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 362 transitions. [2025-03-04 11:24:51,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-04 11:24:51,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:51,192 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:51,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 11:24:51,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:51,393 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:24:51,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:51,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1678438709, now seen corresponding path program 1 times [2025-03-04 11:24:51,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:51,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730607598] [2025-03-04 11:24:51,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:51,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:51,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 11:24:51,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 11:24:51,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:51,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:51,637 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 60 proven. 77 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 11:24:51,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:51,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730607598] [2025-03-04 11:24:51,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730607598] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:24:51,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996611440] [2025-03-04 11:24:51,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:24:51,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:51,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:51,640 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:51,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 11:24:51,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 11:24:51,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 11:24:51,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:24:51,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:51,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:24:51,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:52,122 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 134 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 11:24:52,122 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:24:52,304 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 134 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 11:24:52,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996611440] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:24:52,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:24:52,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-03-04 11:24:52,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146251215] [2025-03-04 11:24:52,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:24:52,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 11:24:52,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:52,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 11:24:52,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:24:52,306 INFO L87 Difference]: Start difference. First operand 337 states and 362 transitions. Second operand has 16 states, 16 states have (on average 25.625) internal successors, (410), 14 states have internal predecessors, (410), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-04 11:24:52,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:52,386 INFO L93 Difference]: Finished difference Result 355 states and 379 transitions. [2025-03-04 11:24:52,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:24:52,386 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 25.625) internal successors, (410), 14 states have internal predecessors, (410), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 164 [2025-03-04 11:24:52,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:52,387 INFO L225 Difference]: With dead ends: 355 [2025-03-04 11:24:52,387 INFO L226 Difference]: Without dead ends: 186 [2025-03-04 11:24:52,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2025-03-04 11:24:52,388 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 73 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:52,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 783 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:24:52,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-04 11:24:52,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2025-03-04 11:24:52,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 174 states have (on average 1.0057471264367817) internal successors, (175), 175 states have internal predecessors, (175), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 11:24:52,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 187 transitions. [2025-03-04 11:24:52,395 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 187 transitions. Word has length 164 [2025-03-04 11:24:52,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:52,395 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 187 transitions. [2025-03-04 11:24:52,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 25.625) internal successors, (410), 14 states have internal predecessors, (410), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-04 11:24:52,395 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 187 transitions. [2025-03-04 11:24:52,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-04 11:24:52,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:24:52,396 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:52,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 11:24:52,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 11:24:52,597 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 81 more)] === [2025-03-04 11:24:52,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:24:52,598 INFO L85 PathProgramCache]: Analyzing trace with hash -2043870471, now seen corresponding path program 2 times [2025-03-04 11:24:52,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:24:52,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966187556] [2025-03-04 11:24:52,598 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:24:52,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:24:52,605 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 197 statements into 2 equivalence classes. [2025-03-04 11:24:52,617 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 197 of 197 statements. [2025-03-04 11:24:52,617 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:24:52,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:24:52,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [990805407] [2025-03-04 11:24:52,618 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:24:52,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:52,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:24:52,621 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:24:52,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 11:24:52,647 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 197 statements into 2 equivalence classes. [2025-03-04 11:24:52,655 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 197 statements. [2025-03-04 11:24:52,656 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 11:24:52,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:24:52,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:24:52,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:24:53,093 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 11:24:53,094 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:24:53,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:24:53,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966187556] [2025-03-04 11:24:53,094 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:24:53,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990805407] [2025-03-04 11:24:53,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990805407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:24:53,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:24:53,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:24:53,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191327413] [2025-03-04 11:24:53,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:24:53,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:24:53,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:24:53,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:24:53,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:24:53,095 INFO L87 Difference]: Start difference. First operand 184 states and 187 transitions. Second operand has 4 states, 3 states have (on average 36.333333333333336) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:24:53,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:24:53,182 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2025-03-04 11:24:53,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:24:53,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 36.333333333333336) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 197 [2025-03-04 11:24:53,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:24:53,183 INFO L225 Difference]: With dead ends: 184 [2025-03-04 11:24:53,183 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 11:24:53,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 194 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-04 11:24:53,186 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 23 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:24:53,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 42 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:24:53,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 11:24:53,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 11:24:53,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:24:53,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 11:24:53,187 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 197 [2025-03-04 11:24:53,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:24:53,187 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 11:24:53,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 36.333333333333336) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:24:53,187 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 11:24:53,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 11:24:53,188 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 84 remaining) [2025-03-04 11:24:53,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 84 remaining) [2025-03-04 11:24:53,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 84 remaining) [2025-03-04 11:24:53,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 84 remaining) [2025-03-04 11:24:53,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 84 remaining) [2025-03-04 11:24:53,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 84 remaining) [2025-03-04 11:24:53,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 84 remaining) [2025-03-04 11:24:53,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 84 remaining) [2025-03-04 11:24:53,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 84 remaining) [2025-03-04 11:24:53,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 84 remaining) [2025-03-04 11:24:53,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 84 remaining) [2025-03-04 11:24:53,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 84 remaining) [2025-03-04 11:24:53,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 84 remaining) [2025-03-04 11:24:53,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 84 remaining) [2025-03-04 11:24:53,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 84 remaining) [2025-03-04 11:24:53,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 84 remaining) [2025-03-04 11:24:53,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 84 remaining) [2025-03-04 11:24:53,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 84 remaining) [2025-03-04 11:24:53,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 84 remaining) [2025-03-04 11:24:53,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 84 remaining) [2025-03-04 11:24:53,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 84 remaining) [2025-03-04 11:24:53,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 84 remaining) [2025-03-04 11:24:53,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 84 remaining) [2025-03-04 11:24:53,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 84 remaining) [2025-03-04 11:24:53,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 84 remaining) [2025-03-04 11:24:53,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 84 remaining) [2025-03-04 11:24:53,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 84 remaining) [2025-03-04 11:24:53,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 84 remaining) [2025-03-04 11:24:53,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 84 remaining) [2025-03-04 11:24:53,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 84 remaining) [2025-03-04 11:24:53,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 84 remaining) [2025-03-04 11:24:53,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 84 remaining) [2025-03-04 11:24:53,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 84 remaining) [2025-03-04 11:24:53,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 84 remaining) [2025-03-04 11:24:53,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 84 remaining) [2025-03-04 11:24:53,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 84 remaining) [2025-03-04 11:24:53,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 84 remaining) [2025-03-04 11:24:53,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 84 remaining) [2025-03-04 11:24:53,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 84 remaining) [2025-03-04 11:24:53,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 84 remaining) [2025-03-04 11:24:53,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 84 remaining) [2025-03-04 11:24:53,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 84 remaining) [2025-03-04 11:24:53,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 84 remaining) [2025-03-04 11:24:53,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 84 remaining) [2025-03-04 11:24:53,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 84 remaining) [2025-03-04 11:24:53,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 84 remaining) [2025-03-04 11:24:53,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 84 remaining) [2025-03-04 11:24:53,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 84 remaining) [2025-03-04 11:24:53,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 84 remaining) [2025-03-04 11:24:53,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 84 remaining) [2025-03-04 11:24:53,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 84 remaining) [2025-03-04 11:24:53,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 84 remaining) [2025-03-04 11:24:53,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 84 remaining) [2025-03-04 11:24:53,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 84 remaining) [2025-03-04 11:24:53,190 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 84 remaining) [2025-03-04 11:24:53,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 84 remaining) [2025-03-04 11:24:53,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 84 remaining) [2025-03-04 11:24:53,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 84 remaining) [2025-03-04 11:24:53,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 84 remaining) [2025-03-04 11:24:53,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 84 remaining) [2025-03-04 11:24:53,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 84 remaining) [2025-03-04 11:24:53,191 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 84 remaining) [2025-03-04 11:24:53,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 84 remaining) [2025-03-04 11:24:53,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 84 remaining) [2025-03-04 11:24:53,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 84 remaining) [2025-03-04 11:24:53,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 84 remaining) [2025-03-04 11:24:53,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 84 remaining) [2025-03-04 11:24:53,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 84 remaining) [2025-03-04 11:24:53,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 84 remaining) [2025-03-04 11:24:53,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 84 remaining) [2025-03-04 11:24:53,194 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 84 remaining) [2025-03-04 11:24:53,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 84 remaining) [2025-03-04 11:24:53,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 84 remaining) [2025-03-04 11:24:53,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 84 remaining) [2025-03-04 11:24:53,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 84 remaining) [2025-03-04 11:24:53,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 84 remaining) [2025-03-04 11:24:53,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 84 remaining) [2025-03-04 11:24:53,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 84 remaining) [2025-03-04 11:24:53,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 84 remaining) [2025-03-04 11:24:53,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 84 remaining) [2025-03-04 11:24:53,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 84 remaining) [2025-03-04 11:24:53,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 84 remaining) [2025-03-04 11:24:53,195 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 84 remaining) [2025-03-04 11:24:53,196 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 84 remaining) [2025-03-04 11:24:53,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 11:24:53,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:24:53,402 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:24:53,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 11:24:53,564 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 11:24:53,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 11:24:53 BoogieIcfgContainer [2025-03-04 11:24:53,573 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 11:24:53,574 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 11:24:53,574 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 11:24:53,574 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 11:24:53,574 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:23:43" (3/4) ... [2025-03-04 11:24:53,576 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 11:24:53,580 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-04 11:24:53,580 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-04 11:24:53,583 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-04 11:24:53,583 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 11:24:53,584 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 11:24:53,584 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 11:24:53,649 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 11:24:53,650 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 11:24:53,650 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 11:24:53,652 INFO L158 Benchmark]: Toolchain (without parser) took 70732.84ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 105.5MB in the beginning and 327.6MB in the end (delta: -222.1MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2025-03-04 11:24:53,652 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:24:53,652 INFO L158 Benchmark]: CACSL2BoogieTranslator took 139.76ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 94.5MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:24:53,652 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.71ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 91.9MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:24:53,653 INFO L158 Benchmark]: Boogie Preprocessor took 33.45ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 90.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:24:53,653 INFO L158 Benchmark]: IcfgBuilder took 521.71ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 61.8MB in the end (delta: 29.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 11:24:53,653 INFO L158 Benchmark]: TraceAbstraction took 69920.66ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 60.6MB in the beginning and 335.8MB in the end (delta: -275.1MB). Peak memory consumption was 141.7MB. Max. memory is 16.1GB. [2025-03-04 11:24:53,653 INFO L158 Benchmark]: Witness Printer took 76.06ms. Allocated memory is still 385.9MB. Free memory was 335.8MB in the beginning and 327.6MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:24:53,654 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.17ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 139.76ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 94.5MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.71ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 91.9MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.45ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 90.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 521.71ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 61.8MB in the end (delta: 29.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 69920.66ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 60.6MB in the beginning and 335.8MB in the end (delta: -275.1MB). Peak memory consumption was 141.7MB. Max. memory is 16.1GB. * Witness Printer took 76.06ms. Allocated memory is still 385.9MB. Free memory was 335.8MB in the beginning and 327.6MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 191 locations, 84 error locations. Started 1 CEGAR loops. OverallTime: 69.7s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 59.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 2122 SdHoareTripleChecker+Valid, 59.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2098 mSDsluCounter, 5218 SdHoareTripleChecker+Invalid, 58.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3096 mSDsCounter, 227 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4990 IncrementalHoareTripleChecker+Invalid, 5224 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 227 mSolverCounterUnsat, 2122 mSDtfsCounter, 4990 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2432 GetRequests, 2337 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=373occurred in iteration=19, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 149 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 3579 NumberOfCodeBlocks, 3430 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3080 ConstructedInterpolants, 0 QuantifiedInterpolants, 21318 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2036 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 32 InterpolantComputations, 16 PerfectInterpolantSequences, 949/1493 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 84 specifications checked. All of them hold - InvariantResult [Line: 28]: Location Invariant Derived location invariant: (((((((((0 <= k) && (2 <= c)) && (k <= 2)) && (2 == y)) && (x <= 307445734561825860)) && (c <= 9223372036854775805)) && (16 <= x)) || (((((k <= 2) && (c == 1)) && (x == 1)) && (y == 1)) && (1 <= k))) || (((((0 <= k) && (c == 0)) && (k <= 2)) && (y == 0)) && (x == 0))) RESULT: Ultimate proved your program to be correct! [2025-03-04 11:24:53,669 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