./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-multidimensional/add-2-n-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-multidimensional/add-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 7202e877c1332442c2c226005d8bd7e5f4094e339ca214931497ee0f3766da6a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:36:42,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:36:42,627 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 01:36:42,634 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:36:42,634 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:36:42,649 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:36:42,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:36:42,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:36:42,650 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:36:42,650 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:36:42,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:36:42,650 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:36:42,650 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:36:42,650 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:36:42,650 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:36:42,650 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:36:42,650 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:36:42,650 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:36:42,650 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:36:42,650 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:36:42,650 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:36:42,650 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:36:42,651 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:36:42,651 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:36:42,651 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:36:42,651 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:36:42,651 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:36:42,651 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:36:42,651 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:36:42,651 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:36:42,651 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:36:42,652 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:36:42,652 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:36:42,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:36:42,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:36:42,652 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:36:42,652 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:36:42,652 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:36:42,652 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:36:42,652 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:36:42,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:36:42,652 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:36:42,653 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:36:42,653 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:36:42,653 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:36:42,653 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 -> 7202e877c1332442c2c226005d8bd7e5f4094e339ca214931497ee0f3766da6a [2025-03-09 01:36:42,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:36:42,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:36:42,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:36:42,858 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:36:42,858 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:36:42,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/add-2-n-u.c [2025-03-09 01:36:44,062 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c711005e8/dc056716d10c4967ae56b81f7eceb8c8/FLAGf301cca28 [2025-03-09 01:36:44,297 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:36:44,298 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/add-2-n-u.c [2025-03-09 01:36:44,310 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c711005e8/dc056716d10c4967ae56b81f7eceb8c8/FLAGf301cca28 [2025-03-09 01:36:44,329 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c711005e8/dc056716d10c4967ae56b81f7eceb8c8 [2025-03-09 01:36:44,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:36:44,332 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:36:44,333 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:36:44,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:36:44,338 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:36:44,340 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:36:44" (1/1) ... [2025-03-09 01:36:44,340 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ccf3e2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:44, skipping insertion in model container [2025-03-09 01:36:44,341 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:36:44" (1/1) ... [2025-03-09 01:36:44,354 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:36:44,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:36:44,481 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:36:44,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:36:44,509 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:36:44,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:44 WrapperNode [2025-03-09 01:36:44,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:36:44,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:36:44,511 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:36:44,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:36:44,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:44" (1/1) ... [2025-03-09 01:36:44,520 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:44" (1/1) ... [2025-03-09 01:36:44,532 INFO L138 Inliner]: procedures = 14, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 88 [2025-03-09 01:36:44,532 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:36:44,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:36:44,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:36:44,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:36:44,538 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:44" (1/1) ... [2025-03-09 01:36:44,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:44" (1/1) ... [2025-03-09 01:36:44,541 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:44" (1/1) ... [2025-03-09 01:36:44,549 INFO L175 MemorySlicer]: Split 10 memory accesses to 4 slices as follows [2, 3, 3, 2]. 30 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2025-03-09 01:36:44,550 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:44" (1/1) ... [2025-03-09 01:36:44,550 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:44" (1/1) ... [2025-03-09 01:36:44,554 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:44" (1/1) ... [2025-03-09 01:36:44,554 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:44" (1/1) ... [2025-03-09 01:36:44,556 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:44" (1/1) ... [2025-03-09 01:36:44,557 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:44" (1/1) ... [2025-03-09 01:36:44,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:36:44,561 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:36:44,561 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:36:44,561 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:36:44,562 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:44" (1/1) ... [2025-03-09 01:36:44,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:36:44,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:36:44,585 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:36:44,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:36:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:36:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:36:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:36:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 01:36:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 01:36:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 01:36:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:36:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:36:44,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 01:36:44,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 01:36:44,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:36:44,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:36:44,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:36:44,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:36:44,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 01:36:44,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 01:36:44,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 01:36:44,671 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:36:44,672 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:36:44,854 INFO L1307 $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;call ULTIMATE.dealloc(main_~#C~0#1.base, main_~#C~0#1.offset);havoc main_~#C~0#1.base, main_~#C~0#1.offset; [2025-03-09 01:36:44,869 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-09 01:36:44,873 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:36:44,882 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:36:44,882 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:36:44,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:36:44 BoogieIcfgContainer [2025-03-09 01:36:44,882 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:36:44,885 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:36:44,886 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:36:44,890 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:36:44,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:36:44" (1/3) ... [2025-03-09 01:36:44,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f36a632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:36:44, skipping insertion in model container [2025-03-09 01:36:44,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:36:44" (2/3) ... [2025-03-09 01:36:44,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f36a632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:36:44, skipping insertion in model container [2025-03-09 01:36:44,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:36:44" (3/3) ... [2025-03-09 01:36:44,893 INFO L128 eAbstractionObserver]: Analyzing ICFG add-2-n-u.c [2025-03-09 01:36:44,906 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:36:44,907 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG add-2-n-u.c that has 1 procedures, 39 locations, 1 initial locations, 6 loop locations, and 12 error locations. [2025-03-09 01:36:44,950 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:36:44,959 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;@314d3cc6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:36:44,959 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-09 01:36:44,963 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 38 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:44,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 01:36:44,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:44,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:36:44,968 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:36:44,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:44,973 INFO L85 PathProgramCache]: Analyzing trace with hash 72495339, now seen corresponding path program 1 times [2025-03-09 01:36:44,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:44,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384190784] [2025-03-09 01:36:44,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:44,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:45,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:36:45,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:36:45,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:45,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:45,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:36:45,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:45,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384190784] [2025-03-09 01:36:45,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384190784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:36:45,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:36:45,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:36:45,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487922280] [2025-03-09 01:36:45,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:36:45,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:36:45,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:45,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:36:45,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:36:45,202 INFO L87 Difference]: Start difference. First operand has 39 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 38 states have internal predecessors, (45), 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-09 01:36:45,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:45,274 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2025-03-09 01:36:45,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:36:45,276 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-09 01:36:45,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:45,282 INFO L225 Difference]: With dead ends: 71 [2025-03-09 01:36:45,282 INFO L226 Difference]: Without dead ends: 45 [2025-03-09 01:36:45,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:36:45,285 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 8 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:45,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 52 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:36:45,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-09 01:36:45,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-09 01:36:45,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.606060606060606) internal successors, (53), 44 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:45,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2025-03-09 01:36:45,306 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 5 [2025-03-09 01:36:45,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:45,306 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2025-03-09 01:36:45,306 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-09 01:36:45,306 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2025-03-09 01:36:45,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 01:36:45,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:45,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:36:45,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:36:45,307 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:36:45,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:45,308 INFO L85 PathProgramCache]: Analyzing trace with hash 72495366, now seen corresponding path program 1 times [2025-03-09 01:36:45,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:45,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846441346] [2025-03-09 01:36:45,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:45,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:45,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:36:45,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:36:45,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:45,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:45,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:36:45,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:45,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846441346] [2025-03-09 01:36:45,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846441346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:36:45,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:36:45,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:36:45,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014083930] [2025-03-09 01:36:45,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:36:45,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:36:45,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:45,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:36:45,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:36:45,370 INFO L87 Difference]: Start difference. First operand 45 states and 53 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-09 01:36:45,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:45,441 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2025-03-09 01:36:45,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:36:45,441 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-09 01:36:45,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:45,442 INFO L225 Difference]: With dead ends: 88 [2025-03-09 01:36:45,442 INFO L226 Difference]: Without dead ends: 45 [2025-03-09 01:36:45,442 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-09 01:36:45,442 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 55 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:45,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 44 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:36:45,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-09 01:36:45,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-09 01:36:45,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 44 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:45,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-03-09 01:36:45,452 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 5 [2025-03-09 01:36:45,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:45,452 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-03-09 01:36:45,452 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-09 01:36:45,452 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-03-09 01:36:45,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 01:36:45,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:45,453 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:36:45,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:36:45,453 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:36:45,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:45,453 INFO L85 PathProgramCache]: Analyzing trace with hash -659897669, now seen corresponding path program 1 times [2025-03-09 01:36:45,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:45,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266412945] [2025-03-09 01:36:45,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:45,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:45,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:36:45,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:36:45,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:45,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:36:45,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:45,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266412945] [2025-03-09 01:36:45,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266412945] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:36:45,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012525129] [2025-03-09 01:36:45,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:45,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:45,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:36:45,535 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:36:45,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:36:45,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:36:45,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:36:45,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:45,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:45,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:36:45,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:36:45,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:36:45,623 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:36:45,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012525129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:36:45,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:36:45,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 01:36:45,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642454456] [2025-03-09 01:36:45,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:36:45,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:36:45,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:45,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:36:45,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:36:45,624 INFO L87 Difference]: Start difference. First operand 45 states and 50 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-09 01:36:45,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:45,687 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2025-03-09 01:36:45,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:36:45,687 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-09 01:36:45,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:45,687 INFO L225 Difference]: With dead ends: 45 [2025-03-09 01:36:45,687 INFO L226 Difference]: Without dead ends: 42 [2025-03-09 01:36:45,688 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-09 01:36:45,688 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:45,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 57 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:36:45,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-09 01:36:45,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-09 01:36:45,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:45,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2025-03-09 01:36:45,692 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 8 [2025-03-09 01:36:45,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:45,692 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2025-03-09 01:36:45,692 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-09 01:36:45,692 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2025-03-09 01:36:45,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 01:36:45,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:45,693 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:36:45,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:36:45,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:45,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:36:45,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:45,894 INFO L85 PathProgramCache]: Analyzing trace with hash -659897642, now seen corresponding path program 1 times [2025-03-09 01:36:45,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:45,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969434160] [2025-03-09 01:36:45,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:45,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:45,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:36:45,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:36:45,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:45,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:45,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:36:45,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:45,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969434160] [2025-03-09 01:36:45,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969434160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:36:45,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:36:45,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:36:45,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085554188] [2025-03-09 01:36:45,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:36:45,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:36:45,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:45,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:36:45,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:36:45,942 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-09 01:36:45,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:45,985 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2025-03-09 01:36:45,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:36:45,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-09 01:36:45,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:45,986 INFO L225 Difference]: With dead ends: 82 [2025-03-09 01:36:45,986 INFO L226 Difference]: Without dead ends: 76 [2025-03-09 01:36:45,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:36:45,987 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 18 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:45,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 37 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:36:45,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-09 01:36:46,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2025-03-09 01:36:46,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 64 states have (on average 1.34375) internal successors, (86), 72 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:46,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 86 transitions. [2025-03-09 01:36:46,016 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 86 transitions. Word has length 8 [2025-03-09 01:36:46,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:46,016 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 86 transitions. [2025-03-09 01:36:46,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-09 01:36:46,016 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2025-03-09 01:36:46,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 01:36:46,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:46,017 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-03-09 01:36:46,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:36:46,017 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:36:46,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:46,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1018008749, now seen corresponding path program 1 times [2025-03-09 01:36:46,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:46,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506463186] [2025-03-09 01:36:46,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:46,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:46,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:36:46,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:36:46,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:46,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:46,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:36:46,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:46,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506463186] [2025-03-09 01:36:46,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506463186] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:36:46,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310273549] [2025-03-09 01:36:46,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:46,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:46,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:36:46,071 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:36:46,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:36:46,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:36:46,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:36:46,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:46,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:46,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:36:46,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:36:46,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:36:46,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:36:46,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:36:46,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310273549] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:36:46,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:36:46,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 01:36:46,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077016355] [2025-03-09 01:36:46,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:36:46,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:36:46,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:46,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:36:46,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:36:46,154 INFO L87 Difference]: Start difference. First operand 73 states and 86 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-09 01:36:46,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:46,246 INFO L93 Difference]: Finished difference Result 142 states and 188 transitions. [2025-03-09 01:36:46,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:36:46,247 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-09 01:36:46,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:46,248 INFO L225 Difference]: With dead ends: 142 [2025-03-09 01:36:46,248 INFO L226 Difference]: Without dead ends: 139 [2025-03-09 01:36:46,248 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-09 01:36:46,249 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 36 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:46,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 82 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:36:46,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-09 01:36:46,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-03-09 01:36:46,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 138 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:46,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 170 transitions. [2025-03-09 01:36:46,268 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 170 transitions. Word has length 9 [2025-03-09 01:36:46,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:46,268 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 170 transitions. [2025-03-09 01:36:46,269 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-09 01:36:46,269 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 170 transitions. [2025-03-09 01:36:46,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 01:36:46,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:46,269 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 01:36:46,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:36:46,473 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-09 01:36:46,473 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:36:46,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:46,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1518144387, now seen corresponding path program 1 times [2025-03-09 01:36:46,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:46,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520932084] [2025-03-09 01:36:46,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:46,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:46,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:36:46,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:36:46,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:46,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:46,527 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-09 01:36:46,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:46,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520932084] [2025-03-09 01:36:46,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520932084] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:36:46,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005705989] [2025-03-09 01:36:46,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:46,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:46,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:36:46,530 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:36:46,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:36:46,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 01:36:46,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 01:36:46,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:46,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:46,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:36:46,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:36:46,621 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-09 01:36:46,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:36:46,655 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-09 01:36:46,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005705989] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:36:46,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:36:46,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 10 [2025-03-09 01:36:46,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551696293] [2025-03-09 01:36:46,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:36:46,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:36:46,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:46,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:36:46,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:36:46,657 INFO L87 Difference]: Start difference. First operand 139 states and 170 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-09 01:36:46,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:46,971 INFO L93 Difference]: Finished difference Result 260 states and 316 transitions. [2025-03-09 01:36:46,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:36:46,972 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-09 01:36:46,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:46,972 INFO L225 Difference]: With dead ends: 260 [2025-03-09 01:36:46,972 INFO L226 Difference]: Without dead ends: 139 [2025-03-09 01:36:46,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:36:46,975 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 262 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:46,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 29 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:36:46,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-09 01:36:46,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2025-03-09 01:36:46,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 130 states have (on average 1.146153846153846) internal successors, (149), 135 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:46,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 149 transitions. [2025-03-09 01:36:46,988 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 149 transitions. Word has length 15 [2025-03-09 01:36:46,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:46,988 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 149 transitions. [2025-03-09 01:36:46,988 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-09 01:36:46,989 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 149 transitions. [2025-03-09 01:36:46,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 01:36:46,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:46,989 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2025-03-09 01:36:46,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:36:47,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:47,190 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:36:47,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:47,190 INFO L85 PathProgramCache]: Analyzing trace with hash -13102979, now seen corresponding path program 2 times [2025-03-09 01:36:47,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:47,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134625476] [2025-03-09 01:36:47,190 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:36:47,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:47,201 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:36:47,210 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-09 01:36:47,210 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:36:47,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:47,255 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-09 01:36:47,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:47,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134625476] [2025-03-09 01:36:47,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134625476] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:36:47,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656855155] [2025-03-09 01:36:47,255 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:36:47,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:47,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:36:47,257 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:36:47,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:36:47,300 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-09 01:36:47,308 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-03-09 01:36:47,308 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:36:47,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:47,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:36:47,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:36:47,332 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-09 01:36:47,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:36:47,367 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-09 01:36:47,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656855155] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:36:47,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:36:47,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-09 01:36:47,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807076844] [2025-03-09 01:36:47,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:36:47,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:36:47,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:47,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:36:47,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:36:47,368 INFO L87 Difference]: Start difference. First operand 136 states and 149 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-09 01:36:47,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:47,406 INFO L93 Difference]: Finished difference Result 136 states and 149 transitions. [2025-03-09 01:36:47,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:36:47,406 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-09 01:36:47,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:47,407 INFO L225 Difference]: With dead ends: 136 [2025-03-09 01:36:47,407 INFO L226 Difference]: Without dead ends: 133 [2025-03-09 01:36:47,407 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-09 01:36:47,408 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 66 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:47,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 32 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:36:47,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-09 01:36:47,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 117. [2025-03-09 01:36:47,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 114 states have (on average 1.1140350877192982) internal successors, (127), 116 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:47,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2025-03-09 01:36:47,417 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 18 [2025-03-09 01:36:47,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:47,417 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2025-03-09 01:36:47,417 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-09 01:36:47,417 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2025-03-09 01:36:47,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-09 01:36:47,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:47,418 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 1, 1, 1, 1] [2025-03-09 01:36:47,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 01:36:47,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:47,619 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:36:47,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:47,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1771439099, now seen corresponding path program 1 times [2025-03-09 01:36:47,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:47,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891312455] [2025-03-09 01:36:47,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:47,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:47,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 01:36:47,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:36:47,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:47,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:47,689 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-09 01:36:47,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:47,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891312455] [2025-03-09 01:36:47,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891312455] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:36:47,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741153443] [2025-03-09 01:36:47,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:36:47,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:47,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:36:47,691 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:36:47,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:36:47,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 01:36:47,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:36:47,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:36:47,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:47,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:36:47,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:36:47,849 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-09 01:36:47,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:36:47,914 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-09 01:36:47,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741153443] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:36:47,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:36:47,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 8, 8] total 16 [2025-03-09 01:36:47,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153040489] [2025-03-09 01:36:47,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:36:47,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:36:47,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:47,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:36:47,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:36:47,916 INFO L87 Difference]: Start difference. First operand 117 states and 127 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-09 01:36:48,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:48,517 INFO L93 Difference]: Finished difference Result 472 states and 552 transitions. [2025-03-09 01:36:48,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-09 01:36:48,517 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-09 01:36:48,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:48,519 INFO L225 Difference]: With dead ends: 472 [2025-03-09 01:36:48,519 INFO L226 Difference]: Without dead ends: 371 [2025-03-09 01:36:48,520 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-09 01:36:48,520 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 1100 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1100 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:48,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1100 Valid, 44 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 01:36:48,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-03-09 01:36:48,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2025-03-09 01:36:48,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 368 states have (on average 1.048913043478261) internal successors, (386), 370 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:48,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 386 transitions. [2025-03-09 01:36:48,547 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 386 transitions. Word has length 34 [2025-03-09 01:36:48,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:48,547 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 386 transitions. [2025-03-09 01:36:48,548 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-09 01:36:48,548 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 386 transitions. [2025-03-09 01:36:48,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-09 01:36:48,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:36:48,550 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 3, 3, 3, 2, 1, 1, 1] [2025-03-09 01:36:48,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:36:48,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:48,751 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 01:36:48,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:36:48,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1081873288, now seen corresponding path program 2 times [2025-03-09 01:36:48,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:36:48,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158744734] [2025-03-09 01:36:48,751 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:36:48,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:36:48,778 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 104 statements into 2 equivalence classes. [2025-03-09 01:36:48,780 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 104 statements. [2025-03-09 01:36:48,780 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:36:48,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:48,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1407 backedges. 0 proven. 646 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2025-03-09 01:36:48,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:36:48,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158744734] [2025-03-09 01:36:48,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158744734] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:36:48,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777978241] [2025-03-09 01:36:48,795 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:36:48,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:48,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:36:48,797 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:36:48,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:36:48,884 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 104 statements into 2 equivalence classes. [2025-03-09 01:36:48,891 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 104 statements. [2025-03-09 01:36:48,891 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:36:48,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:36:48,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:36:48,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:36:48,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1407 backedges. 0 proven. 646 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2025-03-09 01:36:48,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:36:49,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1407 backedges. 0 proven. 646 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2025-03-09 01:36:49,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777978241] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:36:49,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:36:49,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-09 01:36:49,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946330844] [2025-03-09 01:36:49,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:36:49,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:36:49,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:36:49,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:36:49,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:36:49,106 INFO L87 Difference]: Start difference. First operand 371 states and 386 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-09 01:36:49,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:36:49,154 INFO L93 Difference]: Finished difference Result 371 states and 386 transitions. [2025-03-09 01:36:49,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:36:49,155 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 104 [2025-03-09 01:36:49,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:36:49,155 INFO L225 Difference]: With dead ends: 371 [2025-03-09 01:36:49,155 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 01:36:49,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 205 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-09 01:36:49,156 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 58 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:36:49,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 16 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:36:49,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 01:36:49,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 01:36:49,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:36:49,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 01:36:49,158 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2025-03-09 01:36:49,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:36:49,158 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 01:36:49,158 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-09 01:36:49,158 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 01:36:49,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 01:36:49,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-03-09 01:36:49,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-03-09 01:36:49,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-03-09 01:36:49,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-03-09 01:36:49,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-03-09 01:36:49,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-03-09 01:36:49,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-03-09 01:36:49,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-03-09 01:36:49,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-03-09 01:36:49,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-03-09 01:36:49,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-03-09 01:36:49,161 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-03-09 01:36:49,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 01:36:49,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:36:49,370 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2025-03-09 01:36:49,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 01:36:50,102 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:36:50,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:36:50 BoogieIcfgContainer [2025-03-09 01:36:50,114 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:36:50,114 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:36:50,114 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:36:50,114 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:36:50,115 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:36:44" (3/4) ... [2025-03-09 01:36:50,116 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 01:36:50,124 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-09 01:36:50,124 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 01:36:50,124 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 01:36:50,124 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 01:36:50,198 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:36:50,199 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:36:50,199 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:36:50,201 INFO L158 Benchmark]: Toolchain (without parser) took 5867.04ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 124.2MB in the beginning and 265.1MB in the end (delta: -140.9MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. [2025-03-09 01:36:50,201 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:36:50,201 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.09ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 112.9MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:36:50,201 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.24ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 111.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:36:50,201 INFO L158 Benchmark]: Boogie Preprocessor took 25.31ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 110.0MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:36:50,202 INFO L158 Benchmark]: IcfgBuilder took 321.34ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 95.3MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:36:50,202 INFO L158 Benchmark]: TraceAbstraction took 5228.55ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 95.3MB in the beginning and 271.4MB in the end (delta: -176.1MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. [2025-03-09 01:36:50,202 INFO L158 Benchmark]: Witness Printer took 84.78ms. Allocated memory is still 335.5MB. Free memory was 271.4MB in the beginning and 265.1MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:36:50,204 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.09ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 112.9MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.24ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 111.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.31ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 110.0MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 321.34ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 95.3MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5228.55ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 95.3MB in the beginning and 271.4MB in the end (delta: -176.1MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. * Witness Printer took 84.78ms. Allocated memory is still 335.5MB. Free memory was 271.4MB in the beginning and 265.1MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 39 locations, 45 edges, 12 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 9, TraceHistogramMax: 30, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1616 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1616 mSDsluCounter, 393 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 222 mSDsCounter, 317 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 710 IncrementalHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 317 mSolverCounterUnsat, 171 mSDtfsCounter, 710 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 424 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=371occurred in iteration=8, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 22 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 394 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 554 ConstructedInterpolants, 0 QuantifiedInterpolants, 1606 SizeOfPredicates, 4 NumberOfNonLiveVariables, 596 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 20 InterpolantComputations, 4 PerfectInterpolantSequences, 2580/4667 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 54]: Location Invariant Derived location invariant: (((((((((m <= 1000) && (1 <= i)) && (1 <= j)) && (i <= 999)) && (j <= 2147483646)) && (n == 1500)) || ((((m <= 1000) && (i == 0)) && (j == 0)) && (n == 1500))) || (((((m <= 1000) && (1 <= i)) && (i <= 999)) && (j == 0)) && (n == 1500))) || (((((m <= 1000) && (i == 0)) && (1 <= j)) && (j <= 2147483646)) && (n == 1500))) - InvariantResult [Line: 52]: Location Invariant Derived location invariant: (((((m <= 1000) && (1 <= i)) && (i <= 2147483646)) && (n == 1500)) || (((m <= 1000) && (i == 0)) && (n == 1500))) - InvariantResult [Line: 38]: Location Invariant Derived location invariant: (((((m <= 1000) && (1 <= i)) && (i <= 2147483646)) && (n == 1500)) || (((m <= 1000) && (i == 0)) && (n == 1500))) - InvariantResult [Line: 26]: Location Invariant Derived location invariant: (((((((((m <= 1000) && (1 <= i)) && (1 <= j)) && (i <= 999)) && (j <= 2147483646)) && (n == 1500)) || ((((m <= 1000) && (i == 0)) && (j == 0)) && (n == 1500))) || (((((m <= 1000) && (1 <= i)) && (i <= 999)) && (j == 0)) && (n == 1500))) || (((((m <= 1000) && (i == 0)) && (1 <= j)) && (j <= 2147483646)) && (n == 1500))) - InvariantResult [Line: 24]: Location Invariant Derived location invariant: (((((m <= 1000) && (1 <= i)) && (i <= 2147483646)) && (n == 1500)) || (((m <= 1000) && (i == 0)) && (n == 1500))) - InvariantResult [Line: 40]: Location Invariant Derived location invariant: (((((((((m <= 1000) && (1 <= i)) && (1 <= j)) && (i <= 999)) && (j <= 2147483646)) && (n == 1500)) || ((((m <= 1000) && (i == 0)) && (j == 0)) && (n == 1500))) || (((((m <= 1000) && (1 <= i)) && (i <= 999)) && (j == 0)) && (n == 1500))) || (((((m <= 1000) && (i == 0)) && (1 <= j)) && (j <= 2147483646)) && (n == 1500))) RESULT: Ultimate proved your program to be correct! [2025-03-09 01:36:50,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE