./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-multidimensional/rev-2-n-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-multidimensional/rev-2-n-u.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 bf03248da0b4b82491822f692d5527664b721dbcd28594bdb518a5eab7d5a1f3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:24:13,679 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:24:13,731 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:24:13,735 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:24:13,735 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:24:13,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:24:13,758 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:24:13,758 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:24:13,759 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:24:13,760 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:24:13,760 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:24:13,760 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:24:13,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:24:13,761 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:24:13,761 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:24:13,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:24:13,761 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:24:13,761 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:24:13,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:24:13,761 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:24:13,761 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:24:13,762 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:24:13,762 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:24:13,762 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:24:13,762 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:24:13,762 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:24:13,762 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:24:13,762 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:24:13,762 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:24:13,762 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:24:13,762 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:24:13,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:24:13,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:24:13,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:24:13,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:24:13,762 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:24:13,762 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:24:13,763 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:24:13,763 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:24:13,763 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:24:13,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:24:13,763 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:24:13,763 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:24:13,763 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:24:13,763 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:24:13,763 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 -> bf03248da0b4b82491822f692d5527664b721dbcd28594bdb518a5eab7d5a1f3 [2025-03-04 10:24:13,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:24:13,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:24:13,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:24:13,991 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:24:13,991 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:24:13,992 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/rev-2-n-u.c [2025-03-04 10:24:15,175 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c77320a2/03ec34dd0dac4693b1326176969ef14e/FLAG9fde3c654 [2025-03-04 10:24:15,393 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:24:15,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/rev-2-n-u.c [2025-03-04 10:24:15,398 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c77320a2/03ec34dd0dac4693b1326176969ef14e/FLAG9fde3c654 [2025-03-04 10:24:15,744 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c77320a2/03ec34dd0dac4693b1326176969ef14e [2025-03-04 10:24:15,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:24:15,747 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:24:15,748 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:24:15,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:24:15,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:24:15,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:24:15" (1/1) ... [2025-03-04 10:24:15,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68fad818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:24:15, skipping insertion in model container [2025-03-04 10:24:15,754 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:24:15" (1/1) ... [2025-03-04 10:24:15,764 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:24:15,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:24:15,867 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:24:15,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:24:15,889 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:24:15,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:24:15 WrapperNode [2025-03-04 10:24:15,890 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:24:15,891 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:24:15,891 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:24:15,891 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:24:15,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:24:15" (1/1) ... [2025-03-04 10:24:15,899 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:24:15" (1/1) ... [2025-03-04 10:24:15,911 INFO L138 Inliner]: procedures = 14, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 94 [2025-03-04 10:24:15,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:24:15,911 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:24:15,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:24:15,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:24:15,918 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:24:15" (1/1) ... [2025-03-04 10:24:15,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:24:15" (1/1) ... [2025-03-04 10:24:15,919 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:24:15" (1/1) ... [2025-03-04 10:24:15,933 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 2, 3]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-03-04 10:24:15,933 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:24:15" (1/1) ... [2025-03-04 10:24:15,934 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:24:15" (1/1) ... [2025-03-04 10:24:15,937 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:24:15" (1/1) ... [2025-03-04 10:24:15,937 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:24:15" (1/1) ... [2025-03-04 10:24:15,938 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:24:15" (1/1) ... [2025-03-04 10:24:15,939 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:24:15" (1/1) ... [2025-03-04 10:24:15,940 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:24:15,940 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:24:15,940 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:24:15,940 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:24:15,941 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:24:15" (1/1) ... [2025-03-04 10:24:15,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:24:15,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:15,964 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:24:15,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:24:15,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:24:15,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:24:15,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:24:15,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 10:24:15,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 10:24:15,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:24:15,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:24:15,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 10:24:15,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:24:15,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:24:15,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:24:15,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:24:15,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 10:24:15,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 10:24:16,030 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:24:16,031 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:24:16,193 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18: call ULTIMATE.dealloc(main_~#A~0#1.base, main_~#A~0#1.offset);havoc main_~#A~0#1.base, main_~#A~0#1.offset;call ULTIMATE.dealloc(main_~#B~0#1.base, main_~#B~0#1.offset);havoc main_~#B~0#1.base, main_~#B~0#1.offset; [2025-03-04 10:24:16,202 INFO L? ?]: Removed 60 outVars from TransFormulas that were not future-live. [2025-03-04 10:24:16,202 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:24:16,214 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:24:16,214 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:24:16,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:24:16 BoogieIcfgContainer [2025-03-04 10:24:16,215 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:24:16,216 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:24:16,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:24:16,219 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:24:16,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:24:15" (1/3) ... [2025-03-04 10:24:16,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2642c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:24:16, skipping insertion in model container [2025-03-04 10:24:16,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:24:15" (2/3) ... [2025-03-04 10:24:16,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2642c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:24:16, skipping insertion in model container [2025-03-04 10:24:16,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:24:16" (3/3) ... [2025-03-04 10:24:16,221 INFO L128 eAbstractionObserver]: Analyzing ICFG rev-2-n-u.c [2025-03-04 10:24:16,231 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:24:16,232 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rev-2-n-u.c that has 1 procedures, 71 locations, 1 initial locations, 6 loop locations, and 28 error locations. [2025-03-04 10:24:16,270 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:24:16,280 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;@7e4f9e9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:24:16,281 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-03-04 10:24:16,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 70 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-04 10:24:16,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 10:24:16,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:16,288 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:24:16,290 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 10:24:16,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:16,295 INFO L85 PathProgramCache]: Analyzing trace with hash 103033099, now seen corresponding path program 1 times [2025-03-04 10:24:16,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:16,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113968895] [2025-03-04 10:24:16,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:16,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:16,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:24:16,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:24:16,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:16,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:16,463 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-04 10:24:16,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:16,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113968895] [2025-03-04 10:24:16,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113968895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:16,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:24:16,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:24:16,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289308163] [2025-03-04 10:24:16,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:16,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:24:16,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:16,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:24:16,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:24:16,488 INFO L87 Difference]: Start difference. First operand has 71 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 70 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:16,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:16,596 INFO L93 Difference]: Finished difference Result 143 states and 165 transitions. [2025-03-04 10:24:16,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:24:16,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-03-04 10:24:16,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:16,602 INFO L225 Difference]: With dead ends: 143 [2025-03-04 10:24:16,602 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 10:24:16,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:24:16,607 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 32 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:16,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 84 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:24:16,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 10:24:16,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 93. [2025-03-04 10:24:16,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 65 states have (on average 1.8) internal successors, (117), 92 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-04 10:24:16,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 117 transitions. [2025-03-04 10:24:16,633 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 117 transitions. Word has length 5 [2025-03-04 10:24:16,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:16,634 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 117 transitions. [2025-03-04 10:24:16,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:16,634 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 117 transitions. [2025-03-04 10:24:16,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 10:24:16,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:16,635 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:24:16,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:24:16,635 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 10:24:16,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:16,636 INFO L85 PathProgramCache]: Analyzing trace with hash 103033126, now seen corresponding path program 1 times [2025-03-04 10:24:16,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:16,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24360050] [2025-03-04 10:24:16,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:16,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:16,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:24:16,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:24:16,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:16,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:16,704 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-04 10:24:16,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:16,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24360050] [2025-03-04 10:24:16,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24360050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:16,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:24:16,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:24:16,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053613094] [2025-03-04 10:24:16,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:16,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:24:16,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:16,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:24:16,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:16,706 INFO L87 Difference]: Start difference. First operand 93 states and 117 transitions. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:16,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:16,805 INFO L93 Difference]: Finished difference Result 192 states and 232 transitions. [2025-03-04 10:24:16,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:24:16,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2025-03-04 10:24:16,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:16,806 INFO L225 Difference]: With dead ends: 192 [2025-03-04 10:24:16,806 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 10:24:16,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:16,807 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 127 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:16,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 76 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:24:16,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 10:24:16,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 93. [2025-03-04 10:24:16,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 65 states have (on average 1.6923076923076923) internal successors, (110), 92 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:16,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 110 transitions. [2025-03-04 10:24:16,814 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 110 transitions. Word has length 5 [2025-03-04 10:24:16,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:16,814 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 110 transitions. [2025-03-04 10:24:16,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:16,815 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 110 transitions. [2025-03-04 10:24:16,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 10:24:16,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:16,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:24:16,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:24:16,816 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 10:24:16,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:16,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1101278818, now seen corresponding path program 1 times [2025-03-04 10:24:16,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:16,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249335355] [2025-03-04 10:24:16,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:16,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:16,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:24:16,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:24:16,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:16,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:16,869 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-04 10:24:16,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:16,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249335355] [2025-03-04 10:24:16,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249335355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:16,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:24:16,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:24:16,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798626422] [2025-03-04 10:24:16,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:16,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:24:16,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:16,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:24:16,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:24:16,872 INFO L87 Difference]: Start difference. First operand 93 states and 110 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:16,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:16,937 INFO L93 Difference]: Finished difference Result 184 states and 218 transitions. [2025-03-04 10:24:16,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:24:16,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 10:24:16,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:16,938 INFO L225 Difference]: With dead ends: 184 [2025-03-04 10:24:16,939 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 10:24:16,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:24:16,940 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 8 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:16,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 100 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:24:16,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 10:24:16,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2025-03-04 10:24:16,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.6486486486486487) internal successors, (122), 101 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:16,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2025-03-04 10:24:16,952 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 122 transitions. Word has length 6 [2025-03-04 10:24:16,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:16,952 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 122 transitions. [2025-03-04 10:24:16,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:16,953 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 122 transitions. [2025-03-04 10:24:16,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 10:24:16,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:16,953 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:16,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:24:16,953 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 10:24:16,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:16,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1442524485, now seen corresponding path program 1 times [2025-03-04 10:24:16,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:16,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493241163] [2025-03-04 10:24:16,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:16,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:16,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:24:16,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:24:16,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:16,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:17,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:24:17,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:17,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493241163] [2025-03-04 10:24:17,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493241163] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:17,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731531454] [2025-03-04 10:24:17,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:17,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:17,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:17,021 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:24:17,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:24:17,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:24:17,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:24:17,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:17,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:17,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:24:17,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:17,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:24:17,090 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:24:17,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731531454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:17,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:24:17,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 10:24:17,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721968175] [2025-03-04 10:24:17,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:17,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:24:17,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:17,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:24:17,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:24:17,091 INFO L87 Difference]: Start difference. First operand 102 states and 122 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:17,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:17,159 INFO L93 Difference]: Finished difference Result 110 states and 122 transitions. [2025-03-04 10:24:17,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:24:17,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2025-03-04 10:24:17,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:17,160 INFO L225 Difference]: With dead ends: 110 [2025-03-04 10:24:17,160 INFO L226 Difference]: Without dead ends: 107 [2025-03-04 10:24:17,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:24:17,161 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 61 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:17,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 89 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:24:17,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-04 10:24:17,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 99. [2025-03-04 10:24:17,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.5945945945945945) internal successors, (118), 98 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:17,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2025-03-04 10:24:17,166 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 118 transitions. Word has length 8 [2025-03-04 10:24:17,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:17,166 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 118 transitions. [2025-03-04 10:24:17,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:17,166 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 118 transitions. [2025-03-04 10:24:17,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 10:24:17,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:17,166 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:24:17,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:24:17,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:17,367 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 10:24:17,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:17,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1768586035, now seen corresponding path program 1 times [2025-03-04 10:24:17,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:17,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494210920] [2025-03-04 10:24:17,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:17,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:17,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:24:17,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:24:17,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:17,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:17,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:24:17,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:17,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494210920] [2025-03-04 10:24:17,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494210920] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:17,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501026457] [2025-03-04 10:24:17,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:17,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:17,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:17,423 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:24:17,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:24:17,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:24:17,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:24:17,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:17,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:17,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:24:17,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:17,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:24:17,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:24:17,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:24:17,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501026457] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:24:17,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:24:17,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 10:24:17,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120495139] [2025-03-04 10:24:17,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:24:17,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:24:17,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:17,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:24:17,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:24:17,546 INFO L87 Difference]: Start difference. First operand 99 states and 118 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 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-04 10:24:17,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:17,713 INFO L93 Difference]: Finished difference Result 224 states and 280 transitions. [2025-03-04 10:24:17,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:24:17,713 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 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 9 [2025-03-04 10:24:17,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:17,715 INFO L225 Difference]: With dead ends: 224 [2025-03-04 10:24:17,715 INFO L226 Difference]: Without dead ends: 221 [2025-03-04 10:24:17,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:24:17,716 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 210 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:17,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 144 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:24:17,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-04 10:24:17,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 189. [2025-03-04 10:24:17,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 164 states have (on average 1.6341463414634145) internal successors, (268), 188 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:17,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 268 transitions. [2025-03-04 10:24:17,727 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 268 transitions. Word has length 9 [2025-03-04 10:24:17,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:17,727 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 268 transitions. [2025-03-04 10:24:17,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 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-04 10:24:17,727 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 268 transitions. [2025-03-04 10:24:17,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 10:24:17,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:17,727 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:17,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:24:17,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:17,928 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 10:24:17,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:17,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1050198613, now seen corresponding path program 1 times [2025-03-04 10:24:17,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:17,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300291560] [2025-03-04 10:24:17,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:17,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:17,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:24:17,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:24:17,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:17,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:17,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:24:17,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:17,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300291560] [2025-03-04 10:24:17,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300291560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:17,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:24:17,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:24:17,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578298674] [2025-03-04 10:24:17,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:17,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:24:17,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:17,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:24:17,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:24:17,965 INFO L87 Difference]: Start difference. First operand 189 states and 268 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:18,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:18,009 INFO L93 Difference]: Finished difference Result 189 states and 268 transitions. [2025-03-04 10:24:18,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:24:18,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2025-03-04 10:24:18,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:18,011 INFO L225 Difference]: With dead ends: 189 [2025-03-04 10:24:18,011 INFO L226 Difference]: Without dead ends: 185 [2025-03-04 10:24:18,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:24:18,011 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 44 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:18,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 36 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:18,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-04 10:24:18,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-03-04 10:24:18,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 164 states have (on average 1.5121951219512195) internal successors, (248), 184 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:18,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 248 transitions. [2025-03-04 10:24:18,020 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 248 transitions. Word has length 13 [2025-03-04 10:24:18,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:18,020 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 248 transitions. [2025-03-04 10:24:18,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:18,020 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 248 transitions. [2025-03-04 10:24:18,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 10:24:18,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:18,020 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:18,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:24:18,021 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 10:24:18,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:18,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1803581393, now seen corresponding path program 1 times [2025-03-04 10:24:18,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:18,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145259747] [2025-03-04 10:24:18,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:18,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:18,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:24:18,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:24:18,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:18,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:18,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:24:18,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:18,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145259747] [2025-03-04 10:24:18,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145259747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:18,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:24:18,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:24:18,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915315800] [2025-03-04 10:24:18,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:18,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:24:18,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:18,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:24:18,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:18,090 INFO L87 Difference]: Start difference. First operand 185 states and 248 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:18,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:18,160 INFO L93 Difference]: Finished difference Result 330 states and 445 transitions. [2025-03-04 10:24:18,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:24:18,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2025-03-04 10:24:18,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:18,162 INFO L225 Difference]: With dead ends: 330 [2025-03-04 10:24:18,162 INFO L226 Difference]: Without dead ends: 322 [2025-03-04 10:24:18,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:18,163 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 95 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:18,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 68 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:24:18,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-03-04 10:24:18,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 311. [2025-03-04 10:24:18,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 290 states have (on average 1.4517241379310344) internal successors, (421), 310 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:18,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 421 transitions. [2025-03-04 10:24:18,179 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 421 transitions. Word has length 14 [2025-03-04 10:24:18,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:18,179 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 421 transitions. [2025-03-04 10:24:18,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:18,179 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 421 transitions. [2025-03-04 10:24:18,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 10:24:18,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:18,180 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:24:18,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:24:18,180 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 10:24:18,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:18,180 INFO L85 PathProgramCache]: Analyzing trace with hash 400912291, now seen corresponding path program 1 times [2025-03-04 10:24:18,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:18,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76583777] [2025-03-04 10:24:18,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:18,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:18,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:24:18,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:24:18,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:18,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:18,236 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:24:18,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:18,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76583777] [2025-03-04 10:24:18,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76583777] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:18,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429985993] [2025-03-04 10:24:18,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:18,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:18,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:18,238 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:24:18,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:24:18,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:24:18,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:24:18,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:18,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:18,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:24:18,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:18,312 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:24:18,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:24:18,342 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:24:18,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429985993] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:24:18,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:24:18,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 10 [2025-03-04 10:24:18,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013087703] [2025-03-04 10:24:18,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:24:18,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:24:18,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:18,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:24:18,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:24:18,344 INFO L87 Difference]: Start difference. First operand 311 states and 421 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:18,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:18,788 INFO L93 Difference]: Finished difference Result 616 states and 819 transitions. [2025-03-04 10:24:18,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 10:24:18,788 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 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-04 10:24:18,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:18,790 INFO L225 Difference]: With dead ends: 616 [2025-03-04 10:24:18,790 INFO L226 Difference]: Without dead ends: 323 [2025-03-04 10:24:18,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:24:18,791 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 809 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:18,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 27 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:24:18,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-03-04 10:24:18,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 304. [2025-03-04 10:24:18,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 290 states have (on average 1.2689655172413794) internal successors, (368), 303 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:18,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 368 transitions. [2025-03-04 10:24:18,807 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 368 transitions. Word has length 15 [2025-03-04 10:24:18,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:18,807 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 368 transitions. [2025-03-04 10:24:18,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:18,808 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 368 transitions. [2025-03-04 10:24:18,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 10:24:18,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:18,808 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2025-03-04 10:24:18,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:24:19,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:19,010 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 10:24:19,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:19,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1772866435, now seen corresponding path program 2 times [2025-03-04 10:24:19,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:19,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958763200] [2025-03-04 10:24:19,011 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:24:19,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:19,022 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:24:19,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-04 10:24:19,027 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:24:19,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:19,060 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:24:19,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:19,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958763200] [2025-03-04 10:24:19,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958763200] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:19,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449846860] [2025-03-04 10:24:19,061 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:24:19,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:19,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:19,063 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:24:19,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:24:19,093 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:24:19,100 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-04 10:24:19,100 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:24:19,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:19,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:24:19,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:19,118 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:24:19,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:24:19,144 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:24:19,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449846860] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:24:19,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:24:19,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-04 10:24:19,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289152375] [2025-03-04 10:24:19,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:24:19,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:24:19,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:19,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:24:19,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:24:19,146 INFO L87 Difference]: Start difference. First operand 304 states and 368 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-04 10:24:19,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:19,191 INFO L93 Difference]: Finished difference Result 304 states and 368 transitions. [2025-03-04 10:24:19,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:24:19,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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 18 [2025-03-04 10:24:19,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:19,193 INFO L225 Difference]: With dead ends: 304 [2025-03-04 10:24:19,193 INFO L226 Difference]: Without dead ends: 301 [2025-03-04 10:24:19,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:24:19,194 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 118 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:19,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 57 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:19,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-04 10:24:19,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 253. [2025-03-04 10:24:19,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 242 states have (on average 1.2479338842975207) internal successors, (302), 252 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:19,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 302 transitions. [2025-03-04 10:24:19,202 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 302 transitions. Word has length 18 [2025-03-04 10:24:19,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:19,202 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 302 transitions. [2025-03-04 10:24:19,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-04 10:24:19,202 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 302 transitions. [2025-03-04 10:24:19,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 10:24:19,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:19,203 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:19,209 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-04 10:24:19,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:19,403 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 10:24:19,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:19,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1087261725, now seen corresponding path program 1 times [2025-03-04 10:24:19,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:19,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132082492] [2025-03-04 10:24:19,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:19,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:19,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:24:19,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:24:19,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:19,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:19,463 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 10:24:19,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:19,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132082492] [2025-03-04 10:24:19,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132082492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:19,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:24:19,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:24:19,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420455584] [2025-03-04 10:24:19,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:19,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:24:19,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:19,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:24:19,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:19,464 INFO L87 Difference]: Start difference. First operand 253 states and 302 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:19,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:19,510 INFO L93 Difference]: Finished difference Result 261 states and 302 transitions. [2025-03-04 10:24:19,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:24:19,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-04 10:24:19,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:19,511 INFO L225 Difference]: With dead ends: 261 [2025-03-04 10:24:19,511 INFO L226 Difference]: Without dead ends: 257 [2025-03-04 10:24:19,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:24:19,512 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 62 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:19,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 57 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:19,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-04 10:24:19,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 253. [2025-03-04 10:24:19,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 242 states have (on average 1.2148760330578512) internal successors, (294), 252 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:19,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 294 transitions. [2025-03-04 10:24:19,520 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 294 transitions. Word has length 27 [2025-03-04 10:24:19,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:19,520 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 294 transitions. [2025-03-04 10:24:19,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:19,520 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 294 transitions. [2025-03-04 10:24:19,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 10:24:19,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:19,523 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 1, 1, 1, 1] [2025-03-04 10:24:19,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:24:19,523 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 10:24:19,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:19,523 INFO L85 PathProgramCache]: Analyzing trace with hash 462309371, now seen corresponding path program 1 times [2025-03-04 10:24:19,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:19,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267086235] [2025-03-04 10:24:19,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:19,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:19,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 10:24:19,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:24:19,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:19,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:19,596 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-04 10:24:19,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:19,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267086235] [2025-03-04 10:24:19,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267086235] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:19,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928912941] [2025-03-04 10:24:19,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:19,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:19,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:19,599 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:24:19,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:24:19,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 10:24:19,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:24:19,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:19,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:19,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:24:19,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:19,762 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:24:19,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:24:19,839 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:24:19,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928912941] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:24:19,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:24:19,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 8, 8] total 16 [2025-03-04 10:24:19,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759727981] [2025-03-04 10:24:19,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:24:19,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:24:19,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:19,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:24:19,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:24:19,840 INFO L87 Difference]: Start difference. First operand 253 states and 294 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:20,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:20,738 INFO L93 Difference]: Finished difference Result 1140 states and 1387 transitions. [2025-03-04 10:24:20,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-04 10:24:20,738 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 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 34 [2025-03-04 10:24:20,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:20,741 INFO L225 Difference]: With dead ends: 1140 [2025-03-04 10:24:20,741 INFO L226 Difference]: Without dead ends: 903 [2025-03-04 10:24:20,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=643, Invalid=1163, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 10:24:20,742 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 2620 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2620 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:20,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2620 Valid, 48 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:24:20,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2025-03-04 10:24:20,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 859. [2025-03-04 10:24:20,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 848 states have (on average 1.241745283018868) internal successors, (1053), 858 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:20,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1053 transitions. [2025-03-04 10:24:20,762 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1053 transitions. Word has length 34 [2025-03-04 10:24:20,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:20,762 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 1053 transitions. [2025-03-04 10:24:20,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:20,762 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1053 transitions. [2025-03-04 10:24:20,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 10:24:20,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:20,763 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:20,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:24:20,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 10:24:20,964 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 10:24:20,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:20,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1395156257, now seen corresponding path program 1 times [2025-03-04 10:24:20,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:20,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844882865] [2025-03-04 10:24:20,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:20,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:20,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 10:24:20,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 10:24:20,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:20,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:21,185 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 1 proven. 145 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:24:21,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:21,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844882865] [2025-03-04 10:24:21,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844882865] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:21,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115974940] [2025-03-04 10:24:21,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:21,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:21,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:21,188 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:24:21,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:24:21,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 10:24:21,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 10:24:21,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:21,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:21,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:24:21,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:21,464 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 1 proven. 145 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:24:21,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:24:21,692 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 1 proven. 145 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:24:21,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115974940] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:24:21,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:24:21,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 37 [2025-03-04 10:24:21,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310746365] [2025-03-04 10:24:21,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:24:21,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-04 10:24:21,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:21,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-04 10:24:21,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=753, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 10:24:21,695 INFO L87 Difference]: Start difference. First operand 859 states and 1053 transitions. Second operand has 37 states, 37 states have (on average 3.108108108108108) internal successors, (115), 37 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:22,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:22,558 INFO L93 Difference]: Finished difference Result 2740 states and 3391 transitions. [2025-03-04 10:24:22,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 10:24:22,558 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.108108108108108) internal successors, (115), 37 states have internal predecessors, (115), 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 56 [2025-03-04 10:24:22,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:22,565 INFO L225 Difference]: With dead ends: 2740 [2025-03-04 10:24:22,565 INFO L226 Difference]: Without dead ends: 1915 [2025-03-04 10:24:22,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=876, Invalid=1380, Unknown=0, NotChecked=0, Total=2256 [2025-03-04 10:24:22,568 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 2238 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2238 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:22,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2238 Valid, 529 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:24:22,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2025-03-04 10:24:22,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1831. [2025-03-04 10:24:22,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1831 states, 1820 states have (on average 1.2445054945054945) internal successors, (2265), 1830 states have internal predecessors, (2265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:22,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1831 states to 1831 states and 2265 transitions. [2025-03-04 10:24:22,645 INFO L78 Accepts]: Start accepts. Automaton has 1831 states and 2265 transitions. Word has length 56 [2025-03-04 10:24:22,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:22,645 INFO L471 AbstractCegarLoop]: Abstraction has 1831 states and 2265 transitions. [2025-03-04 10:24:22,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.108108108108108) internal successors, (115), 37 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:22,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 2265 transitions. [2025-03-04 10:24:22,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 10:24:22,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:22,647 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:22,655 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-04 10:24:22,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:22,848 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 10:24:22,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:22,848 INFO L85 PathProgramCache]: Analyzing trace with hash -2059462367, now seen corresponding path program 2 times [2025-03-04 10:24:22,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:22,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175047993] [2025-03-04 10:24:22,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:24:22,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:22,882 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 92 statements into 2 equivalence classes. [2025-03-04 10:24:22,895 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 10:24:22,895 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:24:22,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:23,006 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-04 10:24:23,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:23,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175047993] [2025-03-04 10:24:23,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175047993] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:23,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483218784] [2025-03-04 10:24:23,006 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:24:23,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:23,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:23,008 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:24:23,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:24:23,062 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 92 statements into 2 equivalence classes. [2025-03-04 10:24:23,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 10:24:23,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:24:23,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:23,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 10:24:23,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:23,558 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 1 proven. 715 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:24:23,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:24:24,071 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 1 proven. 715 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:24:24,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483218784] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:24:24,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:24:24,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 26, 26] total 52 [2025-03-04 10:24:24,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111808942] [2025-03-04 10:24:24,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:24:24,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-04 10:24:24,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:24,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-04 10:24:24,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1184, Invalid=1468, Unknown=0, NotChecked=0, Total=2652 [2025-03-04 10:24:24,073 INFO L87 Difference]: Start difference. First operand 1831 states and 2265 transitions. Second operand has 52 states, 52 states have (on average 3.1538461538461537) internal successors, (164), 52 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:28,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:28,881 INFO L93 Difference]: Finished difference Result 5716 states and 7099 transitions. [2025-03-04 10:24:28,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2025-03-04 10:24:28,882 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.1538461538461537) internal successors, (164), 52 states have internal predecessors, (164), 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 92 [2025-03-04 10:24:28,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:28,892 INFO L225 Difference]: With dead ends: 5716 [2025-03-04 10:24:28,892 INFO L226 Difference]: Without dead ends: 3955 [2025-03-04 10:24:28,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9180 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=9913, Invalid=18479, Unknown=0, NotChecked=0, Total=28392 [2025-03-04 10:24:28,898 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 5712 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5712 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:28,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5712 Valid, 704 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 10:24:28,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3955 states. [2025-03-04 10:24:28,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3955 to 3775. [2025-03-04 10:24:28,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3775 states, 3764 states have (on average 1.2454835281615302) internal successors, (4688), 3774 states have internal predecessors, (4688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:28,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3775 states to 3775 states and 4688 transitions. [2025-03-04 10:24:28,966 INFO L78 Accepts]: Start accepts. Automaton has 3775 states and 4688 transitions. Word has length 92 [2025-03-04 10:24:28,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:28,966 INFO L471 AbstractCegarLoop]: Abstraction has 3775 states and 4688 transitions. [2025-03-04 10:24:28,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.1538461538461537) internal successors, (164), 52 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:28,967 INFO L276 IsEmpty]: Start isEmpty. Operand 3775 states and 4688 transitions. [2025-03-04 10:24:28,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-03-04 10:24:28,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:28,971 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:28,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:24:29,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:29,172 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 10:24:29,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:29,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1052230174, now seen corresponding path program 3 times [2025-03-04 10:24:29,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:29,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305719236] [2025-03-04 10:24:29,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:24:29,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:29,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 306 statements into 94 equivalence classes. [2025-03-04 10:24:29,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 306 statements. [2025-03-04 10:24:29,217 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:24:29,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:29,255 INFO L134 CoverageAnalysis]: Checked inductivity of 12755 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12748 trivial. 0 not checked. [2025-03-04 10:24:29,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:29,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305719236] [2025-03-04 10:24:29,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305719236] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:29,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645347899] [2025-03-04 10:24:29,255 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:24:29,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:29,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:29,257 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:24:29,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:24:29,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 306 statements into 94 equivalence classes. [2025-03-04 10:24:29,369 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 306 statements. [2025-03-04 10:24:29,369 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:24:29,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:29,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:24:29,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:29,669 INFO L134 CoverageAnalysis]: Checked inductivity of 12755 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12748 trivial. 0 not checked. [2025-03-04 10:24:29,669 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:24:29,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645347899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:24:29,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:24:29,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 10:24:29,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785516566] [2025-03-04 10:24:29,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:24:29,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:24:29,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:29,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:24:29,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:24:29,671 INFO L87 Difference]: Start difference. First operand 3775 states and 4688 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:29,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:29,738 INFO L93 Difference]: Finished difference Result 3779 states and 4688 transitions. [2025-03-04 10:24:29,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:24:29,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 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 306 [2025-03-04 10:24:29,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:29,746 INFO L225 Difference]: With dead ends: 3779 [2025-03-04 10:24:29,746 INFO L226 Difference]: Without dead ends: 3775 [2025-03-04 10:24:29,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:24:29,748 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 50 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:29,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 71 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:29,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3775 states. [2025-03-04 10:24:29,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3775 to 3771. [2025-03-04 10:24:29,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3771 states, 3764 states have (on average 1.1020191285866099) internal successors, (4148), 3770 states have internal predecessors, (4148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:29,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3771 states to 3771 states and 4148 transitions. [2025-03-04 10:24:29,813 INFO L78 Accepts]: Start accepts. Automaton has 3771 states and 4148 transitions. Word has length 306 [2025-03-04 10:24:29,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:29,814 INFO L471 AbstractCegarLoop]: Abstraction has 3771 states and 4148 transitions. [2025-03-04 10:24:29,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:29,814 INFO L276 IsEmpty]: Start isEmpty. Operand 3771 states and 4148 transitions. [2025-03-04 10:24:29,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-03-04 10:24:29,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:29,817 INFO L218 NwaCegarLoop]: trace histogram [138, 138, 138, 3, 3, 3, 2, 1, 1, 1] [2025-03-04 10:24:29,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 10:24:30,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 10:24:30,022 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 10:24:30,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:30,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1838382600, now seen corresponding path program 2 times [2025-03-04 10:24:30,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:30,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486778926] [2025-03-04 10:24:30,028 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:24:30,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:30,081 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 428 statements into 2 equivalence classes. [2025-03-04 10:24:30,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 428 statements. [2025-03-04 10:24:30,083 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:24:30,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:30,103 INFO L134 CoverageAnalysis]: Checked inductivity of 28785 backedges. 0 proven. 12886 refuted. 0 times theorem prover too weak. 15899 trivial. 0 not checked. [2025-03-04 10:24:30,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:30,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486778926] [2025-03-04 10:24:30,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486778926] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:30,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622361062] [2025-03-04 10:24:30,104 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:24:30,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:30,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:30,106 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:24:30,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:24:30,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 428 statements into 2 equivalence classes. [2025-03-04 10:24:30,285 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 428 statements. [2025-03-04 10:24:30,285 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:24:30,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:30,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:24:30,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:30,639 INFO L134 CoverageAnalysis]: Checked inductivity of 28785 backedges. 0 proven. 12886 refuted. 0 times theorem prover too weak. 15899 trivial. 0 not checked. [2025-03-04 10:24:30,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:24:30,963 INFO L134 CoverageAnalysis]: Checked inductivity of 28785 backedges. 0 proven. 12886 refuted. 0 times theorem prover too weak. 15899 trivial. 0 not checked. [2025-03-04 10:24:30,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622361062] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:24:30,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:24:30,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-04 10:24:30,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787291360] [2025-03-04 10:24:30,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:24:30,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:24:30,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:30,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:24:30,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:24:30,965 INFO L87 Difference]: Start difference. First operand 3771 states and 4148 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:31,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:31,054 INFO L93 Difference]: Finished difference Result 3771 states and 4148 transitions. [2025-03-04 10:24:31,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:24:31,055 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 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 428 [2025-03-04 10:24:31,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:31,066 INFO L225 Difference]: With dead ends: 3771 [2025-03-04 10:24:31,066 INFO L226 Difference]: Without dead ends: 3768 [2025-03-04 10:24:31,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 859 GetRequests, 853 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:24:31,068 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 136 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:31,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 22 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:24:31,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3768 states. [2025-03-04 10:24:31,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3768 to 2511. [2025-03-04 10:24:31,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2511 states, 2507 states have (on average 1.0769844435580376) internal successors, (2700), 2510 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:31,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 2700 transitions. [2025-03-04 10:24:31,171 INFO L78 Accepts]: Start accepts. Automaton has 2511 states and 2700 transitions. Word has length 428 [2025-03-04 10:24:31,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:31,171 INFO L471 AbstractCegarLoop]: Abstraction has 2511 states and 2700 transitions. [2025-03-04 10:24:31,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:31,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 2700 transitions. [2025-03-04 10:24:31,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 802 [2025-03-04 10:24:31,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:31,195 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 47, 47, 46, 46, 46, 46, 46, 46, 46, 46, 46, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:31,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 10:24:31,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 10:24:31,399 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 10:24:31,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:31,400 INFO L85 PathProgramCache]: Analyzing trace with hash -135442239, now seen corresponding path program 1 times [2025-03-04 10:24:31,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:31,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606935029] [2025-03-04 10:24:31,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:31,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:31,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 801 statements into 1 equivalence classes. [2025-03-04 10:24:31,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 801 of 801 statements. [2025-03-04 10:24:31,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:31,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:35,586 INFO L134 CoverageAnalysis]: Checked inductivity of 24319 backedges. 6443 proven. 3151 refuted. 0 times theorem prover too weak. 14725 trivial. 0 not checked. [2025-03-04 10:24:35,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:35,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606935029] [2025-03-04 10:24:35,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606935029] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:35,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692885776] [2025-03-04 10:24:35,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:24:35,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:35,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:35,588 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:24:35,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:24:35,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 801 statements into 1 equivalence classes. [2025-03-04 10:24:35,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 801 of 801 statements. [2025-03-04 10:24:35,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:24:35,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:35,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 1882 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-04 10:24:35,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:37,018 INFO L134 CoverageAnalysis]: Checked inductivity of 24319 backedges. 6443 proven. 3151 refuted. 0 times theorem prover too weak. 14725 trivial. 0 not checked. [2025-03-04 10:24:37,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:24:39,227 INFO L134 CoverageAnalysis]: Checked inductivity of 24319 backedges. 6443 proven. 3151 refuted. 0 times theorem prover too weak. 14725 trivial. 0 not checked. [2025-03-04 10:24:39,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692885776] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:24:39,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:24:39,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 145 [2025-03-04 10:24:39,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446180846] [2025-03-04 10:24:39,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:24:39,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 145 states [2025-03-04 10:24:39,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:24:39,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2025-03-04 10:24:39,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9219, Invalid=11661, Unknown=0, NotChecked=0, Total=20880 [2025-03-04 10:24:39,235 INFO L87 Difference]: Start difference. First operand 2511 states and 2700 transitions. Second operand has 145 states, 145 states have (on average 3.0827586206896553) internal successors, (447), 145 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:50,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:24:50,949 INFO L93 Difference]: Finished difference Result 7844 states and 8329 transitions. [2025-03-04 10:24:50,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2025-03-04 10:24:50,950 INFO L78 Accepts]: Start accepts. Automaton has has 145 states, 145 states have (on average 3.0827586206896553) internal successors, (447), 145 states have internal predecessors, (447), 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 801 [2025-03-04 10:24:50,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:24:50,960 INFO L225 Difference]: With dead ends: 7844 [2025-03-04 10:24:50,960 INFO L226 Difference]: Without dead ends: 5475 [2025-03-04 10:24:50,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1697 GetRequests, 1507 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13345 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=13872, Invalid=22800, Unknown=0, NotChecked=0, Total=36672 [2025-03-04 10:24:50,965 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 14042 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 2096 mSolverCounterSat, 1064 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14042 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 3160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1064 IncrementalHoareTripleChecker+Valid, 2096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 10:24:50,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14042 Valid, 1759 Invalid, 3160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1064 Valid, 2096 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 10:24:50,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5475 states. [2025-03-04 10:24:51,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5475 to 5103. [2025-03-04 10:24:51,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5103 states, 5099 states have (on average 1.0755050009805844) internal successors, (5484), 5102 states have internal predecessors, (5484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:51,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5103 states to 5103 states and 5484 transitions. [2025-03-04 10:24:51,056 INFO L78 Accepts]: Start accepts. Automaton has 5103 states and 5484 transitions. Word has length 801 [2025-03-04 10:24:51,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:24:51,056 INFO L471 AbstractCegarLoop]: Abstraction has 5103 states and 5484 transitions. [2025-03-04 10:24:51,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 145 states, 145 states have (on average 3.0827586206896553) internal successors, (447), 145 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:24:51,057 INFO L276 IsEmpty]: Start isEmpty. Operand 5103 states and 5484 transitions. [2025-03-04 10:24:51,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1618 [2025-03-04 10:24:51,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:24:51,090 INFO L218 NwaCegarLoop]: trace histogram [188, 188, 188, 95, 95, 94, 94, 94, 94, 94, 94, 94, 94, 94, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:24:51,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 10:24:51,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:24:51,290 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-04 10:24:51,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:24:51,291 INFO L85 PathProgramCache]: Analyzing trace with hash 938014913, now seen corresponding path program 2 times [2025-03-04 10:24:51,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:24:51,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701040537] [2025-03-04 10:24:51,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:24:51,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:24:51,397 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1617 statements into 2 equivalence classes. [2025-03-04 10:24:51,471 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1617 of 1617 statements. [2025-03-04 10:24:51,471 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:24:51,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:53,543 INFO L134 CoverageAnalysis]: Checked inductivity of 101575 backedges. 0 proven. 284 refuted. 0 times theorem prover too weak. 101291 trivial. 0 not checked. [2025-03-04 10:24:53,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:24:53,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701040537] [2025-03-04 10:24:53,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701040537] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:24:53,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263719609] [2025-03-04 10:24:53,544 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:24:53,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:24:53,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:24:53,547 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:24:53,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:24:53,926 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1617 statements into 2 equivalence classes. [2025-03-04 10:24:54,298 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1617 of 1617 statements. [2025-03-04 10:24:54,298 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:24:54,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:24:54,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 3754 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-03-04 10:24:54,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:24:57,679 INFO L134 CoverageAnalysis]: Checked inductivity of 101575 backedges. 26699 proven. 13207 refuted. 0 times theorem prover too weak. 61669 trivial. 0 not checked. [2025-03-04 10:24:57,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:25:03,757 INFO L134 CoverageAnalysis]: Checked inductivity of 101575 backedges. 26699 proven. 13207 refuted. 0 times theorem prover too weak. 61669 trivial. 0 not checked. [2025-03-04 10:25:03,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263719609] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:25:03,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:25:03,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 98, 98] total 197 [2025-03-04 10:25:03,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553460687] [2025-03-04 10:25:03,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:25:03,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 197 states [2025-03-04 10:25:03,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:25:03,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 197 interpolants. [2025-03-04 10:25:03,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18538, Invalid=20074, Unknown=0, NotChecked=0, Total=38612 [2025-03-04 10:25:03,766 INFO L87 Difference]: Start difference. First operand 5103 states and 5484 transitions. Second operand has 197 states, 197 states have (on average 3.1624365482233503) internal successors, (623), 197 states have internal predecessors, (623), 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)