./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrncat-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrncat-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash a82db68f7b8f363f6b0bcc2411736f9dd89d1bc3b2cb78acd33fa27de131c98b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 20:22:12,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 20:22:12,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-14 20:22:12,563 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 20:22:12,564 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 20:22:12,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 20:22:12,588 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 20:22:12,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 20:22:12,589 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 20:22:12,590 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 20:22:12,590 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 20:22:12,591 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 20:22:12,591 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 20:22:12,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 20:22:12,594 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 20:22:12,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 20:22:12,594 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 20:22:12,594 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 20:22:12,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 20:22:12,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 20:22:12,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 20:22:12,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 20:22:12,595 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 20:22:12,596 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-14 20:22:12,596 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 20:22:12,596 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 20:22:12,596 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 20:22:12,597 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 20:22:12,597 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 20:22:12,598 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 20:22:12,598 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 20:22:12,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:22:12,599 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 20:22:12,599 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 20:22:12,599 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 20:22:12,600 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 20:22:12,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 20:22:12,600 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 20:22:12,600 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 20:22:12,601 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 20:22:12,601 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 20:22:12,601 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a82db68f7b8f363f6b0bcc2411736f9dd89d1bc3b2cb78acd33fa27de131c98b [2024-10-14 20:22:12,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 20:22:12,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 20:22:12,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 20:22:12,877 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 20:22:12,878 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 20:22:12,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrncat-alloca-1.i [2024-10-14 20:22:14,138 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 20:22:14,330 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 20:22:14,331 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrncat-alloca-1.i [2024-10-14 20:22:14,341 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63d9cca94/a058d96502bb4bc3abd3e16b445df058/FLAG445f44059 [2024-10-14 20:22:14,353 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63d9cca94/a058d96502bb4bc3abd3e16b445df058 [2024-10-14 20:22:14,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 20:22:14,356 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 20:22:14,357 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 20:22:14,357 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 20:22:14,362 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 20:22:14,363 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:22:14" (1/1) ... [2024-10-14 20:22:14,364 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d18d2f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:22:14, skipping insertion in model container [2024-10-14 20:22:14,364 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:22:14" (1/1) ... [2024-10-14 20:22:14,396 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 20:22:14,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:22:14,624 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 20:22:14,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 20:22:14,688 INFO L204 MainTranslator]: Completed translation [2024-10-14 20:22:14,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:22:14 WrapperNode [2024-10-14 20:22:14,689 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 20:22:14,690 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 20:22:14,690 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 20:22:14,690 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 20:22:14,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:22:14" (1/1) ... [2024-10-14 20:22:14,712 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:22:14" (1/1) ... [2024-10-14 20:22:14,730 INFO L138 Inliner]: procedures = 111, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 96 [2024-10-14 20:22:14,731 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 20:22:14,732 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 20:22:14,733 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 20:22:14,733 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 20:22:14,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:22:14" (1/1) ... [2024-10-14 20:22:14,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:22:14" (1/1) ... [2024-10-14 20:22:14,744 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:22:14" (1/1) ... [2024-10-14 20:22:14,761 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [1, 3]. [2024-10-14 20:22:14,761 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:22:14" (1/1) ... [2024-10-14 20:22:14,761 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:22:14" (1/1) ... [2024-10-14 20:22:14,766 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:22:14" (1/1) ... [2024-10-14 20:22:14,772 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:22:14" (1/1) ... [2024-10-14 20:22:14,775 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:22:14" (1/1) ... [2024-10-14 20:22:14,776 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:22:14" (1/1) ... [2024-10-14 20:22:14,777 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 20:22:14,778 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 20:22:14,778 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 20:22:14,778 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 20:22:14,779 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:22:14" (1/1) ... [2024-10-14 20:22:14,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 20:22:14,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 20:22:14,817 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) [2024-10-14 20:22:14,819 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 [2024-10-14 20:22:14,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 20:22:14,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 20:22:14,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 20:22:14,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 20:22:14,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 20:22:14,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 20:22:14,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 20:22:14,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 20:22:14,955 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 20:22:14,957 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 20:22:15,126 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-10-14 20:22:15,127 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 20:22:15,145 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 20:22:15,146 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 20:22:15,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:22:15 BoogieIcfgContainer [2024-10-14 20:22:15,147 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 20:22:15,148 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 20:22:15,149 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 20:22:15,152 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 20:22:15,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:22:14" (1/3) ... [2024-10-14 20:22:15,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf34ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:22:15, skipping insertion in model container [2024-10-14 20:22:15,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:22:14" (2/3) ... [2024-10-14 20:22:15,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf34ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:22:15, skipping insertion in model container [2024-10-14 20:22:15,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:22:15" (3/3) ... [2024-10-14 20:22:15,154 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncat-alloca-1.i [2024-10-14 20:22:15,167 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 20:22:15,167 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-14 20:22:15,209 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 20:22:15,214 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;@31d00b7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 20:22:15,215 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-14 20:22:15,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 32 states have internal predecessors, (43), 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) [2024-10-14 20:22:15,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 20:22:15,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:22:15,226 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:22:15,226 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:22:15,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:22:15,230 INFO L85 PathProgramCache]: Analyzing trace with hash -577357624, now seen corresponding path program 1 times [2024-10-14 20:22:15,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:22:15,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969161242] [2024-10-14 20:22:15,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:22:15,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:22:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:22:15,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:22:15,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:22:15,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969161242] [2024-10-14 20:22:15,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969161242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:22:15,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:22:15,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:22:15,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19639165] [2024-10-14 20:22:15,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:22:15,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:22:15,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:22:15,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:22:15,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:22:15,472 INFO L87 Difference]: Start difference. First operand has 33 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:15,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:22:15,559 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2024-10-14 20:22:15,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:22:15,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 20:22:15,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:22:15,567 INFO L225 Difference]: With dead ends: 54 [2024-10-14 20:22:15,568 INFO L226 Difference]: Without dead ends: 32 [2024-10-14 20:22:15,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:22:15,573 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 31 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:22:15,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 55 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:22:15,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-14 20:22:15,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2024-10-14 20:22:15,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.608695652173913) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:15,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-10-14 20:22:15,597 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 7 [2024-10-14 20:22:15,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:22:15,597 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-10-14 20:22:15,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:15,598 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-10-14 20:22:15,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 20:22:15,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:22:15,598 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:22:15,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 20:22:15,598 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:22:15,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:22:15,599 INFO L85 PathProgramCache]: Analyzing trace with hash -577298042, now seen corresponding path program 1 times [2024-10-14 20:22:15,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:22:15,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191716102] [2024-10-14 20:22:15,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:22:15,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:22:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:22:15,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:22:15,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:22:15,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191716102] [2024-10-14 20:22:15,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191716102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:22:15,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:22:15,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:22:15,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201751728] [2024-10-14 20:22:15,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:22:15,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:22:15,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:22:15,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:22:15,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:22:15,655 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:15,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:22:15,721 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2024-10-14 20:22:15,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:22:15,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 20:22:15,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:22:15,722 INFO L225 Difference]: With dead ends: 32 [2024-10-14 20:22:15,723 INFO L226 Difference]: Without dead ends: 29 [2024-10-14 20:22:15,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:22:15,724 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 20:22:15,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 17 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 20:22:15,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-14 20:22:15,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2024-10-14 20:22:15,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 19 states have internal predecessors, (23), 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) [2024-10-14 20:22:15,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-10-14 20:22:15,727 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 7 [2024-10-14 20:22:15,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:22:15,727 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-10-14 20:22:15,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:15,727 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2024-10-14 20:22:15,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 20:22:15,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:22:15,728 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:22:15,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 20:22:15,728 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:22:15,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:22:15,729 INFO L85 PathProgramCache]: Analyzing trace with hash -718217100, now seen corresponding path program 1 times [2024-10-14 20:22:15,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:22:15,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454059102] [2024-10-14 20:22:15,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:22:15,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:22:15,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:22:15,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:22:15,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:22:15,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454059102] [2024-10-14 20:22:15,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454059102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:22:15,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:22:15,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:22:15,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694284532] [2024-10-14 20:22:15,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:22:15,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:22:15,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:22:15,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:22:15,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:22:15,787 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:15,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:22:15,836 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2024-10-14 20:22:15,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:22:15,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 20:22:15,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:22:15,837 INFO L225 Difference]: With dead ends: 34 [2024-10-14 20:22:15,837 INFO L226 Difference]: Without dead ends: 31 [2024-10-14 20:22:15,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:22:15,840 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:22:15,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 30 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:22:15,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-14 20:22:15,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-14 20:22:15,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:15,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-10-14 20:22:15,844 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 8 [2024-10-14 20:22:15,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:22:15,844 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-10-14 20:22:15,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:15,844 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-10-14 20:22:15,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 20:22:15,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:22:15,844 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:22:15,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 20:22:15,845 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:22:15,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:22:15,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1056790262, now seen corresponding path program 1 times [2024-10-14 20:22:15,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:22:15,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16797601] [2024-10-14 20:22:15,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:22:15,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:22:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:22:15,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:22:15,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:22:15,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16797601] [2024-10-14 20:22:15,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16797601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:22:15,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:22:15,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:22:15,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661282885] [2024-10-14 20:22:15,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:22:15,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 20:22:15,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:22:15,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 20:22:15,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 20:22:15,897 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:15,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:22:15,926 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2024-10-14 20:22:15,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 20:22:15,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 20:22:15,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:22:15,928 INFO L225 Difference]: With dead ends: 31 [2024-10-14 20:22:15,928 INFO L226 Difference]: Without dead ends: 28 [2024-10-14 20:22:15,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:22:15,929 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:22:15,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 17 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:22:15,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-14 20:22:15,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2024-10-14 20:22:15,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:15,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2024-10-14 20:22:15,935 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 8 [2024-10-14 20:22:15,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:22:15,936 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-10-14 20:22:15,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:15,936 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2024-10-14 20:22:15,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 20:22:15,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:22:15,937 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:22:15,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 20:22:15,938 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:22:15,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:22:15,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1131447690, now seen corresponding path program 1 times [2024-10-14 20:22:15,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:22:15,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416637981] [2024-10-14 20:22:15,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:22:15,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:22:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:22:16,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:22:16,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:22:16,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416637981] [2024-10-14 20:22:16,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416637981] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:22:16,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:22:16,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 20:22:16,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119132156] [2024-10-14 20:22:16,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:22:16,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 20:22:16,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:22:16,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 20:22:16,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 20:22:16,059 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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) [2024-10-14 20:22:16,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:22:16,114 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2024-10-14 20:22:16,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 20:22:16,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-14 20:22:16,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:22:16,115 INFO L225 Difference]: With dead ends: 35 [2024-10-14 20:22:16,115 INFO L226 Difference]: Without dead ends: 26 [2024-10-14 20:22:16,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 20:22:16,116 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 24 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:22:16,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 29 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:22:16,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-14 20:22:16,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2024-10-14 20:22:16,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 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) [2024-10-14 20:22:16,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-10-14 20:22:16,123 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2024-10-14 20:22:16,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:22:16,123 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-10-14 20:22:16,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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) [2024-10-14 20:22:16,124 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-10-14 20:22:16,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 20:22:16,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:22:16,124 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:22:16,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 20:22:16,124 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:22:16,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:22:16,125 INFO L85 PathProgramCache]: Analyzing trace with hash -451389320, now seen corresponding path program 1 times [2024-10-14 20:22:16,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:22:16,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735464435] [2024-10-14 20:22:16,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:22:16,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:22:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:22:16,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:22:16,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:22:16,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735464435] [2024-10-14 20:22:16,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735464435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:22:16,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:22:16,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 20:22:16,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568132177] [2024-10-14 20:22:16,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:22:16,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:22:16,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:22:16,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:22:16,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:22:16,161 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2024-10-14 20:22:16,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:22:16,169 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2024-10-14 20:22:16,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:22:16,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-14 20:22:16,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:22:16,172 INFO L225 Difference]: With dead ends: 28 [2024-10-14 20:22:16,173 INFO L226 Difference]: Without dead ends: 19 [2024-10-14 20:22:16,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:22:16,173 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 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 [2024-10-14 20:22:16,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:22:16,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-14 20:22:16,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2024-10-14 20:22:16,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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) [2024-10-14 20:22:16,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-10-14 20:22:16,177 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2024-10-14 20:22:16,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:22:16,178 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-10-14 20:22:16,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2024-10-14 20:22:16,178 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-10-14 20:22:16,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 20:22:16,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:22:16,178 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:22:16,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 20:22:16,179 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:22:16,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:22:16,179 INFO L85 PathProgramCache]: Analyzing trace with hash 299547194, now seen corresponding path program 1 times [2024-10-14 20:22:16,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:22:16,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904880506] [2024-10-14 20:22:16,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:22:16,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:22:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:22:16,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:22:16,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:22:16,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904880506] [2024-10-14 20:22:16,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904880506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:22:16,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:22:16,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:22:16,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293930810] [2024-10-14 20:22:16,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:22:16,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:22:16,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:22:16,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:22:16,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:22:16,237 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:16,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:22:16,248 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2024-10-14 20:22:16,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:22:16,249 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-14 20:22:16,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:22:16,249 INFO L225 Difference]: With dead ends: 17 [2024-10-14 20:22:16,249 INFO L226 Difference]: Without dead ends: 16 [2024-10-14 20:22:16,249 INFO L431 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 [2024-10-14 20:22:16,250 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 2 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:22:16,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 15 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:22:16,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-10-14 20:22:16,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-10-14 20:22:16,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:16,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-10-14 20:22:16,251 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 14 [2024-10-14 20:22:16,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:22:16,252 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-10-14 20:22:16,252 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), 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) [2024-10-14 20:22:16,252 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-10-14 20:22:16,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 20:22:16,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:22:16,254 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:22:16,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 20:22:16,254 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:22:16,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:22:16,255 INFO L85 PathProgramCache]: Analyzing trace with hash 696028500, now seen corresponding path program 1 times [2024-10-14 20:22:16,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:22:16,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497932804] [2024-10-14 20:22:16,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:22:16,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:22:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:22:16,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:22:16,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:22:16,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497932804] [2024-10-14 20:22:16,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497932804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:22:16,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:22:16,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 20:22:16,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493226740] [2024-10-14 20:22:16,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:22:16,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 20:22:16,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:22:16,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 20:22:16,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 20:22:16,342 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:16,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:22:16,412 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-10-14 20:22:16,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 20:22:16,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 20:22:16,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:22:16,413 INFO L225 Difference]: With dead ends: 30 [2024-10-14 20:22:16,413 INFO L226 Difference]: Without dead ends: 16 [2024-10-14 20:22:16,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 20:22:16,416 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 15 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:22:16,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 37 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:22:16,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-10-14 20:22:16,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-10-14 20:22:16,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:16,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2024-10-14 20:22:16,418 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 15 [2024-10-14 20:22:16,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:22:16,420 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-10-14 20:22:16,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:16,420 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2024-10-14 20:22:16,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 20:22:16,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:22:16,420 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:22:16,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 20:22:16,420 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:22:16,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:22:16,421 INFO L85 PathProgramCache]: Analyzing trace with hash -315088750, now seen corresponding path program 1 times [2024-10-14 20:22:16,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:22:16,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43051387] [2024-10-14 20:22:16,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:22:16,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:22:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:22:16,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:22:16,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:22:16,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43051387] [2024-10-14 20:22:16,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43051387] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:22:16,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:22:16,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 20:22:16,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475990544] [2024-10-14 20:22:16,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:22:16,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:22:16,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:22:16,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:22:16,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:22:16,457 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:16,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:22:16,472 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2024-10-14 20:22:16,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:22:16,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 20:22:16,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:22:16,472 INFO L225 Difference]: With dead ends: 29 [2024-10-14 20:22:16,472 INFO L226 Difference]: Without dead ends: 16 [2024-10-14 20:22:16,473 INFO L431 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 [2024-10-14 20:22:16,473 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:22:16,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 23 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:22:16,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-10-14 20:22:16,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-10-14 20:22:16,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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) [2024-10-14 20:22:16,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2024-10-14 20:22:16,475 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 15 [2024-10-14 20:22:16,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:22:16,475 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2024-10-14 20:22:16,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:16,475 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2024-10-14 20:22:16,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 20:22:16,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 20:22:16,475 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:22:16,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 20:22:16,475 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-14 20:22:16,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 20:22:16,476 INFO L85 PathProgramCache]: Analyzing trace with hash -901894764, now seen corresponding path program 1 times [2024-10-14 20:22:16,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 20:22:16,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617458418] [2024-10-14 20:22:16,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 20:22:16,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 20:22:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 20:22:16,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 20:22:16,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 20:22:16,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617458418] [2024-10-14 20:22:16,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617458418] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 20:22:16,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 20:22:16,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 20:22:16,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052486248] [2024-10-14 20:22:16,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 20:22:16,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 20:22:16,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 20:22:16,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 20:22:16,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:22:16,503 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:16,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 20:22:16,510 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2024-10-14 20:22:16,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 20:22:16,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 20:22:16,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 20:22:16,511 INFO L225 Difference]: With dead ends: 16 [2024-10-14 20:22:16,511 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 20:22:16,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 20:22:16,512 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 20:22:16,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 10 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 20:22:16,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 20:22:16,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 20:22:16,512 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) [2024-10-14 20:22:16,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 20:22:16,512 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2024-10-14 20:22:16,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 20:22:16,513 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 20:22:16,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 20:22:16,513 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 20:22:16,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 20:22:16,515 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-14 20:22:16,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-14 20:22:16,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-14 20:22:16,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-14 20:22:16,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-14 20:22:16,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-14 20:22:16,516 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-14 20:22:16,517 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-14 20:22:16,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 20:22:16,519 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 20:22:16,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 20:22:16,536 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 20:22:16,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:22:16 BoogieIcfgContainer [2024-10-14 20:22:16,546 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 20:22:16,546 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 20:22:16,546 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 20:22:16,547 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 20:22:16,547 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:22:15" (3/4) ... [2024-10-14 20:22:16,548 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 20:22:16,554 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-14 20:22:16,555 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-14 20:22:16,555 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-14 20:22:16,555 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 20:22:16,630 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 20:22:16,630 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 20:22:16,630 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 20:22:16,631 INFO L158 Benchmark]: Toolchain (without parser) took 2275.02ms. Allocated memory is still 146.8MB. Free memory was 103.4MB in the beginning and 48.9MB in the end (delta: 54.6MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. [2024-10-14 20:22:16,631 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 20:22:16,632 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.32ms. Allocated memory is still 146.8MB. Free memory was 103.4MB in the beginning and 85.8MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 20:22:16,632 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.84ms. Allocated memory is still 146.8MB. Free memory was 85.8MB in the beginning and 83.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:22:16,632 INFO L158 Benchmark]: Boogie Preprocessor took 45.47ms. Allocated memory is still 146.8MB. Free memory was 83.7MB in the beginning and 81.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 20:22:16,632 INFO L158 Benchmark]: RCFGBuilder took 368.45ms. Allocated memory is still 146.8MB. Free memory was 81.7MB in the beginning and 109.8MB in the end (delta: -28.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 20:22:16,632 INFO L158 Benchmark]: TraceAbstraction took 1397.41ms. Allocated memory is still 146.8MB. Free memory was 109.1MB in the beginning and 54.1MB in the end (delta: 54.9MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. [2024-10-14 20:22:16,633 INFO L158 Benchmark]: Witness Printer took 84.13ms. Allocated memory is still 146.8MB. Free memory was 54.1MB in the beginning and 48.9MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 20:22:16,634 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.13ms. Allocated memory is still 109.1MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.32ms. Allocated memory is still 146.8MB. Free memory was 103.4MB in the beginning and 85.8MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.84ms. Allocated memory is still 146.8MB. Free memory was 85.8MB in the beginning and 83.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.47ms. Allocated memory is still 146.8MB. Free memory was 83.7MB in the beginning and 81.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 368.45ms. Allocated memory is still 146.8MB. Free memory was 81.7MB in the beginning and 109.8MB in the end (delta: -28.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1397.41ms. Allocated memory is still 146.8MB. Free memory was 109.1MB in the beginning and 54.1MB in the end (delta: 54.9MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. * Witness Printer took 84.13ms. Allocated memory is still 146.8MB. Free memory was 54.1MB in the beginning and 48.9MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. 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: 577]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 577]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 580]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 580]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 580]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 580]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 581]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 581]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 136 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 136 mSDsluCounter, 266 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 129 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 279 IncrementalHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 137 mSDtfsCounter, 279 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 30 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 103 ConstructedInterpolants, 0 QuantifiedInterpolants, 284 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 555]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-10-14 20:22:16,668 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