./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-tiling/pr2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-tiling/pr2.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 5922a5be589e27d89439744489152c928c7510f0140c8b0fb4d1faadee969752 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:38:51,588 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:38:51,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 14:38:51,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:38:51,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:38:51,663 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:38:51,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:38:51,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:38:51,666 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:38:51,666 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:38:51,666 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:38:51,666 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:38:51,666 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:38:51,666 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:38:51,666 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:38:51,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:38:51,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:38:51,666 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:38:51,666 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:38:51,666 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:38:51,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:38:51,666 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:38:51,666 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:38:51,666 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:38:51,667 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:38:51,667 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:38:51,667 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:38:51,667 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:38:51,667 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:38:51,667 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:38:51,667 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:38:51,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:38:51,667 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:38:51,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:38:51,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:38:51,667 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:38:51,667 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:38:51,667 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:38:51,667 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:38:51,667 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:38:51,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:38:51,667 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:38:51,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:38:51,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:38:51,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:38:51,668 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 -> 5922a5be589e27d89439744489152c928c7510f0140c8b0fb4d1faadee969752 [2025-03-17 14:38:51,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:38:51,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:38:51,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:38:51,908 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:38:51,908 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:38:51,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/pr2.c [2025-03-17 14:38:53,060 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea2adf2d7/8d49c646c265469a8e2253e6680dc2a2/FLAG019c7657f [2025-03-17 14:38:53,297 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:38:53,299 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/pr2.c [2025-03-17 14:38:53,307 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea2adf2d7/8d49c646c265469a8e2253e6680dc2a2/FLAG019c7657f [2025-03-17 14:38:53,321 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea2adf2d7/8d49c646c265469a8e2253e6680dc2a2 [2025-03-17 14:38:53,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:38:53,324 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:38:53,326 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:38:53,326 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:38:53,329 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:38:53,330 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:38:53" (1/1) ... [2025-03-17 14:38:53,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70951b39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:53, skipping insertion in model container [2025-03-17 14:38:53,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:38:53" (1/1) ... [2025-03-17 14:38:53,343 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:38:53,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:38:53,468 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:38:53,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:38:53,497 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:38:53,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:53 WrapperNode [2025-03-17 14:38:53,498 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:38:53,499 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:38:53,499 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:38:53,499 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:38:53,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:53" (1/1) ... [2025-03-17 14:38:53,509 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:53" (1/1) ... [2025-03-17 14:38:53,523 INFO L138 Inliner]: procedures = 15, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 95 [2025-03-17 14:38:53,525 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:38:53,526 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:38:53,526 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:38:53,526 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:38:53,532 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:53" (1/1) ... [2025-03-17 14:38:53,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:53" (1/1) ... [2025-03-17 14:38:53,534 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:53" (1/1) ... [2025-03-17 14:38:53,551 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 6, 6]. 43 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0]. The 4 writes are split as follows [0, 0, 4]. [2025-03-17 14:38:53,551 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:53" (1/1) ... [2025-03-17 14:38:53,551 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:53" (1/1) ... [2025-03-17 14:38:53,554 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:53" (1/1) ... [2025-03-17 14:38:53,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:53" (1/1) ... [2025-03-17 14:38:53,560 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:53" (1/1) ... [2025-03-17 14:38:53,561 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:53" (1/1) ... [2025-03-17 14:38:53,562 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:38:53,562 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:38:53,563 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:38:53,563 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:38:53,563 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:53" (1/1) ... [2025-03-17 14:38:53,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:38:53,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:53,589 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:38:53,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:38:53,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:38:53,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:38:53,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:38:53,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 14:38:53,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 14:38:53,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:38:53,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:38:53,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 14:38:53,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:38:53,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:38:53,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:38:53,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:38:53,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 14:38:53,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 14:38:53,668 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:38:53,669 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:38:53,874 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-03-17 14:38:53,874 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:38:53,880 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:38:53,881 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:38:53,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:38:53 BoogieIcfgContainer [2025-03-17 14:38:53,881 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:38:53,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:38:53,883 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:38:53,886 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:38:53,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:38:53" (1/3) ... [2025-03-17 14:38:53,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6975722e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:38:53, skipping insertion in model container [2025-03-17 14:38:53,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:38:53" (2/3) ... [2025-03-17 14:38:53,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6975722e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:38:53, skipping insertion in model container [2025-03-17 14:38:53,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:38:53" (3/3) ... [2025-03-17 14:38:53,888 INFO L128 eAbstractionObserver]: Analyzing ICFG pr2.c [2025-03-17 14:38:53,898 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:38:53,900 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pr2.c that has 1 procedures, 63 locations, 1 initial locations, 2 loop locations, and 22 error locations. [2025-03-17 14:38:53,941 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:38:53,951 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;@1e46841d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:38:53,952 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-17 14:38:53,954 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 40 states have (on average 1.8) internal successors, (72), 62 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:53,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 14:38:53,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:53,959 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:38:53,959 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:38:53,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:53,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1220233257, now seen corresponding path program 1 times [2025-03-17 14:38:53,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:53,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624939922] [2025-03-17 14:38:53,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:53,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:54,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:38:54,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:38:54,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:54,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:54,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:38:54,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:54,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624939922] [2025-03-17 14:38:54,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624939922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:54,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:54,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:38:54,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711657379] [2025-03-17 14:38:54,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:54,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 14:38:54,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:54,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 14:38:54,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 14:38:54,120 INFO L87 Difference]: Start difference. First operand has 63 states, 40 states have (on average 1.8) internal successors, (72), 62 states have internal predecessors, (72), 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:54,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:54,129 INFO L93 Difference]: Finished difference Result 122 states and 137 transitions. [2025-03-17 14:38:54,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 14:38:54,130 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 14:38:54,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:54,134 INFO L225 Difference]: With dead ends: 122 [2025-03-17 14:38:54,134 INFO L226 Difference]: Without dead ends: 59 [2025-03-17 14:38:54,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 14:38:54,138 INFO L435 NwaCegarLoop]: 69 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, 69 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:54,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:54,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-17 14:38:54,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-17 14:38:54,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:54,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2025-03-17 14:38:54,164 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 6 [2025-03-17 14:38:54,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:54,164 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2025-03-17 14:38:54,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:54,165 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2025-03-17 14:38:54,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 14:38:54,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:54,166 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:38:54,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:38:54,166 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:38:54,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:54,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1220232296, now seen corresponding path program 1 times [2025-03-17 14:38:54,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:54,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267475949] [2025-03-17 14:38:54,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:54,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:54,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:38:54,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:38:54,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:54,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:54,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:38:54,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:54,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267475949] [2025-03-17 14:38:54,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267475949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:54,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:54,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:54,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848730990] [2025-03-17 14:38:54,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:54,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:54,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:54,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:54,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:54,360 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:54,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:54,398 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2025-03-17 14:38:54,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:54,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 14:38:54,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:54,399 INFO L225 Difference]: With dead ends: 59 [2025-03-17 14:38:54,399 INFO L226 Difference]: Without dead ends: 58 [2025-03-17 14:38:54,399 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-17 14:38:54,400 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:54,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 55 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:54,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-17 14:38:54,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-17 14:38:54,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 57 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:54,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2025-03-17 14:38:54,405 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 6 [2025-03-17 14:38:54,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:54,405 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2025-03-17 14:38:54,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:54,406 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2025-03-17 14:38:54,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 14:38:54,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:54,406 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:54,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:38:54,406 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:38:54,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:54,407 INFO L85 PathProgramCache]: Analyzing trace with hash 827504517, now seen corresponding path program 1 times [2025-03-17 14:38:54,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:54,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151707286] [2025-03-17 14:38:54,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:54,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:54,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:38:54,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:38:54,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:54,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:54,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:38:54,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:54,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151707286] [2025-03-17 14:38:54,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151707286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:54,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:54,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:54,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358306505] [2025-03-17 14:38:54,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:54,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:38:54,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:54,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:38:54,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:38:54,605 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:54,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:54,626 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2025-03-17 14:38:54,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:38:54,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 14:38:54,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:54,629 INFO L225 Difference]: With dead ends: 58 [2025-03-17 14:38:54,629 INFO L226 Difference]: Without dead ends: 57 [2025-03-17 14:38:54,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-17 14:38:54,630 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 110 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:54,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 54 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:54,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-17 14:38:54,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-17 14:38:54,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:54,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2025-03-17 14:38:54,633 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 7 [2025-03-17 14:38:54,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:54,633 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2025-03-17 14:38:54,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:54,633 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2025-03-17 14:38:54,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 14:38:54,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:54,633 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:54,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:38:54,634 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:38:54,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:54,634 INFO L85 PathProgramCache]: Analyzing trace with hash -925186356, now seen corresponding path program 1 times [2025-03-17 14:38:54,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:54,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608016436] [2025-03-17 14:38:54,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:54,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:54,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:38:54,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:38:54,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:54,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:54,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:38:54,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:54,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608016436] [2025-03-17 14:38:54,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608016436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:54,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:54,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:38:54,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132696553] [2025-03-17 14:38:54,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:54,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:38:54,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:54,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:38:54,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:38:54,692 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:54,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:54,773 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2025-03-17 14:38:54,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:38:54,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-17 14:38:54,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:54,774 INFO L225 Difference]: With dead ends: 95 [2025-03-17 14:38:54,774 INFO L226 Difference]: Without dead ends: 79 [2025-03-17 14:38:54,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:38:54,775 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:54,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 59 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:38:54,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-17 14:38:54,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2025-03-17 14:38:54,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 58 states have (on average 1.4655172413793103) internal successors, (85), 77 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:54,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2025-03-17 14:38:54,779 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 10 [2025-03-17 14:38:54,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:54,780 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2025-03-17 14:38:54,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:54,780 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2025-03-17 14:38:54,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 14:38:54,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:54,780 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:54,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:38:54,780 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:38:54,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:54,783 INFO L85 PathProgramCache]: Analyzing trace with hash -653742027, now seen corresponding path program 1 times [2025-03-17 14:38:54,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:54,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249869313] [2025-03-17 14:38:54,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:54,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:54,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:38:54,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:38:54,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:54,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:54,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:38:54,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:54,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249869313] [2025-03-17 14:38:54,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249869313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:54,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:54,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:54,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11916247] [2025-03-17 14:38:54,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:54,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:54,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:54,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:54,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:54,872 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:54,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:54,938 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2025-03-17 14:38:54,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:54,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-17 14:38:54,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:54,941 INFO L225 Difference]: With dead ends: 87 [2025-03-17 14:38:54,941 INFO L226 Difference]: Without dead ends: 85 [2025-03-17 14:38:54,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-17 14:38:54,942 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:54,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 125 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:38:54,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-17 14:38:54,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-17 14:38:54,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 84 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:54,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2025-03-17 14:38:54,949 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 15 [2025-03-17 14:38:54,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:54,949 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2025-03-17 14:38:54,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:54,949 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2025-03-17 14:38:54,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 14:38:54,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:54,950 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:54,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:38:54,950 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:38:54,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:54,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1666391298, now seen corresponding path program 1 times [2025-03-17 14:38:54,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:54,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186638309] [2025-03-17 14:38:54,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:54,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:54,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:38:54,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:38:54,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:54,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:54,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:38:54,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:54,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186638309] [2025-03-17 14:38:54,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186638309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:54,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:54,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:54,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083854478] [2025-03-17 14:38:54,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:54,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:54,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:54,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:54,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:54,992 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:55,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:55,061 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2025-03-17 14:38:55,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:55,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-17 14:38:55,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:55,062 INFO L225 Difference]: With dead ends: 90 [2025-03-17 14:38:55,062 INFO L226 Difference]: Without dead ends: 88 [2025-03-17 14:38:55,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-17 14:38:55,063 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 11 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:55,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 93 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:38:55,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-17 14:38:55,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-17 14:38:55,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 68 states have (on average 1.411764705882353) internal successors, (96), 87 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:55,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2025-03-17 14:38:55,066 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 20 [2025-03-17 14:38:55,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:55,066 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2025-03-17 14:38:55,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:55,067 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2025-03-17 14:38:55,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 14:38:55,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:55,067 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:55,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:38:55,067 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:38:55,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:55,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1119450028, now seen corresponding path program 1 times [2025-03-17 14:38:55,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:55,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356079962] [2025-03-17 14:38:55,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:55,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:55,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:38:55,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:38:55,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:55,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:55,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:38:55,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:55,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356079962] [2025-03-17 14:38:55,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356079962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:55,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:55,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:38:55,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401981370] [2025-03-17 14:38:55,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:55,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:38:55,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:55,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:38:55,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:38:55,210 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:55,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:55,289 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2025-03-17 14:38:55,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:38:55,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-17 14:38:55,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:55,290 INFO L225 Difference]: With dead ends: 105 [2025-03-17 14:38:55,290 INFO L226 Difference]: Without dead ends: 88 [2025-03-17 14:38:55,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-17 14:38:55,291 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 156 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:55,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 52 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:38:55,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-17 14:38:55,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-17 14:38:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 87 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2025-03-17 14:38:55,300 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 22 [2025-03-17 14:38:55,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:55,303 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2025-03-17 14:38:55,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:55,303 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2025-03-17 14:38:55,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 14:38:55,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:55,303 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:55,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:38:55,304 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:38:55,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:55,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1049335133, now seen corresponding path program 1 times [2025-03-17 14:38:55,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:55,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113919232] [2025-03-17 14:38:55,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:55,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:55,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 14:38:55,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:38:55,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:55,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:55,380 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:38:55,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:55,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113919232] [2025-03-17 14:38:55,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113919232] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:55,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082058979] [2025-03-17 14:38:55,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:55,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:55,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:55,383 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:38:55,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:38:55,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 14:38:55,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 14:38:55,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:55,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:55,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:38:55,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:55,481 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:38:55,481 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:38:55,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082058979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:55,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:38:55,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-17 14:38:55,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38176920] [2025-03-17 14:38:55,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:55,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:38:55,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:55,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:38:55,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:38:55,485 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:55,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:55,573 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2025-03-17 14:38:55,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:38:55,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-17 14:38:55,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:55,574 INFO L225 Difference]: With dead ends: 88 [2025-03-17 14:38:55,574 INFO L226 Difference]: Without dead ends: 79 [2025-03-17 14:38:55,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:38:55,575 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 29 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:55,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 69 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:38:55,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-17 14:38:55,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-17 14:38:55,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 78 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:55,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2025-03-17 14:38:55,582 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 26 [2025-03-17 14:38:55,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:55,582 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2025-03-17 14:38:55,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:55,582 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2025-03-17 14:38:55,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 14:38:55,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:55,583 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:55,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 14:38:55,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:55,784 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:38:55,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:55,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1830349258, now seen corresponding path program 1 times [2025-03-17 14:38:55,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:55,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534625472] [2025-03-17 14:38:55,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:55,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:55,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 14:38:55,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 14:38:55,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:55,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:55,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:38:55,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:55,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534625472] [2025-03-17 14:38:55,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534625472] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:55,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995521624] [2025-03-17 14:38:55,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:55,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:55,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:55,836 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:38:55,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:38:55,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 14:38:55,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 14:38:55,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:55,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:55,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:38:55,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:55,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:38:55,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:38:55,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:38:55,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995521624] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:38:55,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:38:55,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-17 14:38:55,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725957328] [2025-03-17 14:38:55,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:38:55,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:38:55,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:55,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:38:55,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:38:55,951 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand has 10 states, 9 states have (on average 7.444444444444445) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:56,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:56,087 INFO L93 Difference]: Finished difference Result 114 states and 134 transitions. [2025-03-17 14:38:56,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:38:56,087 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.444444444444445) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-17 14:38:56,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:56,088 INFO L225 Difference]: With dead ends: 114 [2025-03-17 14:38:56,088 INFO L226 Difference]: Without dead ends: 105 [2025-03-17 14:38:56,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:38:56,088 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 71 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:56,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 128 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:38:56,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-17 14:38:56,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-17 14:38:56,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.17) internal successors, (117), 104 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:56,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2025-03-17 14:38:56,093 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 27 [2025-03-17 14:38:56,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:56,093 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2025-03-17 14:38:56,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.444444444444445) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:56,093 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2025-03-17 14:38:56,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-17 14:38:56,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:56,094 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 14:38:56,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 14:38:56,294 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,SelfDestructingSolverStorable8 [2025-03-17 14:38:56,294 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:38:56,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:56,295 INFO L85 PathProgramCache]: Analyzing trace with hash -620688125, now seen corresponding path program 1 times [2025-03-17 14:38:56,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:56,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700123182] [2025-03-17 14:38:56,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:56,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:56,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 14:38:56,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 14:38:56,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:56,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:56,380 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:38:56,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:56,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700123182] [2025-03-17 14:38:56,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700123182] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:56,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805225277] [2025-03-17 14:38:56,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:56,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:56,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:56,384 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:38:56,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:38:56,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 14:38:56,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 14:38:56,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:56,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:56,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:38:56,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:56,476 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:38:56,476 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:38:56,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805225277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:56,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:38:56,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-17 14:38:56,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536938561] [2025-03-17 14:38:56,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:56,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:38:56,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:56,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:38:56,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:38:56,478 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:56,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:56,562 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2025-03-17 14:38:56,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:38:56,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-17 14:38:56,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:56,564 INFO L225 Difference]: With dead ends: 105 [2025-03-17 14:38:56,564 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 14:38:56,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:38:56,565 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 26 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:56,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 93 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:38:56,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 14:38:56,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-17 14:38:56,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 100 states have (on average 1.16) internal successors, (116), 103 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:56,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2025-03-17 14:38:56,572 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 38 [2025-03-17 14:38:56,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:56,572 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2025-03-17 14:38:56,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:56,572 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2025-03-17 14:38:56,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 14:38:56,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:56,573 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 14:38:56,581 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-17 14:38:56,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:56,777 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:38:56,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:56,777 INFO L85 PathProgramCache]: Analyzing trace with hash -2061462717, now seen corresponding path program 1 times [2025-03-17 14:38:56,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:56,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54122502] [2025-03-17 14:38:56,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:56,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:56,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 14:38:56,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 14:38:56,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:56,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:56,833 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:38:56,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:56,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54122502] [2025-03-17 14:38:56,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54122502] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:56,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183648802] [2025-03-17 14:38:56,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:56,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:56,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:56,835 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:38:56,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:38:56,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 14:38:56,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 14:38:56,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:56,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:56,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:38:56,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:56,909 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:38:56,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:38:56,950 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:38:56,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183648802] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:38:56,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:38:56,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-17 14:38:56,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986074026] [2025-03-17 14:38:56,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:38:56,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:38:56,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:56,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:38:56,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:38:56,951 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:57,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:57,052 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2025-03-17 14:38:57,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:38:57,052 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-17 14:38:57,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:57,053 INFO L225 Difference]: With dead ends: 126 [2025-03-17 14:38:57,053 INFO L226 Difference]: Without dead ends: 125 [2025-03-17 14:38:57,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:38:57,054 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 66 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:57,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 129 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:38:57,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-17 14:38:57,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2025-03-17 14:38:57,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 121 states have (on average 1.1570247933884297) internal successors, (140), 124 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:57,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 140 transitions. [2025-03-17 14:38:57,058 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 140 transitions. Word has length 39 [2025-03-17 14:38:57,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:57,058 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 140 transitions. [2025-03-17 14:38:57,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:57,058 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 140 transitions. [2025-03-17 14:38:57,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-17 14:38:57,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:57,059 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:57,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 14:38:57,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:57,260 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:38:57,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:57,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1046122690, now seen corresponding path program 1 times [2025-03-17 14:38:57,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:57,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670164875] [2025-03-17 14:38:57,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:38:57,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:57,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 14:38:57,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 14:38:57,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:38:57,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:57,329 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 14:38:57,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:57,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670164875] [2025-03-17 14:38:57,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670164875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:38:57,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:38:57,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:38:57,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276603944] [2025-03-17 14:38:57,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:38:57,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:38:57,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:57,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:38:57,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:38:57,330 INFO L87 Difference]: Start difference. First operand 125 states and 140 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:57,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:57,372 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2025-03-17 14:38:57,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:38:57,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-17 14:38:57,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:57,373 INFO L225 Difference]: With dead ends: 125 [2025-03-17 14:38:57,373 INFO L226 Difference]: Without dead ends: 124 [2025-03-17 14:38:57,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-17 14:38:57,373 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 20 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:57,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 52 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:57,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-17 14:38:57,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-03-17 14:38:57,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 121 states have (on average 1.1487603305785123) internal successors, (139), 123 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:57,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 139 transitions. [2025-03-17 14:38:57,377 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 139 transitions. Word has length 53 [2025-03-17 14:38:57,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:57,377 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 139 transitions. [2025-03-17 14:38:57,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:57,377 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 139 transitions. [2025-03-17 14:38:57,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-17 14:38:57,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:57,381 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:57,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:38:57,381 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:38:57,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:57,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1630732764, now seen corresponding path program 2 times [2025-03-17 14:38:57,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:57,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861194524] [2025-03-17 14:38:57,382 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:38:57,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:57,392 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-03-17 14:38:57,396 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 59 statements. [2025-03-17 14:38:57,396 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:38:57,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:57,494 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-17 14:38:57,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:57,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861194524] [2025-03-17 14:38:57,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861194524] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:57,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394593043] [2025-03-17 14:38:57,494 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:38:57,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:57,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:57,496 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:38:57,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:38:57,529 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-03-17 14:38:57,536 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 59 statements. [2025-03-17 14:38:57,536 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:38:57,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:57,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:38:57,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-17 14:38:57,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:38:57,819 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-17 14:38:57,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394593043] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:38:57,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:38:57,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 2] total 7 [2025-03-17 14:38:57,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369109307] [2025-03-17 14:38:57,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:38:57,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:38:57,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:57,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:38:57,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:38:57,821 INFO L87 Difference]: Start difference. First operand 124 states and 139 transitions. Second operand has 9 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:57,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:57,869 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2025-03-17 14:38:57,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:38:57,870 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-17 14:38:57,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:57,870 INFO L225 Difference]: With dead ends: 124 [2025-03-17 14:38:57,870 INFO L226 Difference]: Without dead ends: 122 [2025-03-17 14:38:57,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:38:57,871 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:57,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 23 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:57,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-17 14:38:57,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 69. [2025-03-17 14:38:57,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 68 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:57,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2025-03-17 14:38:57,875 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 59 [2025-03-17 14:38:57,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:57,876 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2025-03-17 14:38:57,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:57,876 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2025-03-17 14:38:57,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-17 14:38:57,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:38:57,878 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:57,885 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-17 14:38:58,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-17 14:38:58,078 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:38:58,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:38:58,079 INFO L85 PathProgramCache]: Analyzing trace with hash 278268968, now seen corresponding path program 2 times [2025-03-17 14:38:58,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:38:58,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241640737] [2025-03-17 14:38:58,079 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:38:58,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:38:58,086 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 60 statements into 2 equivalence classes. [2025-03-17 14:38:58,089 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 60 statements. [2025-03-17 14:38:58,089 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:38:58,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:58,111 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-17 14:38:58,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:38:58,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241640737] [2025-03-17 14:38:58,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241640737] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:38:58,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521082848] [2025-03-17 14:38:58,111 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:38:58,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:58,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:38:58,113 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:38:58,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:38:58,149 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 60 statements into 2 equivalence classes. [2025-03-17 14:38:58,157 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 60 statements. [2025-03-17 14:38:58,157 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:38:58,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:38:58,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:38:58,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:38:58,213 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-17 14:38:58,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:38:58,270 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-17 14:38:58,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521082848] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:38:58,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:38:58,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-03-17 14:38:58,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134382048] [2025-03-17 14:38:58,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:38:58,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:38:58,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:38:58,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:38:58,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:38:58,271 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:58,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:38:58,320 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2025-03-17 14:38:58,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:38:58,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-17 14:38:58,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:38:58,321 INFO L225 Difference]: With dead ends: 69 [2025-03-17 14:38:58,321 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 14:38:58,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:38:58,321 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 35 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:38:58,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 27 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:38:58,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 14:38:58,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 14:38:58,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:58,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 14:38:58,322 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2025-03-17 14:38:58,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:38:58,322 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 14:38:58,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:38:58,322 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 14:38:58,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 14:38:58,324 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2025-03-17 14:38:58,324 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2025-03-17 14:38:58,324 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2025-03-17 14:38:58,324 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2025-03-17 14:38:58,324 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2025-03-17 14:38:58,324 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2025-03-17 14:38:58,324 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2025-03-17 14:38:58,324 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2025-03-17 14:38:58,325 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2025-03-17 14:38:58,325 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2025-03-17 14:38:58,325 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2025-03-17 14:38:58,325 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2025-03-17 14:38:58,325 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2025-03-17 14:38:58,325 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2025-03-17 14:38:58,325 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2025-03-17 14:38:58,325 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2025-03-17 14:38:58,325 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2025-03-17 14:38:58,325 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2025-03-17 14:38:58,325 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2025-03-17 14:38:58,325 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2025-03-17 14:38:58,325 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2025-03-17 14:38:58,325 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2025-03-17 14:38:58,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 14:38:58,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:38:58,528 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:38:58,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 14:38:58,611 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:38:58,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:38:58 BoogieIcfgContainer [2025-03-17 14:38:58,622 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:38:58,623 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:38:58,623 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:38:58,623 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:38:58,624 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:38:53" (3/4) ... [2025-03-17 14:38:58,625 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 14:38:58,632 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-17 14:38:58,633 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-17 14:38:58,633 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 14:38:58,634 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 14:38:58,695 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:38:58,696 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:38:58,696 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:38:58,696 INFO L158 Benchmark]: Toolchain (without parser) took 5372.42ms. Allocated memory is still 167.8MB. Free memory was 134.5MB in the beginning and 126.0MB in the end (delta: 8.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2025-03-17 14:38:58,696 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:38:58,697 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.57ms. Allocated memory is still 167.8MB. Free memory was 133.5MB in the beginning and 123.0MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:38:58,697 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.23ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 121.1MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:38:58,697 INFO L158 Benchmark]: Boogie Preprocessor took 36.14ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 120.1MB in the end (delta: 924.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:38:58,697 INFO L158 Benchmark]: IcfgBuilder took 318.75ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 104.3MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 14:38:58,698 INFO L158 Benchmark]: TraceAbstraction took 4739.69ms. Allocated memory is still 167.8MB. Free memory was 103.3MB in the beginning and 133.3MB in the end (delta: -29.9MB). Peak memory consumption was 56.9MB. Max. memory is 16.1GB. [2025-03-17 14:38:58,698 INFO L158 Benchmark]: Witness Printer took 72.84ms. Allocated memory is still 167.8MB. Free memory was 133.3MB in the beginning and 126.0MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:38:58,699 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.22ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 172.57ms. Allocated memory is still 167.8MB. Free memory was 133.5MB in the beginning and 123.0MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.23ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 121.1MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.14ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 120.1MB in the end (delta: 924.5kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 318.75ms. Allocated memory is still 167.8MB. Free memory was 120.1MB in the beginning and 104.3MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4739.69ms. Allocated memory is still 167.8MB. Free memory was 103.3MB in the beginning and 133.3MB in the end (delta: -29.9MB). Peak memory consumption was 56.9MB. Max. memory is 16.1GB. * Witness Printer took 72.84ms. Allocated memory is still 167.8MB. Free memory was 133.3MB in the beginning and 126.0MB in the end (delta: 7.3MB). 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: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: 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: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: 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: 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: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: 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 1 procedures, 63 locations, 72 edges, 22 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 14, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 708 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 708 mSDsluCounter, 1028 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 528 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1110 IncrementalHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 500 mSDtfsCounter, 1110 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 479 GetRequests, 418 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=11, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 54 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 637 NumberOfCodeBlocks, 453 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 798 ConstructedInterpolants, 0 QuantifiedInterpolants, 2786 SizeOfPredicates, 4 NumberOfNonLiveVariables, 594 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 24 InterpolantComputations, 10 PerfectInterpolantSequences, 392/547 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 22 specifications checked. All of them hold - InvariantResult [Line: 27]: Location Invariant Derived location invariant: (((((((CELLCOUNT >= 0) ? (CELLCOUNT % 2) : ((CELLCOUNT % 2) + 2)) == 0) && (2 <= CELLCOUNT)) && (i == 1)) && (CELLCOUNT <= 2147483647)) || ((((((CELLCOUNT >= 0) ? (CELLCOUNT % 2) : ((CELLCOUNT % 2) + 2)) == 0) && (2 <= CELLCOUNT)) && (CELLCOUNT <= 2147483647)) && (2 <= i))) - InvariantResult [Line: 48]: Location Invariant Derived location invariant: (((((((CELLCOUNT >= 0) ? (CELLCOUNT % 2) : ((CELLCOUNT % 2) + 2)) == 0) && (1 <= i)) && (2 <= CELLCOUNT)) && (CELLCOUNT <= 2147483647)) || ((((((CELLCOUNT >= 0) ? (CELLCOUNT % 2) : ((CELLCOUNT % 2) + 2)) == 0) && (i == 0)) && (2 <= CELLCOUNT)) && (CELLCOUNT <= 2147483647))) RESULT: Ultimate proved your program to be correct! [2025-03-17 14:38:58,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE