./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i -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 12544117846b274bd1cb12a6694f8fda1d77f0b1327b2e9a353cfe44563b100a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:55:45,414 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:55:45,469 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 14:55:45,473 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:55:45,473 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:55:45,495 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:55:45,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:55:45,497 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:55:45,497 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:55:45,497 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:55:45,498 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:55:45,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:55:45,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:55:45,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:55:45,499 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:55:45,499 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:55:45,499 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:55:45,499 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:55:45,499 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:55:45,499 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:55:45,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:55:45,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:55:45,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:55:45,500 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:55:45,500 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:55:45,500 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:55:45,500 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:55:45,500 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:55:45,500 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:55:45,500 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:55:45,500 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:55:45,500 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:55:45,500 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:55:45,501 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:55:45,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:55:45,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:55:45,501 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:55:45,501 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:55:45,501 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:55:45,501 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:55:45,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:55:45,501 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:55:45,501 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:55:45,501 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:55:45,502 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:55:45,502 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 -> 12544117846b274bd1cb12a6694f8fda1d77f0b1327b2e9a353cfe44563b100a [2025-03-17 14:55:45,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:55:45,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:55:45,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:55:45,726 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:55:45,726 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:55:45,727 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i [2025-03-17 14:55:46,834 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c0b594a0/d2e1e7e373874126aed784e51d712443/FLAG5dd4870e9 [2025-03-17 14:55:47,103 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:55:47,104 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test18_1.i [2025-03-17 14:55:47,113 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c0b594a0/d2e1e7e373874126aed784e51d712443/FLAG5dd4870e9 [2025-03-17 14:55:47,123 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c0b594a0/d2e1e7e373874126aed784e51d712443 [2025-03-17 14:55:47,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:55:47,126 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:55:47,126 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:55:47,126 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:55:47,129 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:55:47,130 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:55:47" (1/1) ... [2025-03-17 14:55:47,131 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d549d6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:47, skipping insertion in model container [2025-03-17 14:55:47,131 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:55:47" (1/1) ... [2025-03-17 14:55:47,158 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:55:47,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:55:47,432 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:55:47,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:55:47,509 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:55:47,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:47 WrapperNode [2025-03-17 14:55:47,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:55:47,510 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:55:47,510 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:55:47,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:55:47,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:47" (1/1) ... [2025-03-17 14:55:47,531 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:47" (1/1) ... [2025-03-17 14:55:47,541 INFO L138 Inliner]: procedures = 164, calls = 72, calls flagged for inlining = 21, calls inlined = 3, statements flattened = 44 [2025-03-17 14:55:47,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:55:47,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:55:47,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:55:47,544 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:55:47,549 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:47" (1/1) ... [2025-03-17 14:55:47,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:47" (1/1) ... [2025-03-17 14:55:47,552 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:47" (1/1) ... [2025-03-17 14:55:47,563 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-17 14:55:47,563 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:47" (1/1) ... [2025-03-17 14:55:47,563 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:47" (1/1) ... [2025-03-17 14:55:47,568 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:47" (1/1) ... [2025-03-17 14:55:47,568 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:47" (1/1) ... [2025-03-17 14:55:47,569 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:47" (1/1) ... [2025-03-17 14:55:47,569 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:47" (1/1) ... [2025-03-17 14:55:47,570 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:55:47,571 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:55:47,571 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:55:47,571 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:55:47,572 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:47" (1/1) ... [2025-03-17 14:55:47,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:55:47,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:55:47,595 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:55:47,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:55:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-17 14:55:47,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-17 14:55:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:55:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:55:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 14:55:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 14:55:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 14:55:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 14:55:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 14:55:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 14:55:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 14:55:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:55:47,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:55:47,690 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:55:47,691 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:55:47,737 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: havoc #t~malloc12.base, #t~malloc12.offset; [2025-03-17 14:55:47,788 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-17 14:55:47,788 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:55:47,794 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:55:47,795 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:55:47,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:55:47 BoogieIcfgContainer [2025-03-17 14:55:47,795 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:55:47,797 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:55:47,798 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:55:47,801 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:55:47,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:55:47" (1/3) ... [2025-03-17 14:55:47,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c477f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:55:47, skipping insertion in model container [2025-03-17 14:55:47,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:47" (2/3) ... [2025-03-17 14:55:47,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c477f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:55:47, skipping insertion in model container [2025-03-17 14:55:47,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:55:47" (3/3) ... [2025-03-17 14:55:47,803 INFO L128 eAbstractionObserver]: Analyzing ICFG memleaks_test18_1.i [2025-03-17 14:55:47,812 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:55:47,813 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG memleaks_test18_1.i that has 2 procedures, 28 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-03-17 14:55:47,844 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:55:47,851 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;@57d33f3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:55:47,852 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 14:55:47,854 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 14:55:47,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 14:55:47,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:55:47,858 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:55:47,858 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:55:47,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:55:47,861 INFO L85 PathProgramCache]: Analyzing trace with hash 117202841, now seen corresponding path program 1 times [2025-03-17 14:55:47,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:55:47,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492174694] [2025-03-17 14:55:47,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:55:47,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:55:47,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:55:47,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:55:47,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:55:47,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:55:48,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:55:48,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:55:48,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492174694] [2025-03-17 14:55:48,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492174694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:55:48,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:55:48,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:55:48,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772080916] [2025-03-17 14:55:48,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:55:48,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:55:48,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:55:48,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:55:48,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:55:48,046 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:55:48,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:55:48,099 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2025-03-17 14:55:48,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:55:48,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2025-03-17 14:55:48,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:55:48,104 INFO L225 Difference]: With dead ends: 57 [2025-03-17 14:55:48,104 INFO L226 Difference]: Without dead ends: 40 [2025-03-17 14:55:48,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:55:48,107 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 30 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:55:48,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 58 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:55:48,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-17 14:55:48,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2025-03-17 14:55:48,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 26 states have internal predecessors, (31), 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-17 14:55:48,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2025-03-17 14:55:48,132 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 10 [2025-03-17 14:55:48,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:55:48,133 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-03-17 14:55:48,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:55:48,133 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2025-03-17 14:55:48,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 14:55:48,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:55:48,134 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:55:48,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:55:48,134 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:55:48,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:55:48,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1666947898, now seen corresponding path program 1 times [2025-03-17 14:55:48,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:55:48,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595828997] [2025-03-17 14:55:48,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:55:48,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:55:48,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 14:55:48,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 14:55:48,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:55:48,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:55:48,276 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-17 14:55:48,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:55:48,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595828997] [2025-03-17 14:55:48,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595828997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:55:48,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:55:48,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:55:48,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248078220] [2025-03-17 14:55:48,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:55:48,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:55:48,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:55:48,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:55:48,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:55:48,279 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 14:55:48,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:55:48,318 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2025-03-17 14:55:48,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:55:48,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2025-03-17 14:55:48,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:55:48,319 INFO L225 Difference]: With dead ends: 35 [2025-03-17 14:55:48,319 INFO L226 Difference]: Without dead ends: 33 [2025-03-17 14:55:48,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:55:48,319 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:55:48,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 60 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:55:48,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-17 14:55:48,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-17 14:55:48,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.434782608695652) internal successors, (33), 28 states have internal predecessors, (33), 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-17 14:55:48,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2025-03-17 14:55:48,326 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 17 [2025-03-17 14:55:48,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:55:48,326 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2025-03-17 14:55:48,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 14:55:48,326 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2025-03-17 14:55:48,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 14:55:48,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:55:48,327 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:55:48,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:55:48,327 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:55:48,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:55:48,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1634936119, now seen corresponding path program 1 times [2025-03-17 14:55:48,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:55:48,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140547336] [2025-03-17 14:55:48,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:55:48,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:55:48,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:55:48,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:55:48,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:55:48,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:55:48,416 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-17 14:55:48,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:55:48,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140547336] [2025-03-17 14:55:48,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140547336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:55:48,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:55:48,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:55:48,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375653681] [2025-03-17 14:55:48,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:55:48,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:55:48,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:55:48,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:55:48,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:55:48,419 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:55:48,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:55:48,437 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2025-03-17 14:55:48,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:55:48,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-03-17 14:55:48,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:55:48,439 INFO L225 Difference]: With dead ends: 50 [2025-03-17 14:55:48,439 INFO L226 Difference]: Without dead ends: 39 [2025-03-17 14:55:48,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:55:48,440 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:55:48,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:55:48,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-17 14:55:48,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-17 14:55:48,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 14:55:48,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2025-03-17 14:55:48,447 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 20 [2025-03-17 14:55:48,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:55:48,448 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2025-03-17 14:55:48,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:55:48,448 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2025-03-17 14:55:48,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 14:55:48,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:55:48,449 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:55:48,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:55:48,449 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:55:48,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:55:48,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1632965505, now seen corresponding path program 1 times [2025-03-17 14:55:48,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:55:48,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604994839] [2025-03-17 14:55:48,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:55:48,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:55:48,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:55:48,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:55:48,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:55:48,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:55:48,529 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:55:48,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:55:48,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604994839] [2025-03-17 14:55:48,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604994839] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:55:48,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162830977] [2025-03-17 14:55:48,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:55:48,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:55:48,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:55:48,533 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:55:48,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:55:48,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:55:48,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:55:48,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:55:48,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:55:48,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:55:48,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:55:48,658 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:55:48,658 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:55:48,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162830977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:55:48,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:55:48,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-17 14:55:48,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680367434] [2025-03-17 14:55:48,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:55:48,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:55:48,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:55:48,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:55:48,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:55:48,661 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 14:55:48,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:55:48,695 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2025-03-17 14:55:48,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:55:48,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2025-03-17 14:55:48,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:55:48,696 INFO L225 Difference]: With dead ends: 39 [2025-03-17 14:55:48,697 INFO L226 Difference]: Without dead ends: 37 [2025-03-17 14:55:48,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:55:48,697 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:55:48,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 59 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:55:48,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-17 14:55:48,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-17 14:55:48,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 30 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 14:55:48,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2025-03-17 14:55:48,702 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 20 [2025-03-17 14:55:48,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:55:48,702 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2025-03-17 14:55:48,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 14:55:48,702 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2025-03-17 14:55:48,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 14:55:48,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:55:48,703 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:55:48,709 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-17 14:55:48,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:55:48,903 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:55:48,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:55:48,904 INFO L85 PathProgramCache]: Analyzing trace with hash 852576714, now seen corresponding path program 1 times [2025-03-17 14:55:48,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:55:48,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600218418] [2025-03-17 14:55:48,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:55:48,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:55:48,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 14:55:48,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 14:55:48,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:55:48,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:55:48,949 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-17 14:55:48,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:55:48,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600218418] [2025-03-17 14:55:48,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600218418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:55:48,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:55:48,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:55:48,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972623156] [2025-03-17 14:55:48,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:55:48,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:55:48,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:55:48,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:55:48,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:55:48,951 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 14:55:48,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:55:48,971 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2025-03-17 14:55:48,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:55:48,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2025-03-17 14:55:48,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:55:48,972 INFO L225 Difference]: With dead ends: 43 [2025-03-17 14:55:48,972 INFO L226 Difference]: Without dead ends: 35 [2025-03-17 14:55:48,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:55:48,973 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:55:48,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:55:48,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-17 14:55:48,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2025-03-17 14:55:48,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 14:55:48,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2025-03-17 14:55:48,976 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 20 [2025-03-17 14:55:48,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:55:48,976 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2025-03-17 14:55:48,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 14:55:48,977 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2025-03-17 14:55:48,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 14:55:48,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:55:48,977 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-17 14:55:48,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:55:48,977 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:55:48,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:55:48,978 INFO L85 PathProgramCache]: Analyzing trace with hash 917676880, now seen corresponding path program 1 times [2025-03-17 14:55:48,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:55:48,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991669240] [2025-03-17 14:55:48,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:55:48,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:55:48,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:55:48,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:55:48,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:55:48,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:55:49,036 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:55:49,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:55:49,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991669240] [2025-03-17 14:55:49,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991669240] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:55:49,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309233103] [2025-03-17 14:55:49,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:55:49,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:55:49,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:55:49,039 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:55:49,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:55:49,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 14:55:49,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 14:55:49,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:55:49,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:55:49,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:55:49,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:55:49,109 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:55:49,110 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:55:49,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309233103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:55:49,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:55:49,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-17 14:55:49,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781475424] [2025-03-17 14:55:49,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:55:49,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:55:49,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:55:49,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:55:49,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:55:49,111 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-17 14:55:49,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:55:49,121 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2025-03-17 14:55:49,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:55:49,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-17 14:55:49,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:55:49,122 INFO L225 Difference]: With dead ends: 33 [2025-03-17 14:55:49,122 INFO L226 Difference]: Without dead ends: 32 [2025-03-17 14:55:49,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:55:49,123 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:55:49,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 35 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:55:49,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-17 14:55:49,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-17 14:55:49,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.25) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 14:55:49,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-03-17 14:55:49,127 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 21 [2025-03-17 14:55:49,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:55:49,127 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-03-17 14:55:49,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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-17 14:55:49,127 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2025-03-17 14:55:49,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 14:55:49,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:55:49,128 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:55:49,133 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-17 14:55:49,332 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,SelfDestructingSolverStorable5 [2025-03-17 14:55:49,332 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:55:49,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:55:49,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1419185390, now seen corresponding path program 1 times [2025-03-17 14:55:49,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:55:49,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340345522] [2025-03-17 14:55:49,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:55:49,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:55:49,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:55:49,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:55:49,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:55:49,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:55:49,385 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 14:55:49,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:55:49,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340345522] [2025-03-17 14:55:49,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340345522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:55:49,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:55:49,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:55:49,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945810438] [2025-03-17 14:55:49,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:55:49,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:55:49,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:55:49,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:55:49,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:55:49,387 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-17 14:55:49,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:55:49,396 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2025-03-17 14:55:49,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:55:49,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 23 [2025-03-17 14:55:49,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:55:49,397 INFO L225 Difference]: With dead ends: 32 [2025-03-17 14:55:49,397 INFO L226 Difference]: Without dead ends: 31 [2025-03-17 14:55:49,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:55:49,397 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:55:49,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:55:49,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-17 14:55:49,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-17 14:55:49,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 14:55:49,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2025-03-17 14:55:49,404 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 23 [2025-03-17 14:55:49,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:55:49,405 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2025-03-17 14:55:49,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-17 14:55:49,405 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2025-03-17 14:55:49,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 14:55:49,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:55:49,405 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:55:49,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:55:49,406 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:55:49,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:55:49,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1045074107, now seen corresponding path program 1 times [2025-03-17 14:55:49,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:55:49,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197819472] [2025-03-17 14:55:49,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:55:49,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:55:49,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:55:49,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:55:49,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:55:49,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:55:49,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:55:49,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:55:49,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197819472] [2025-03-17 14:55:49,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197819472] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:55:49,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222836644] [2025-03-17 14:55:49,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:55:49,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:55:49,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:55:49,480 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:55:49,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:55:49,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 14:55:49,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 14:55:49,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:55:49,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:55:49,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:55:49,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:55:49,594 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:55:49,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:55:49,646 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:55:49,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222836644] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:55:49,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:55:49,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-17 14:55:49,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701048113] [2025-03-17 14:55:49,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:55:49,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:55:49,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:55:49,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:55:49,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:55:49,648 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-17 14:55:49,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:55:49,711 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2025-03-17 14:55:49,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:55:49,711 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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) Word has length 24 [2025-03-17 14:55:49,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:55:49,712 INFO L225 Difference]: With dead ends: 54 [2025-03-17 14:55:49,712 INFO L226 Difference]: Without dead ends: 48 [2025-03-17 14:55:49,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2025-03-17 14:55:49,713 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 37 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:55:49,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 89 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:55:49,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-17 14:55:49,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2025-03-17 14:55:49,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-17 14:55:49,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2025-03-17 14:55:49,717 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 24 [2025-03-17 14:55:49,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:55:49,717 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2025-03-17 14:55:49,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-17 14:55:49,717 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2025-03-17 14:55:49,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 14:55:49,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:55:49,717 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:55:49,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 14:55:49,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:55:49,919 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:55:49,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:55:49,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1547273517, now seen corresponding path program 1 times [2025-03-17 14:55:49,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:55:49,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070483453] [2025-03-17 14:55:49,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:55:49,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:55:49,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 14:55:49,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 14:55:49,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:55:49,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:55:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 14:55:49,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:55:49,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070483453] [2025-03-17 14:55:49,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070483453] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:55:49,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132453042] [2025-03-17 14:55:49,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:55:49,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:55:49,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:55:49,989 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:55:49,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:55:50,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 14:55:50,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 14:55:50,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:55:50,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:55:50,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:55:50,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:55:50,089 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 14:55:50,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:55:50,141 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 14:55:50,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132453042] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:55:50,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:55:50,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-17 14:55:50,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114014886] [2025-03-17 14:55:50,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:55:50,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:55:50,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:55:50,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:55:50,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:55:50,142 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:55:50,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:55:50,212 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2025-03-17 14:55:50,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:55:50,213 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 28 [2025-03-17 14:55:50,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:55:50,213 INFO L225 Difference]: With dead ends: 62 [2025-03-17 14:55:50,213 INFO L226 Difference]: Without dead ends: 61 [2025-03-17 14:55:50,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:55:50,214 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:55:50,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 97 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:55:50,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-17 14:55:50,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2025-03-17 14:55:50,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 45 states have (on average 1.2) internal successors, (54), 43 states have internal predecessors, (54), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (12), 10 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 14:55:50,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2025-03-17 14:55:50,224 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 28 [2025-03-17 14:55:50,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:55:50,224 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2025-03-17 14:55:50,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:55:50,224 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2025-03-17 14:55:50,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 14:55:50,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:55:50,225 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:55:50,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 14:55:50,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:55:50,425 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:55:50,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:55:50,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1493928263, now seen corresponding path program 1 times [2025-03-17 14:55:50,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:55:50,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769554691] [2025-03-17 14:55:50,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:55:50,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:55:50,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 14:55:50,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 14:55:50,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:55:50,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:55:50,499 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 14:55:50,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:55:50,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769554691] [2025-03-17 14:55:50,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769554691] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:55:50,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664025254] [2025-03-17 14:55:50,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:55:50,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:55:50,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:55:50,502 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:55:50,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:55:50,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 14:55:50,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 14:55:50,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:55:50,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:55:50,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:55:50,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:55:50,590 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 14:55:50,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:55:50,656 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 14:55:50,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664025254] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:55:50,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:55:50,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-17 14:55:50,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004641578] [2025-03-17 14:55:50,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:55:50,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:55:50,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:55:50,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:55:50,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:55:50,658 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. Second operand has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 14 states have internal predecessors, (42), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:55:50,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:55:50,714 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2025-03-17 14:55:50,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:55:50,714 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 14 states have internal predecessors, (42), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 31 [2025-03-17 14:55:50,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:55:50,715 INFO L225 Difference]: With dead ends: 60 [2025-03-17 14:55:50,715 INFO L226 Difference]: Without dead ends: 49 [2025-03-17 14:55:50,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:55:50,715 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:55:50,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 79 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:55:50,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-17 14:55:50,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2025-03-17 14:55:50,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:55:50,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2025-03-17 14:55:50,719 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 31 [2025-03-17 14:55:50,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:55:50,719 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2025-03-17 14:55:50,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 14 states have internal predecessors, (42), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:55:50,719 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2025-03-17 14:55:50,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-17 14:55:50,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:55:50,720 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2025-03-17 14:55:50,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 14:55:50,920 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,SelfDestructingSolverStorable9 [2025-03-17 14:55:50,921 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:55:50,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:55:50,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1725078907, now seen corresponding path program 2 times [2025-03-17 14:55:50,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:55:50,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091651794] [2025-03-17 14:55:50,921 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:55:50,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:55:50,943 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-03-17 14:55:50,958 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 14:55:50,958 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:55:50,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:55:51,042 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-17 14:55:51,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:55:51,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091651794] [2025-03-17 14:55:51,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091651794] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:55:51,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998552716] [2025-03-17 14:55:51,043 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:55:51,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:55:51,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:55:51,045 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:55:51,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:55:51,094 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-03-17 14:55:51,133 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 14:55:51,133 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:55:51,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:55:51,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 14:55:51,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:55:51,223 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 14:55:51,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:55:51,331 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 14:55:51,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998552716] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:55:51,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:55:51,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 11, 11] total 24 [2025-03-17 14:55:51,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382502042] [2025-03-17 14:55:51,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:55:51,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 14:55:51,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:55:51,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 14:55:51,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2025-03-17 14:55:51,333 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 25 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 25 states have internal predecessors, (71), 13 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2025-03-17 14:55:51,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:55:51,450 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2025-03-17 14:55:51,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 14:55:51,450 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 25 states have internal predecessors, (71), 13 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Word has length 58 [2025-03-17 14:55:51,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:55:51,450 INFO L225 Difference]: With dead ends: 46 [2025-03-17 14:55:51,450 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 14:55:51,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=339, Invalid=1067, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 14:55:51,452 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:55:51,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:55:51,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 14:55:51,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 14:55:51,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:55:51,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 14:55:51,452 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2025-03-17 14:55:51,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:55:51,452 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 14:55:51,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 25 states have internal predecessors, (71), 13 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2025-03-17 14:55:51,453 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 14:55:51,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 14:55:51,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-17 14:55:51,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-17 14:55:51,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-17 14:55:51,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-17 14:55:51,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-17 14:55:51,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-17 14:55:51,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 14:55:51,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:55:51,658 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:55:51,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 14:55:51,720 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:55:51,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:55:51 BoogieIcfgContainer [2025-03-17 14:55:51,728 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:55:51,729 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:55:51,729 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:55:51,729 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:55:51,729 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:55:47" (3/4) ... [2025-03-17 14:55:51,730 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 14:55:51,734 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-03-17 14:55:51,736 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-17 14:55:51,736 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 14:55:51,736 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 14:55:51,790 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:55:51,790 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:55:51,790 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:55:51,791 INFO L158 Benchmark]: Toolchain (without parser) took 4665.03ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 59.9MB in the end (delta: 44.5MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. [2025-03-17 14:55:51,791 INFO L158 Benchmark]: CDTParser took 0.69ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:55:51,791 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.62ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 82.9MB in the end (delta: 21.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 14:55:51,791 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.32ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 80.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:55:51,791 INFO L158 Benchmark]: Boogie Preprocessor took 27.33ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 79.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:55:51,791 INFO L158 Benchmark]: IcfgBuilder took 224.31ms. Allocated memory is still 142.6MB. Free memory was 79.2MB in the beginning and 66.8MB in the end (delta: 12.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 14:55:51,791 INFO L158 Benchmark]: TraceAbstraction took 3931.13ms. Allocated memory is still 142.6MB. Free memory was 66.1MB in the beginning and 65.7MB in the end (delta: 414.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:55:51,792 INFO L158 Benchmark]: Witness Printer took 61.47ms. Allocated memory is still 142.6MB. Free memory was 65.7MB in the beginning and 59.9MB in the end (delta: 5.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:55:51,792 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.69ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.62ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 82.9MB in the end (delta: 21.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.32ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 80.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.33ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 79.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 224.31ms. Allocated memory is still 142.6MB. Free memory was 79.2MB in the beginning and 66.8MB in the end (delta: 12.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3931.13ms. Allocated memory is still 142.6MB. Free memory was 66.1MB in the beginning and 65.7MB in the end (delta: 414.2kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 61.47ms. Allocated memory is still 142.6MB. Free memory was 65.7MB in the beginning and 59.9MB in the end (delta: 5.8MB). There was no memory consumed. 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: 773]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 773]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 773]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 773]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 767]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 767]: 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, 28 locations, 35 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 98 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 93 mSDsluCounter, 778 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 548 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 399 IncrementalHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 230 mSDtfsCounter, 399 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 375 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=9, InterpolantAutomatonStates: 73, 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, 11 MinimizatonAttempts, 35 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 454 NumberOfCodeBlocks, 454 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 574 ConstructedInterpolants, 0 QuantifiedInterpolants, 1196 SizeOfPredicates, 0 NumberOfNonLiveVariables, 976 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 21 InterpolantComputations, 7 PerfectInterpolantSequences, 339/514 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 6 specifications checked. All of them hold - InvariantResult [Line: 773]: Location Invariant Derived location invariant: (j < 2147483649) - InvariantResult [Line: 767]: Location Invariant Derived location invariant: ((((10 == len) && (1 <= i)) && (i <= 2147483642)) || ((10 == len) && (i == 0))) RESULT: Ultimate proved your program to be correct! [2025-03-17 14:55:51,804 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