./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-cav19/array_init_nondet_vars.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-cav19/array_init_nondet_vars.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 b36a429fc2ac304c1da00c90b438bd7c9bbfb7e9d7c6704fc9e7805ab1ca424f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:37:06,066 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:37:06,125 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 01:37:06,130 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:37:06,131 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:37:06,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:37:06,148 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:37:06,149 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:37:06,149 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:37:06,149 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:37:06,149 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:37:06,149 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:37:06,149 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:37:06,149 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:37:06,150 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:37:06,150 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:37:06,150 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:37:06,150 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:37:06,150 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:37:06,150 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:37:06,150 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:37:06,150 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:37:06,150 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:37:06,150 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:37:06,151 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:37:06,151 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:37:06,151 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:37:06,151 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:37:06,151 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:37:06,151 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:37:06,151 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:37:06,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:37:06,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:37:06,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:37:06,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:37:06,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:37:06,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:37:06,152 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:37:06,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:37:06,152 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:37:06,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:37:06,152 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:37:06,152 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:37:06,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:37:06,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:37:06,152 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 -> b36a429fc2ac304c1da00c90b438bd7c9bbfb7e9d7c6704fc9e7805ab1ca424f [2025-03-09 01:37:06,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:37:06,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:37:06,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:37:06,414 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:37:06,414 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:37:06,415 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-cav19/array_init_nondet_vars.c [2025-03-09 01:37:07,566 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dd77c536/7ca24d09307249df98cde563d4567536/FLAG1e3b3a4eb [2025-03-09 01:37:07,795 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:37:07,796 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_init_nondet_vars.c [2025-03-09 01:37:07,819 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dd77c536/7ca24d09307249df98cde563d4567536/FLAG1e3b3a4eb [2025-03-09 01:37:08,156 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dd77c536/7ca24d09307249df98cde563d4567536 [2025-03-09 01:37:08,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:37:08,160 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:37:08,161 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:37:08,162 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:37:08,165 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:37:08,166 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:37:08" (1/1) ... [2025-03-09 01:37:08,167 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65abf7d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:37:08, skipping insertion in model container [2025-03-09 01:37:08,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:37:08" (1/1) ... [2025-03-09 01:37:08,179 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:37:08,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:37:08,305 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:37:08,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:37:08,332 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:37:08,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:37:08 WrapperNode [2025-03-09 01:37:08,333 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:37:08,334 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:37:08,334 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:37:08,334 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:37:08,338 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:37:08" (1/1) ... [2025-03-09 01:37:08,344 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:37:08" (1/1) ... [2025-03-09 01:37:08,357 INFO L138 Inliner]: procedures = 15, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2025-03-09 01:37:08,357 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:37:08,357 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:37:08,358 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:37:08,358 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:37:08,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:37:08" (1/1) ... [2025-03-09 01:37:08,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:37:08" (1/1) ... [2025-03-09 01:37:08,370 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:37:08" (1/1) ... [2025-03-09 01:37:08,383 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-09 01:37:08,384 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:37:08" (1/1) ... [2025-03-09 01:37:08,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:37:08" (1/1) ... [2025-03-09 01:37:08,388 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:37:08" (1/1) ... [2025-03-09 01:37:08,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:37:08" (1/1) ... [2025-03-09 01:37:08,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:37:08" (1/1) ... [2025-03-09 01:37:08,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:37:08" (1/1) ... [2025-03-09 01:37:08,393 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:37:08,394 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:37:08,394 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:37:08,394 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:37:08,395 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:37:08" (1/1) ... [2025-03-09 01:37:08,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:37:08,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:08,420 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:37:08,422 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:37:08,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:37:08,439 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 01:37:08,440 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 01:37:08,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:37:08,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:37:08,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 01:37:08,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:37:08,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:37:08,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:37:08,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:37:08,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:37:08,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:37:08,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 01:37:08,491 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:37:08,492 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:37:08,603 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; [2025-03-09 01:37:08,614 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-03-09 01:37:08,615 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:37:08,621 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:37:08,621 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:37:08,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:37:08 BoogieIcfgContainer [2025-03-09 01:37:08,622 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:37:08,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:37:08,623 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:37:08,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:37:08,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:37:08" (1/3) ... [2025-03-09 01:37:08,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ef7c57a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:37:08, skipping insertion in model container [2025-03-09 01:37:08,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:37:08" (2/3) ... [2025-03-09 01:37:08,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ef7c57a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:37:08, skipping insertion in model container [2025-03-09 01:37:08,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:37:08" (3/3) ... [2025-03-09 01:37:08,629 INFO L128 eAbstractionObserver]: Analyzing ICFG array_init_nondet_vars.c [2025-03-09 01:37:08,638 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:37:08,639 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array_init_nondet_vars.c that has 2 procedures, 40 locations, 1 initial locations, 2 loop locations, and 10 error locations. [2025-03-09 01:37:08,680 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:37:08,690 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;@445c6a03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:37:08,690 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-09 01:37:08,693 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.56) internal successors, (39), 35 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:37:08,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-09 01:37:08,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:08,699 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:08,700 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:37:08,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:08,704 INFO L85 PathProgramCache]: Analyzing trace with hash -205395119, now seen corresponding path program 1 times [2025-03-09 01:37:08,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:08,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243261388] [2025-03-09 01:37:08,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:08,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:08,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:37:08,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:37:08,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:08,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:08,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:37:08,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:08,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243261388] [2025-03-09 01:37:08,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243261388] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:08,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772118010] [2025-03-09 01:37:08,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:08,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:08,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:08,817 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:37:08,818 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:37:08,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:37:08,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:37:08,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:08,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:08,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-09 01:37:08,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:08,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:37:08,891 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:37:08,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772118010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:37:08,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:37:08,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-09 01:37:08,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69885526] [2025-03-09 01:37:08,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:37:08,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 01:37:08,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:08,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 01:37:08,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 01:37:08,916 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.56) internal successors, (39), 35 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 01:37:08,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:08,932 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2025-03-09 01:37:08,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 01:37:08,933 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2025-03-09 01:37:08,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:08,939 INFO L225 Difference]: With dead ends: 76 [2025-03-09 01:37:08,939 INFO L226 Difference]: Without dead ends: 35 [2025-03-09 01:37:08,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 01:37:08,946 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:08,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:37:08,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-09 01:37:08,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-09 01:37:08,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 30 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:37:08,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2025-03-09 01:37:08,969 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 17 [2025-03-09 01:37:08,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:08,969 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2025-03-09 01:37:08,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 01:37:08,970 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2025-03-09 01:37:08,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-09 01:37:08,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:08,970 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:08,977 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:37:09,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-09 01:37:09,175 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:37:09,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:09,176 INFO L85 PathProgramCache]: Analyzing trace with hash 388705555, now seen corresponding path program 1 times [2025-03-09 01:37:09,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:09,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651645828] [2025-03-09 01:37:09,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:09,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:09,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:37:09,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:37:09,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:09,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:09,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:37:09,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:09,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651645828] [2025-03-09 01:37:09,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651645828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:37:09,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:37:09,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:37:09,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485607626] [2025-03-09 01:37:09,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:37:09,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:37:09,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:09,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:37:09,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:37:09,259 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 01:37:09,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:09,310 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2025-03-09 01:37:09,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:37:09,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2025-03-09 01:37:09,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:09,313 INFO L225 Difference]: With dead ends: 48 [2025-03-09 01:37:09,313 INFO L226 Difference]: Without dead ends: 46 [2025-03-09 01:37:09,313 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:37:09,314 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:09,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 42 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:37:09,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-09 01:37:09,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2025-03-09 01:37:09,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 33 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 01:37:09,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2025-03-09 01:37:09,319 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 17 [2025-03-09 01:37:09,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:09,319 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2025-03-09 01:37:09,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 01:37:09,319 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2025-03-09 01:37:09,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-09 01:37:09,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:09,320 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:09,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:37:09,320 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:37:09,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:09,322 INFO L85 PathProgramCache]: Analyzing trace with hash 419704627, now seen corresponding path program 1 times [2025-03-09 01:37:09,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:09,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68026025] [2025-03-09 01:37:09,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:09,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:09,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:37:09,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:37:09,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:09,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:09,429 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 01:37:09,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:09,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68026025] [2025-03-09 01:37:09,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68026025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:37:09,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:37:09,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:37:09,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352825728] [2025-03-09 01:37:09,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:37:09,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:37:09,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:09,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:37:09,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:37:09,431 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 01:37:09,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:09,489 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2025-03-09 01:37:09,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:37:09,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2025-03-09 01:37:09,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:09,490 INFO L225 Difference]: With dead ends: 47 [2025-03-09 01:37:09,492 INFO L226 Difference]: Without dead ends: 46 [2025-03-09 01:37:09,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:37:09,493 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 29 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:09,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 46 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:37:09,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-09 01:37:09,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2025-03-09 01:37:09,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 35 states have internal predecessors, (38), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 01:37:09,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2025-03-09 01:37:09,503 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 21 [2025-03-09 01:37:09,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:09,503 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2025-03-09 01:37:09,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 01:37:09,503 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2025-03-09 01:37:09,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 01:37:09,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:09,504 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:09,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:37:09,504 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:37:09,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:09,505 INFO L85 PathProgramCache]: Analyzing trace with hash 125941546, now seen corresponding path program 1 times [2025-03-09 01:37:09,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:09,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250403048] [2025-03-09 01:37:09,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:09,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:09,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:37:09,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:37:09,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:09,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:09,654 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:37:09,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:09,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250403048] [2025-03-09 01:37:09,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250403048] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:09,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537722529] [2025-03-09 01:37:09,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:09,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:09,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:09,658 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:37:09,659 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:37:09,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:37:09,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:37:09,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:09,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:09,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:37:09,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:09,756 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:37:09,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:37:09,828 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:37:09,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537722529] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:37:09,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:37:09,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-09 01:37:09,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718469209] [2025-03-09 01:37:09,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:37:09,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:37:09,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:09,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:37:09,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:37:09,830 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-09 01:37:09,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:09,922 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2025-03-09 01:37:09,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:37:09,923 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 22 [2025-03-09 01:37:09,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:09,923 INFO L225 Difference]: With dead ends: 47 [2025-03-09 01:37:09,923 INFO L226 Difference]: Without dead ends: 46 [2025-03-09 01:37:09,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:37:09,924 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 51 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:09,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 85 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:37:09,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-09 01:37:09,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2025-03-09 01:37:09,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 36 states have internal predecessors, (39), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 01:37:09,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2025-03-09 01:37:09,929 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 22 [2025-03-09 01:37:09,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:09,929 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2025-03-09 01:37:09,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-09 01:37:09,929 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2025-03-09 01:37:09,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-09 01:37:09,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:09,930 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:09,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:37:10,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-09 01:37:10,134 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:37:10,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:10,135 INFO L85 PathProgramCache]: Analyzing trace with hash 80767728, now seen corresponding path program 1 times [2025-03-09 01:37:10,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:10,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91093354] [2025-03-09 01:37:10,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:10,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:10,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:37:10,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:37:10,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:10,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:10,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:37:10,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:10,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91093354] [2025-03-09 01:37:10,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91093354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:37:10,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:37:10,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:37:10,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198095093] [2025-03-09 01:37:10,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:37:10,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:37:10,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:10,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:37:10,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:37:10,177 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 01:37:10,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:10,224 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2025-03-09 01:37:10,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:37:10,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-03-09 01:37:10,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:10,225 INFO L225 Difference]: With dead ends: 50 [2025-03-09 01:37:10,225 INFO L226 Difference]: Without dead ends: 48 [2025-03-09 01:37:10,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:37:10,226 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:10,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 62 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:37:10,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-09 01:37:10,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2025-03-09 01:37:10,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 40 states have internal predecessors, (43), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 01:37:10,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2025-03-09 01:37:10,230 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 21 [2025-03-09 01:37:10,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:10,230 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2025-03-09 01:37:10,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 01:37:10,231 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2025-03-09 01:37:10,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 01:37:10,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:10,231 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:10,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:37:10,231 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:37:10,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:10,234 INFO L85 PathProgramCache]: Analyzing trace with hash -390779375, now seen corresponding path program 1 times [2025-03-09 01:37:10,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:10,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775960419] [2025-03-09 01:37:10,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:10,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:10,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:37:10,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:37:10,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:10,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:10,353 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:37:10,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:10,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775960419] [2025-03-09 01:37:10,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775960419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:37:10,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:37:10,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:37:10,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745754146] [2025-03-09 01:37:10,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:37:10,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:37:10,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:10,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:37:10,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:37:10,355 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 01:37:10,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:10,439 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2025-03-09 01:37:10,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:37:10,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2025-03-09 01:37:10,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:10,440 INFO L225 Difference]: With dead ends: 49 [2025-03-09 01:37:10,442 INFO L226 Difference]: Without dead ends: 48 [2025-03-09 01:37:10,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:37:10,443 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:10,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 85 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:37:10,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-09 01:37:10,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2025-03-09 01:37:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.375) internal successors, (44), 41 states have internal predecessors, (44), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 01:37:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2025-03-09 01:37:10,466 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 23 [2025-03-09 01:37:10,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:10,466 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2025-03-09 01:37:10,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 01:37:10,466 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2025-03-09 01:37:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-09 01:37:10,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:10,467 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:10,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:37:10,467 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:37:10,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:10,467 INFO L85 PathProgramCache]: Analyzing trace with hash 770741256, now seen corresponding path program 1 times [2025-03-09 01:37:10,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:10,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103050139] [2025-03-09 01:37:10,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:10,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:10,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:37:10,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:37:10,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:10,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:10,587 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:37:10,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:10,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103050139] [2025-03-09 01:37:10,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103050139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:37:10,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:37:10,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:37:10,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038578938] [2025-03-09 01:37:10,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:37:10,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:37:10,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:10,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:37:10,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:37:10,591 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 01:37:10,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:10,660 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2025-03-09 01:37:10,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:37:10,660 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2025-03-09 01:37:10,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:10,661 INFO L225 Difference]: With dead ends: 49 [2025-03-09 01:37:10,661 INFO L226 Difference]: Without dead ends: 48 [2025-03-09 01:37:10,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:37:10,661 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:10,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 66 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:37:10,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-09 01:37:10,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-09 01:37:10,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 42 states have internal predecessors, (45), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 01:37:10,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2025-03-09 01:37:10,668 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 24 [2025-03-09 01:37:10,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:10,668 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2025-03-09 01:37:10,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 01:37:10,669 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2025-03-09 01:37:10,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-09 01:37:10,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:10,669 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:10,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:37:10,669 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:37:10,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:10,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1876824849, now seen corresponding path program 1 times [2025-03-09 01:37:10,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:10,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105328894] [2025-03-09 01:37:10,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:10,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:10,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 01:37:10,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:37:10,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:10,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:10,708 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 01:37:10,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:10,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105328894] [2025-03-09 01:37:10,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105328894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:37:10,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:37:10,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:37:10,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526058314] [2025-03-09 01:37:10,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:37:10,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:37:10,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:10,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:37:10,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:37:10,710 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 01:37:10,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:10,748 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2025-03-09 01:37:10,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:37:10,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2025-03-09 01:37:10,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:10,749 INFO L225 Difference]: With dead ends: 52 [2025-03-09 01:37:10,749 INFO L226 Difference]: Without dead ends: 50 [2025-03-09 01:37:10,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:37:10,749 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 5 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:10,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 66 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:37:10,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-09 01:37:10,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-09 01:37:10,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 44 states have internal predecessors, (47), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 01:37:10,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2025-03-09 01:37:10,753 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 25 [2025-03-09 01:37:10,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:10,753 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2025-03-09 01:37:10,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 01:37:10,753 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2025-03-09 01:37:10,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-09 01:37:10,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:10,754 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:10,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:37:10,754 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:37:10,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:10,754 INFO L85 PathProgramCache]: Analyzing trace with hash 969673684, now seen corresponding path program 1 times [2025-03-09 01:37:10,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:10,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878172502] [2025-03-09 01:37:10,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:10,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:10,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:37:10,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:37:10,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:10,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:10,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:37:10,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:10,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878172502] [2025-03-09 01:37:10,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878172502] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:10,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613729240] [2025-03-09 01:37:10,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:10,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:10,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:10,792 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:37:10,794 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:37:10,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:37:10,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:37:10,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:10,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:10,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:37:10,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:10,843 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:37:10,843 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:37:10,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613729240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:37:10,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:37:10,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-09 01:37:10,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101545569] [2025-03-09 01:37:10,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:37:10,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:37:10,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:10,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:37:10,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:37:10,845 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 01:37:10,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:10,885 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2025-03-09 01:37:10,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:37:10,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-03-09 01:37:10,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:10,886 INFO L225 Difference]: With dead ends: 68 [2025-03-09 01:37:10,886 INFO L226 Difference]: Without dead ends: 50 [2025-03-09 01:37:10,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:37:10,886 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:10,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 62 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:37:10,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-09 01:37:10,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-09 01:37:10,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 44 states have internal predecessors, (46), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 01:37:10,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2025-03-09 01:37:10,891 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 24 [2025-03-09 01:37:10,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:10,893 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2025-03-09 01:37:10,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 01:37:10,893 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2025-03-09 01:37:10,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-09 01:37:10,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:10,894 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:10,901 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:37:11,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:11,094 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:37:11,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:11,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1829452876, now seen corresponding path program 1 times [2025-03-09 01:37:11,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:11,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259035135] [2025-03-09 01:37:11,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:11,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:11,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 01:37:11,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:37:11,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:11,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:11,177 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 01:37:11,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:11,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259035135] [2025-03-09 01:37:11,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259035135] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:11,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448613721] [2025-03-09 01:37:11,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:11,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:11,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:11,182 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:37:11,184 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:37:11,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 01:37:11,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:37:11,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:11,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:11,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:37:11,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:11,299 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 01:37:11,299 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:37:11,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448613721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:37:11,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:37:11,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-09 01:37:11,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529236694] [2025-03-09 01:37:11,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:37:11,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:37:11,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:11,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:37:11,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:37:11,301 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 01:37:11,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:11,350 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2025-03-09 01:37:11,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:37:11,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2025-03-09 01:37:11,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:11,351 INFO L225 Difference]: With dead ends: 50 [2025-03-09 01:37:11,351 INFO L226 Difference]: Without dead ends: 48 [2025-03-09 01:37:11,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:37:11,352 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 20 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:11,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 61 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:37:11,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-09 01:37:11,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-09 01:37:11,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 42 states have internal predecessors, (44), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 01:37:11,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2025-03-09 01:37:11,360 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 33 [2025-03-09 01:37:11,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:11,361 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2025-03-09 01:37:11,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 01:37:11,361 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2025-03-09 01:37:11,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-09 01:37:11,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:11,363 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:11,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 01:37:11,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:11,564 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:37:11,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:11,565 INFO L85 PathProgramCache]: Analyzing trace with hash 878464305, now seen corresponding path program 1 times [2025-03-09 01:37:11,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:11,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005862480] [2025-03-09 01:37:11,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:11,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:11,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 01:37:11,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:37:11,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:11,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:11,693 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:37:11,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:11,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005862480] [2025-03-09 01:37:11,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005862480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:11,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676633762] [2025-03-09 01:37:11,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:11,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:11,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:11,696 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:37:11,698 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:37:11,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 01:37:11,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:37:11,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:11,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:11,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:37:11,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:11,783 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:37:11,783 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:37:11,850 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:37:11,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676633762] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:37:11,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:37:11,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2025-03-09 01:37:11,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110830403] [2025-03-09 01:37:11,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:37:11,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:37:11,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:11,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:37:11,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:37:11,851 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-09 01:37:11,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:11,991 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2025-03-09 01:37:11,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:37:11,992 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) Word has length 34 [2025-03-09 01:37:11,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:11,992 INFO L225 Difference]: With dead ends: 55 [2025-03-09 01:37:11,992 INFO L226 Difference]: Without dead ends: 52 [2025-03-09 01:37:11,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:37:11,993 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 32 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:11,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 87 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:37:11,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-09 01:37:11,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-09 01:37:11,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.225) internal successors, (49), 45 states have internal predecessors, (49), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 01:37:11,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2025-03-09 01:37:11,996 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 34 [2025-03-09 01:37:11,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:11,996 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2025-03-09 01:37:11,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-09 01:37:11,996 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2025-03-09 01:37:11,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-09 01:37:11,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:11,997 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:12,002 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:37:12,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-09 01:37:12,201 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:37:12,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:12,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1462589674, now seen corresponding path program 1 times [2025-03-09 01:37:12,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:12,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039359398] [2025-03-09 01:37:12,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:12,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:12,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 01:37:12,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 01:37:12,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:12,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:12,317 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:37:12,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:12,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039359398] [2025-03-09 01:37:12,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039359398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:12,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530984530] [2025-03-09 01:37:12,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:12,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:12,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:12,320 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:37:12,322 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:37:12,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 01:37:12,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 01:37:12,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:12,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:12,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:37:12,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:12,456 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 01:37:12,456 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:37:12,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530984530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:37:12,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:37:12,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 13 [2025-03-09 01:37:12,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278032676] [2025-03-09 01:37:12,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:37:12,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:37:12,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:12,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:37:12,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:37:12,458 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 01:37:12,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:12,522 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2025-03-09 01:37:12,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:37:12,523 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2025-03-09 01:37:12,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:12,523 INFO L225 Difference]: With dead ends: 52 [2025-03-09 01:37:12,523 INFO L226 Difference]: Without dead ends: 51 [2025-03-09 01:37:12,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:37:12,524 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:12,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 76 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:37:12,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-09 01:37:12,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-09 01:37:12,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.175) internal successors, (47), 44 states have internal predecessors, (47), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 01:37:12,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2025-03-09 01:37:12,528 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 35 [2025-03-09 01:37:12,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:12,528 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2025-03-09 01:37:12,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 01:37:12,528 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2025-03-09 01:37:12,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-09 01:37:12,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:12,529 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:12,535 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:37:12,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:12,731 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:37:12,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:12,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1705427941, now seen corresponding path program 1 times [2025-03-09 01:37:12,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:12,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473250238] [2025-03-09 01:37:12,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:12,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:12,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 01:37:12,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 01:37:12,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:12,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:12,779 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-09 01:37:12,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:12,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473250238] [2025-03-09 01:37:12,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473250238] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:12,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864784557] [2025-03-09 01:37:12,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:12,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:12,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:12,782 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:37:12,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:37:12,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 01:37:12,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 01:37:12,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:12,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:12,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:37:12,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:12,849 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-09 01:37:12,849 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:37:12,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864784557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:37:12,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:37:12,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-09 01:37:12,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239803243] [2025-03-09 01:37:12,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:37:12,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:37:12,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:12,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:37:12,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:37:12,851 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:37:12,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:12,887 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2025-03-09 01:37:12,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:37:12,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2025-03-09 01:37:12,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:12,888 INFO L225 Difference]: With dead ends: 51 [2025-03-09 01:37:12,888 INFO L226 Difference]: Without dead ends: 49 [2025-03-09 01:37:12,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:37:12,888 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:12,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 61 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:37:12,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-09 01:37:12,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-09 01:37:12,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.125) internal successors, (45), 42 states have internal predecessors, (45), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 01:37:12,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2025-03-09 01:37:12,894 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 36 [2025-03-09 01:37:12,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:12,895 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2025-03-09 01:37:12,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:37:12,895 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2025-03-09 01:37:12,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-09 01:37:12,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:12,896 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:12,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 01:37:13,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:13,096 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:37:13,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:13,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1328658636, now seen corresponding path program 1 times [2025-03-09 01:37:13,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:13,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675987889] [2025-03-09 01:37:13,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:13,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:13,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 01:37:13,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 01:37:13,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:13,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:13,134 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-09 01:37:13,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:13,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675987889] [2025-03-09 01:37:13,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675987889] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:13,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329458777] [2025-03-09 01:37:13,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:13,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:13,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:13,137 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:37:13,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:37:13,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 01:37:13,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 01:37:13,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:13,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:13,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:37:13,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:13,206 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-09 01:37:13,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:37:13,239 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-09 01:37:13,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329458777] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:37:13,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:37:13,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-09 01:37:13,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104631882] [2025-03-09 01:37:13,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:37:13,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:37:13,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:13,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:37:13,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:37:13,241 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:37:13,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:13,291 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2025-03-09 01:37:13,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:37:13,291 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2025-03-09 01:37:13,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:13,292 INFO L225 Difference]: With dead ends: 61 [2025-03-09 01:37:13,293 INFO L226 Difference]: Without dead ends: 59 [2025-03-09 01:37:13,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:37:13,293 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:13,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 86 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:37:13,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-09 01:37:13,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-09 01:37:13,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.1) internal successors, (55), 52 states have internal predecessors, (55), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 01:37:13,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2025-03-09 01:37:13,300 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 37 [2025-03-09 01:37:13,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:13,302 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2025-03-09 01:37:13,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:37:13,302 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2025-03-09 01:37:13,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 01:37:13,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:13,303 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:13,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 01:37:13,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-09 01:37:13,504 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:37:13,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:13,504 INFO L85 PathProgramCache]: Analyzing trace with hash 991543830, now seen corresponding path program 1 times [2025-03-09 01:37:13,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:13,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55345288] [2025-03-09 01:37:13,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:13,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:13,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 01:37:13,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 01:37:13,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:13,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:13,666 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 01:37:13,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:13,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55345288] [2025-03-09 01:37:13,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55345288] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:13,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192741650] [2025-03-09 01:37:13,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:13,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:13,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:13,669 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:37:13,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 01:37:13,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 01:37:13,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 01:37:13,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:13,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:13,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:37:13,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:13,905 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 01:37:13,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:37:14,063 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 01:37:14,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192741650] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:37:14,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:37:14,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2025-03-09 01:37:14,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476091697] [2025-03-09 01:37:14,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:37:14,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-09 01:37:14,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:14,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-09 01:37:14,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2025-03-09 01:37:14,065 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 26 states, 25 states have (on average 2.84) internal successors, (71), 23 states have internal predecessors, (71), 10 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (13), 13 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-09 01:37:14,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:14,352 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2025-03-09 01:37:14,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-09 01:37:14,352 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.84) internal successors, (71), 23 states have internal predecessors, (71), 10 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (13), 13 states have call predecessors, (13), 10 states have call successors, (13) Word has length 48 [2025-03-09 01:37:14,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:14,354 INFO L225 Difference]: With dead ends: 84 [2025-03-09 01:37:14,354 INFO L226 Difference]: Without dead ends: 83 [2025-03-09 01:37:14,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=261, Invalid=999, Unknown=0, NotChecked=0, Total=1260 [2025-03-09 01:37:14,355 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 60 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:14,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 161 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:37:14,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-09 01:37:14,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-09 01:37:14,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 73 states have internal predecessors, (79), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 01:37:14,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2025-03-09 01:37:14,360 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 48 [2025-03-09 01:37:14,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:14,361 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2025-03-09 01:37:14,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.84) internal successors, (71), 23 states have internal predecessors, (71), 10 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (13), 13 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-09 01:37:14,361 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2025-03-09 01:37:14,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 01:37:14,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:14,362 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:14,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 01:37:14,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-09 01:37:14,565 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:37:14,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:14,565 INFO L85 PathProgramCache]: Analyzing trace with hash -2089424931, now seen corresponding path program 1 times [2025-03-09 01:37:14,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:14,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438143581] [2025-03-09 01:37:14,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:37:14,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:14,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 01:37:14,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 01:37:14,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:37:14,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:14,595 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-09 01:37:14,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:14,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438143581] [2025-03-09 01:37:14,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438143581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:37:14,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:37:14,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:37:14,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830912713] [2025-03-09 01:37:14,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:37:14,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:37:14,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:14,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:37:14,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:37:14,596 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:37:14,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:14,620 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2025-03-09 01:37:14,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:37:14,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-03-09 01:37:14,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:14,621 INFO L225 Difference]: With dead ends: 83 [2025-03-09 01:37:14,621 INFO L226 Difference]: Without dead ends: 82 [2025-03-09 01:37:14,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:37:14,622 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:14,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 49 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:37:14,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-09 01:37:14,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-09 01:37:14,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 72 states have internal predecessors, (78), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 01:37:14,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2025-03-09 01:37:14,626 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 48 [2025-03-09 01:37:14,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:14,626 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2025-03-09 01:37:14,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 01:37:14,627 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2025-03-09 01:37:14,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-09 01:37:14,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:14,627 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:14,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:37:14,627 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:37:14,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:14,628 INFO L85 PathProgramCache]: Analyzing trace with hash 902888532, now seen corresponding path program 2 times [2025-03-09 01:37:14,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:14,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61549504] [2025-03-09 01:37:14,628 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:37:14,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:14,633 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-09 01:37:14,636 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 01:37:14,636 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:37:14,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:14,684 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-09 01:37:14,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:14,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61549504] [2025-03-09 01:37:14,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61549504] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:14,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383081123] [2025-03-09 01:37:14,685 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:37:14,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:14,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:14,687 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:37:14,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 01:37:14,720 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-09 01:37:14,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 01:37:14,734 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:37:14,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:14,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:37:14,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:14,791 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-09 01:37:14,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:37:14,863 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-09 01:37:14,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383081123] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:37:14,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:37:14,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-09 01:37:14,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631532765] [2025-03-09 01:37:14,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:37:14,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:37:14,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:14,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:37:14,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:37:14,865 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-09 01:37:14,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:14,994 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2025-03-09 01:37:14,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:37:14,994 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 51 [2025-03-09 01:37:14,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:14,995 INFO L225 Difference]: With dead ends: 106 [2025-03-09 01:37:14,995 INFO L226 Difference]: Without dead ends: 57 [2025-03-09 01:37:14,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2025-03-09 01:37:14,996 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:14,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 72 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:37:14,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-09 01:37:14,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-09 01:37:14,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 01:37:14,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2025-03-09 01:37:14,999 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 51 [2025-03-09 01:37:14,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:14,999 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2025-03-09 01:37:14,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 4 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-09 01:37:14,999 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2025-03-09 01:37:15,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-09 01:37:15,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:15,000 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:15,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 01:37:15,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 01:37:15,201 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:37:15,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:15,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1683229803, now seen corresponding path program 2 times [2025-03-09 01:37:15,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:15,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645510792] [2025-03-09 01:37:15,201 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:37:15,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:15,207 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 84 statements into 2 equivalence classes. [2025-03-09 01:37:15,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 84 of 84 statements. [2025-03-09 01:37:15,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:37:15,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:15,476 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 21 proven. 125 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-09 01:37:15,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:15,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645510792] [2025-03-09 01:37:15,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645510792] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:15,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274935796] [2025-03-09 01:37:15,477 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:37:15,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:15,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:15,479 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:37:15,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 01:37:15,512 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 84 statements into 2 equivalence classes. [2025-03-09 01:37:15,532 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 84 of 84 statements. [2025-03-09 01:37:15,532 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:37:15,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:15,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 01:37:15,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:15,907 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 21 proven. 125 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-09 01:37:15,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:37:16,196 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 21 proven. 125 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-09 01:37:16,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274935796] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:37:16,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:37:16,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 43 [2025-03-09 01:37:16,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131093108] [2025-03-09 01:37:16,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:37:16,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-09 01:37:16,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:16,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-09 01:37:16,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=1520, Unknown=0, NotChecked=0, Total=1892 [2025-03-09 01:37:16,198 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 44 states, 43 states have (on average 3.116279069767442) internal successors, (134), 41 states have internal predecessors, (134), 19 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (22), 22 states have call predecessors, (22), 19 states have call successors, (22) [2025-03-09 01:37:16,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:16,679 INFO L93 Difference]: Finished difference Result 106 states and 124 transitions. [2025-03-09 01:37:16,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-09 01:37:16,680 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 3.116279069767442) internal successors, (134), 41 states have internal predecessors, (134), 19 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (22), 22 states have call predecessors, (22), 19 states have call successors, (22) Word has length 84 [2025-03-09 01:37:16,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:16,681 INFO L225 Difference]: With dead ends: 106 [2025-03-09 01:37:16,681 INFO L226 Difference]: Without dead ends: 105 [2025-03-09 01:37:16,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1457 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=831, Invalid=3459, Unknown=0, NotChecked=0, Total=4290 [2025-03-09 01:37:16,682 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 46 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:16,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 98 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:37:16,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-09 01:37:16,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-09 01:37:16,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 89 states have (on average 1.0112359550561798) internal successors, (90), 89 states have internal predecessors, (90), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-09 01:37:16,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2025-03-09 01:37:16,690 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 84 [2025-03-09 01:37:16,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:16,691 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2025-03-09 01:37:16,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 3.116279069767442) internal successors, (134), 41 states have internal predecessors, (134), 19 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (22), 22 states have call predecessors, (22), 19 states have call successors, (22) [2025-03-09 01:37:16,691 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2025-03-09 01:37:16,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-09 01:37:16,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:37:16,693 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 12, 12, 12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:16,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 01:37:16,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 01:37:16,894 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:37:16,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:37:16,894 INFO L85 PathProgramCache]: Analyzing trace with hash 157191573, now seen corresponding path program 3 times [2025-03-09 01:37:16,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:37:16,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645114975] [2025-03-09 01:37:16,894 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:37:16,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:37:16,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 156 statements into 14 equivalence classes. [2025-03-09 01:37:16,933 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 77 of 156 statements. [2025-03-09 01:37:16,933 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-09 01:37:16,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:17,077 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 33 proven. 121 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2025-03-09 01:37:17,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:37:17,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645114975] [2025-03-09 01:37:17,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645114975] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:37:17,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724961754] [2025-03-09 01:37:17,077 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:37:17,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:17,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:37:17,080 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:37:17,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 01:37:17,119 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 156 statements into 14 equivalence classes. [2025-03-09 01:37:17,155 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 77 of 156 statements. [2025-03-09 01:37:17,155 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-09 01:37:17,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:37:17,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 01:37:17,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:37:17,500 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 33 proven. 121 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2025-03-09 01:37:17,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:37:17,718 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 33 proven. 121 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2025-03-09 01:37:17,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724961754] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:37:17,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:37:17,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-09 01:37:17,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425387278] [2025-03-09 01:37:17,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:37:17,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:37:17,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:37:17,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:37:17,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:37:17,721 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand has 16 states, 12 states have (on average 4.25) internal successors, (51), 16 states have internal predecessors, (51), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (11), 8 states have call predecessors, (11), 9 states have call successors, (11) [2025-03-09 01:37:17,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:37:17,776 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2025-03-09 01:37:17,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:37:17,777 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 4.25) internal successors, (51), 16 states have internal predecessors, (51), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (11), 8 states have call predecessors, (11), 9 states have call successors, (11) Word has length 156 [2025-03-09 01:37:17,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:37:17,777 INFO L225 Difference]: With dead ends: 105 [2025-03-09 01:37:17,777 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 01:37:17,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:37:17,778 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:37:17,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:37:17,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 01:37:17,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 01:37:17,779 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:37:17,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 01:37:17,779 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 156 [2025-03-09 01:37:17,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:37:17,779 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 01:37:17,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 4.25) internal successors, (51), 16 states have internal predecessors, (51), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (11), 8 states have call predecessors, (11), 9 states have call successors, (11) [2025-03-09 01:37:17,779 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 01:37:17,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 01:37:17,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2025-03-09 01:37:17,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-03-09 01:37:17,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-03-09 01:37:17,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-03-09 01:37:17,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-03-09 01:37:17,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-03-09 01:37:17,781 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-03-09 01:37:17,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-03-09 01:37:17,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-03-09 01:37:17,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2025-03-09 01:37:17,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-09 01:37:17,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:37:17,985 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:37:17,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 01:37:18,153 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:37:18,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:37:18 BoogieIcfgContainer [2025-03-09 01:37:18,164 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:37:18,164 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:37:18,164 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:37:18,165 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:37:18,165 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:37:08" (3/4) ... [2025-03-09 01:37:18,166 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 01:37:18,171 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-09 01:37:18,175 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-09 01:37:18,175 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 01:37:18,175 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 01:37:18,175 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 01:37:18,242 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:37:18,242 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:37:18,242 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:37:18,243 INFO L158 Benchmark]: Toolchain (without parser) took 10082.82ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 105.8MB in the beginning and 80.4MB in the end (delta: 25.4MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. [2025-03-09 01:37:18,243 INFO L158 Benchmark]: CDTParser took 1.57ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:37:18,243 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.96ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 94.9MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:37:18,243 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.32ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 93.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:37:18,243 INFO L158 Benchmark]: Boogie Preprocessor took 35.81ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 93.0MB in the end (delta: 757.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:37:18,244 INFO L158 Benchmark]: IcfgBuilder took 227.85ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 80.2MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 01:37:18,244 INFO L158 Benchmark]: TraceAbstraction took 9540.80ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 79.1MB in the beginning and 86.8MB in the end (delta: -7.7MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2025-03-09 01:37:18,244 INFO L158 Benchmark]: Witness Printer took 77.42ms. Allocated memory is still 176.2MB. Free memory was 85.0MB in the beginning and 80.4MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:37:18,245 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.57ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 171.96ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 94.9MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.32ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 93.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.81ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 93.0MB in the end (delta: 757.0kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 227.85ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 80.2MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9540.80ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 79.1MB in the beginning and 86.8MB in the end (delta: -7.7MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. * Witness Printer took 77.42ms. Allocated memory is still 176.2MB. Free memory was 85.0MB in the beginning and 80.4MB in the end (delta: 4.7MB). 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: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 48 edges, 10 error locations. Started 1 CEGAR loops. OverallTime: 9.3s, OverallIterations: 19, TraceHistogramMax: 14, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 402 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 389 mSDsluCounter, 1362 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 977 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1769 IncrementalHoareTripleChecker+Invalid, 1844 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 385 mSDtfsCounter, 1769 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1153 GetRequests, 935 SyntacticMatches, 2 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1988 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=18, InterpolantAutomatonStates: 163, 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, 19 MinimizatonAttempts, 20 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1333 NumberOfCodeBlocks, 1175 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 1727 ConstructedInterpolants, 0 QuantifiedInterpolants, 6292 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1375 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 38 InterpolantComputations, 12 PerfectInterpolantSequences, 3105/4005 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 10 specifications checked. All of them hold - InvariantResult [Line: 26]: Location Invariant Derived location invariant: (((((n <= 99999) && (j <= 9999)) && (1 <= j)) && (2 <= i)) || ((((n <= 99999) && (j <= 9999)) && (1 <= j)) && (i == 1))) - InvariantResult [Line: 20]: Location Invariant Derived location invariant: (((((n <= 99999) && (j <= 9999)) && (1 <= j)) && (i == 1)) || (((((n <= 99999) && (j <= 9999)) && (1 <= j)) && (((long long) i + j) <= 2147483647)) && (2 <= i))) RESULT: Ultimate proved your program to be correct! [2025-03-09 01:37:18,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE