./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7d44dc9ee297680f321b2cf4dcd79f3ba6ced2470ed6439fc6dd5eb0285efc9c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:36:16,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:36:16,270 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-09 07:36:16,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:36:16,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:36:16,297 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:36:16,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:36:16,298 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:36:16,299 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:36:16,302 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:36:16,302 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:36:16,302 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:36:16,302 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:36:16,303 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:36:16,303 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:36:16,303 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:36:16,303 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:36:16,303 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:36:16,303 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:36:16,303 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:36:16,304 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:36:16,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:36:16,305 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:36:16,305 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:36:16,306 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:36:16,306 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:36:16,306 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:36:16,306 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:36:16,307 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:36:16,307 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:36:16,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:36:16,307 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:36:16,308 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:36:16,308 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:36:16,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:36:16,308 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:36:16,309 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:36:16,309 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:36:16,309 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:36:16,309 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 7d44dc9ee297680f321b2cf4dcd79f3ba6ced2470ed6439fc6dd5eb0285efc9c [2024-11-09 07:36:16,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:36:16,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:36:16,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:36:16,565 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:36:16,565 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:36:16,566 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2024-11-09 07:36:18,030 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:36:18,267 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:36:18,267 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2024-11-09 07:36:18,283 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac97283f5/385742794d024ac3b8710df36db96dab/FLAGbd7a2c8c5 [2024-11-09 07:36:18,295 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac97283f5/385742794d024ac3b8710df36db96dab [2024-11-09 07:36:18,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:36:18,298 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:36:18,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:36:18,300 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:36:18,304 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:36:18,304 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:36:18" (1/1) ... [2024-11-09 07:36:18,305 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a70dcc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:18, skipping insertion in model container [2024-11-09 07:36:18,305 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:36:18" (1/1) ... [2024-11-09 07:36:18,339 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:36:18,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:36:18,810 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:36:18,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:36:18,877 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:36:18,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:18 WrapperNode [2024-11-09 07:36:18,878 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:36:18,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:36:18,879 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:36:18,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:36:18,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:18" (1/1) ... [2024-11-09 07:36:18,902 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:18" (1/1) ... [2024-11-09 07:36:18,922 INFO L138 Inliner]: procedures = 111, calls = 40, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 11 [2024-11-09 07:36:18,923 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:36:18,923 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:36:18,924 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:36:18,924 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:36:18,932 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:18" (1/1) ... [2024-11-09 07:36:18,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:18" (1/1) ... [2024-11-09 07:36:18,937 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:18" (1/1) ... [2024-11-09 07:36:18,958 INFO L175 MemorySlicer]: Split 21 memory accesses to 5 slices as follows [3, 4, 6, 5, 3]. 29 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0, 0]. The 10 writes are split as follows [1, 2, 3, 3, 1]. [2024-11-09 07:36:18,958 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:18" (1/1) ... [2024-11-09 07:36:18,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:18" (1/1) ... [2024-11-09 07:36:18,966 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:18" (1/1) ... [2024-11-09 07:36:18,971 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:18" (1/1) ... [2024-11-09 07:36:18,976 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:18" (1/1) ... [2024-11-09 07:36:18,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:18" (1/1) ... [2024-11-09 07:36:18,978 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:36:18,983 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:36:18,983 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:36:18,983 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:36:18,983 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:18" (1/1) ... [2024-11-09 07:36:18,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:36:18,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:36:19,023 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-11-09 07:36:19,032 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-11-09 07:36:19,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 07:36:19,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 07:36:19,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 07:36:19,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 07:36:19,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 07:36:19,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:36:19,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 07:36:19,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 07:36:19,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 07:36:19,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 07:36:19,088 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-09 07:36:19,088 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-09 07:36:19,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:36:19,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:36:19,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:36:19,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:36:19,208 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:36:19,210 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:36:19,418 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2024-11-09 07:36:19,418 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:36:19,428 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:36:19,429 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 07:36:19,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:36:19 BoogieIcfgContainer [2024-11-09 07:36:19,429 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:36:19,430 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:36:19,430 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:36:19,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:36:19,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:36:18" (1/3) ... [2024-11-09 07:36:19,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@368d32e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:36:19, skipping insertion in model container [2024-11-09 07:36:19,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:18" (2/3) ... [2024-11-09 07:36:19,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@368d32e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:36:19, skipping insertion in model container [2024-11-09 07:36:19,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:36:19" (3/3) ... [2024-11-09 07:36:19,435 INFO L112 eAbstractionObserver]: Analyzing ICFG HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2024-11-09 07:36:19,448 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:36:19,449 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2024-11-09 07:36:19,490 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:36:19,496 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=None, 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;@33af4178, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:36:19,497 INFO L334 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2024-11-09 07:36:19,500 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 85 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:36:19,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:36:19,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:19,506 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:36:19,506 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-09 07:36:19,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:19,513 INFO L85 PathProgramCache]: Analyzing trace with hash -62527250, now seen corresponding path program 1 times [2024-11-09 07:36:19,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:19,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875905152] [2024-11-09 07:36:19,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:19,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:20,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:20,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:20,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875905152] [2024-11-09 07:36:20,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875905152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:20,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:20,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:36:20,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812028280] [2024-11-09 07:36:20,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:20,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:36:20,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:20,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:36:20,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:36:20,064 INFO L87 Difference]: Start difference. First operand has 88 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 85 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:20,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:20,188 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2024-11-09 07:36:20,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:36:20,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 07:36:20,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:20,200 INFO L225 Difference]: With dead ends: 85 [2024-11-09 07:36:20,200 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 07:36:20,202 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-11-09 07:36:20,206 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 73 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:20,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 55 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:36:20,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 07:36:20,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-09 07:36:20,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 40 states have (on average 2.125) internal successors, (85), 80 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:36:20,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2024-11-09 07:36:20,243 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 6 [2024-11-09 07:36:20,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:20,244 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2024-11-09 07:36:20,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:20,244 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2024-11-09 07:36:20,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:36:20,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:20,245 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:36:20,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:36:20,245 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-09 07:36:20,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:20,246 INFO L85 PathProgramCache]: Analyzing trace with hash -62527249, now seen corresponding path program 1 times [2024-11-09 07:36:20,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:20,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55785933] [2024-11-09 07:36:20,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:20,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:20,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:20,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:20,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55785933] [2024-11-09 07:36:20,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55785933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:20,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:20,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:36:20,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569551698] [2024-11-09 07:36:20,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:20,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:36:20,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:20,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:36:20,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:36:20,574 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:20,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:20,626 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2024-11-09 07:36:20,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:36:20,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-09 07:36:20,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:20,627 INFO L225 Difference]: With dead ends: 80 [2024-11-09 07:36:20,627 INFO L226 Difference]: Without dead ends: 80 [2024-11-09 07:36:20,628 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-11-09 07:36:20,629 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:20,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 54 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:36:20,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-09 07:36:20,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-09 07:36:20,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 40 states have (on average 2.05) internal successors, (82), 77 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:36:20,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2024-11-09 07:36:20,634 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 6 [2024-11-09 07:36:20,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:20,634 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2024-11-09 07:36:20,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:20,635 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2024-11-09 07:36:20,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:36:20,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:20,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:36:20,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:36:20,635 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-09 07:36:20,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:20,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1938344776, now seen corresponding path program 1 times [2024-11-09 07:36:20,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:20,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302597673] [2024-11-09 07:36:20,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:20,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:20,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:20,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:20,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302597673] [2024-11-09 07:36:20,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302597673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:20,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:20,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:36:20,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915061434] [2024-11-09 07:36:20,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:20,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:36:20,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:20,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:36:20,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:36:20,716 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:20,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:20,765 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2024-11-09 07:36:20,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:36:20,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 07:36:20,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:20,766 INFO L225 Difference]: With dead ends: 76 [2024-11-09 07:36:20,766 INFO L226 Difference]: Without dead ends: 76 [2024-11-09 07:36:20,767 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-11-09 07:36:20,767 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:20,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 48 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:36:20,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-09 07:36:20,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-09 07:36:20,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 40 states have (on average 1.95) internal successors, (78), 73 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:36:20,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2024-11-09 07:36:20,781 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 7 [2024-11-09 07:36:20,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:20,781 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2024-11-09 07:36:20,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:20,782 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2024-11-09 07:36:20,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:36:20,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:20,785 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:36:20,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:36:20,786 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-09 07:36:20,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:20,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1938344775, now seen corresponding path program 1 times [2024-11-09 07:36:20,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:20,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751713817] [2024-11-09 07:36:20,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:20,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:20,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:20,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:20,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751713817] [2024-11-09 07:36:20,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751713817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:20,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:20,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:36:20,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757673637] [2024-11-09 07:36:20,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:20,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:36:20,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:20,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:36:20,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:36:20,919 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:20,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:20,974 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2024-11-09 07:36:20,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:36:20,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 07:36:20,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:20,975 INFO L225 Difference]: With dead ends: 72 [2024-11-09 07:36:20,975 INFO L226 Difference]: Without dead ends: 72 [2024-11-09 07:36:20,976 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-11-09 07:36:20,977 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 67 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:20,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 50 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:36:20,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-09 07:36:20,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-09 07:36:20,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 40 states have (on average 1.85) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:36:20,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2024-11-09 07:36:20,981 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 7 [2024-11-09 07:36:20,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:20,981 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2024-11-09 07:36:20,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:20,981 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2024-11-09 07:36:20,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 07:36:20,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:20,982 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:36:20,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:36:20,982 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting fErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-09 07:36:20,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:20,983 INFO L85 PathProgramCache]: Analyzing trace with hash 40854065, now seen corresponding path program 1 times [2024-11-09 07:36:20,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:20,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685889602] [2024-11-09 07:36:20,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:20,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:21,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:21,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:21,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685889602] [2024-11-09 07:36:21,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685889602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:21,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:21,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:36:21,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095148923] [2024-11-09 07:36:21,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:21,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:36:21,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:21,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:36:21,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:36:21,043 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:21,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:21,091 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2024-11-09 07:36:21,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:36:21,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 07:36:21,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:21,092 INFO L225 Difference]: With dead ends: 67 [2024-11-09 07:36:21,092 INFO L226 Difference]: Without dead ends: 67 [2024-11-09 07:36:21,092 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-11-09 07:36:21,094 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 53 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 43 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.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:21,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 43 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:36:21,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-09 07:36:21,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-09 07:36:21,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 40 states have (on average 1.725) internal successors, (69), 64 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:36:21,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2024-11-09 07:36:21,101 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 8 [2024-11-09 07:36:21,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:21,101 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2024-11-09 07:36:21,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:21,101 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2024-11-09 07:36:21,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 07:36:21,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:21,101 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:36:21,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:36:21,102 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting fErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-09 07:36:21,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:21,102 INFO L85 PathProgramCache]: Analyzing trace with hash 40854066, now seen corresponding path program 1 times [2024-11-09 07:36:21,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:21,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462909498] [2024-11-09 07:36:21,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:21,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:21,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:21,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:21,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462909498] [2024-11-09 07:36:21,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462909498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:21,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:21,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:36:21,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782333001] [2024-11-09 07:36:21,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:21,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:36:21,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:21,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:36:21,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:36:21,185 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:21,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:21,228 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2024-11-09 07:36:21,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:36:21,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 07:36:21,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:21,229 INFO L225 Difference]: With dead ends: 62 [2024-11-09 07:36:21,229 INFO L226 Difference]: Without dead ends: 62 [2024-11-09 07:36:21,230 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-11-09 07:36:21,231 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 56 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:21,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 45 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:36:21,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-09 07:36:21,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-09 07:36:21,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.6) internal successors, (64), 59 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:36:21,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2024-11-09 07:36:21,239 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 8 [2024-11-09 07:36:21,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:21,239 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2024-11-09 07:36:21,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:21,239 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2024-11-09 07:36:21,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 07:36:21,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:21,240 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:36:21,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:36:21,240 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting fErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-09 07:36:21,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:21,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1266475995, now seen corresponding path program 1 times [2024-11-09 07:36:21,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:21,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2648456] [2024-11-09 07:36:21,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:21,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:21,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:21,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:21,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2648456] [2024-11-09 07:36:21,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2648456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:21,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:21,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:36:21,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224773668] [2024-11-09 07:36:21,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:21,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:36:21,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:21,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:36:21,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:36:21,295 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:21,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:21,332 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2024-11-09 07:36:21,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:36:21,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 07:36:21,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:21,333 INFO L225 Difference]: With dead ends: 59 [2024-11-09 07:36:21,333 INFO L226 Difference]: Without dead ends: 59 [2024-11-09 07:36:21,333 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-11-09 07:36:21,334 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:21,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 40 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:36:21,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-09 07:36:21,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-09 07:36:21,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.525) internal successors, (61), 56 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:36:21,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2024-11-09 07:36:21,342 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 9 [2024-11-09 07:36:21,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:21,342 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2024-11-09 07:36:21,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:21,342 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2024-11-09 07:36:21,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 07:36:21,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:21,343 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:36:21,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:36:21,343 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting fErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-09 07:36:21,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:21,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1266475996, now seen corresponding path program 1 times [2024-11-09 07:36:21,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:21,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131899620] [2024-11-09 07:36:21,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:21,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:21,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:21,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:21,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131899620] [2024-11-09 07:36:21,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131899620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:21,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:21,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:36:21,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796364394] [2024-11-09 07:36:21,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:21,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:36:21,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:21,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:36:21,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:36:21,459 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:21,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:21,500 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2024-11-09 07:36:21,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:36:21,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 07:36:21,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:21,501 INFO L225 Difference]: With dead ends: 56 [2024-11-09 07:36:21,502 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 07:36:21,502 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-11-09 07:36:21,502 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 49 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:21,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 42 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:36:21,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 07:36:21,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-09 07:36:21,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.45) internal successors, (58), 53 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:36:21,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2024-11-09 07:36:21,510 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 9 [2024-11-09 07:36:21,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:21,510 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2024-11-09 07:36:21,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:21,510 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2024-11-09 07:36:21,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:36:21,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:21,511 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:36:21,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:36:21,511 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting fErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-09 07:36:21,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:21,512 INFO L85 PathProgramCache]: Analyzing trace with hash 606050164, now seen corresponding path program 1 times [2024-11-09 07:36:21,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:21,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964904060] [2024-11-09 07:36:21,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:21,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:21,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:21,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:21,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964904060] [2024-11-09 07:36:21,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964904060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:21,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:21,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:36:21,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202422770] [2024-11-09 07:36:21,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:21,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:36:21,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:21,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:36:21,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:36:21,561 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:21,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:21,600 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2024-11-09 07:36:21,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:36:21,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 07:36:21,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:21,601 INFO L225 Difference]: With dead ends: 50 [2024-11-09 07:36:21,601 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 07:36:21,602 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-11-09 07:36:21,602 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 33 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:21,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 34 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:36:21,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 07:36:21,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-09 07:36:21,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.3) internal successors, (52), 47 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:36:21,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2024-11-09 07:36:21,605 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 10 [2024-11-09 07:36:21,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:21,605 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2024-11-09 07:36:21,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:21,606 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2024-11-09 07:36:21,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:36:21,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:21,606 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:36:21,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:36:21,606 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting fErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-09 07:36:21,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:21,607 INFO L85 PathProgramCache]: Analyzing trace with hash 606050165, now seen corresponding path program 1 times [2024-11-09 07:36:21,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:21,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091686458] [2024-11-09 07:36:21,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:21,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:21,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:21,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:21,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091686458] [2024-11-09 07:36:21,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091686458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:21,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:21,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:36:21,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422849520] [2024-11-09 07:36:21,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:21,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:36:21,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:21,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:36:21,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:36:21,664 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:21,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:21,695 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2024-11-09 07:36:21,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:36:21,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 07:36:21,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:21,696 INFO L225 Difference]: With dead ends: 44 [2024-11-09 07:36:21,696 INFO L226 Difference]: Without dead ends: 44 [2024-11-09 07:36:21,697 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-11-09 07:36:21,697 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 36 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:21,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 36 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:36:21,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-09 07:36:21,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-09 07:36:21,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.15) internal successors, (46), 41 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:36:21,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2024-11-09 07:36:21,700 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 10 [2024-11-09 07:36:21,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:21,700 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2024-11-09 07:36:21,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:21,701 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2024-11-09 07:36:21,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:36:21,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:21,701 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:36:21,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:36:21,702 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-09 07:36:21,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:21,702 INFO L85 PathProgramCache]: Analyzing trace with hash 137416884, now seen corresponding path program 1 times [2024-11-09 07:36:21,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:21,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573769613] [2024-11-09 07:36:21,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:21,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:21,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 07:36:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:21,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:21,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:21,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573769613] [2024-11-09 07:36:21,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573769613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:21,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:21,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:36:21,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960422928] [2024-11-09 07:36:21,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:21,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:36:21,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:21,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:36:21,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:36:21,801 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:36:21,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:21,851 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2024-11-09 07:36:21,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:36:21,852 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-09 07:36:21,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:21,852 INFO L225 Difference]: With dead ends: 44 [2024-11-09 07:36:21,852 INFO L226 Difference]: Without dead ends: 44 [2024-11-09 07:36:21,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:36:21,853 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 34 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:21,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 118 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:36:21,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-09 07:36:21,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-09 07:36:21,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.125) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:36:21,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2024-11-09 07:36:21,855 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 15 [2024-11-09 07:36:21,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:21,856 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2024-11-09 07:36:21,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:36:21,856 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2024-11-09 07:36:21,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:36:21,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:21,856 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:36:21,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:36:21,857 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-09 07:36:21,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:21,857 INFO L85 PathProgramCache]: Analyzing trace with hash -2077535637, now seen corresponding path program 1 times [2024-11-09 07:36:21,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:21,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983608407] [2024-11-09 07:36:21,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:21,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:21,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 07:36:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:21,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:22,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:22,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983608407] [2024-11-09 07:36:22,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983608407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:22,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:22,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:36:22,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916780543] [2024-11-09 07:36:22,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:22,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:36:22,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:22,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:36:22,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:36:22,001 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:36:22,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:22,072 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2024-11-09 07:36:22,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:36:22,073 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-09 07:36:22,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:22,073 INFO L225 Difference]: With dead ends: 61 [2024-11-09 07:36:22,074 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 07:36:22,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:36:22,075 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 21 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:22,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 170 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:36:22,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 07:36:22,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2024-11-09 07:36:22,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:36:22,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2024-11-09 07:36:22,082 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 23 [2024-11-09 07:36:22,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:22,082 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2024-11-09 07:36:22,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:36:22,083 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2024-11-09 07:36:22,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:36:22,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:22,084 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:36:22,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:36:22,084 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-09 07:36:22,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:22,085 INFO L85 PathProgramCache]: Analyzing trace with hash -2090010354, now seen corresponding path program 1 times [2024-11-09 07:36:22,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:22,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055781435] [2024-11-09 07:36:22,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:22,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:22,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 07:36:22,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:22,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:36:22,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:22,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055781435] [2024-11-09 07:36:22,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055781435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:22,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:22,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:36:22,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361419322] [2024-11-09 07:36:22,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:22,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:36:22,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:22,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:36:22,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:36:22,235 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:36:22,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:22,300 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2024-11-09 07:36:22,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:36:22,301 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-09 07:36:22,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:22,301 INFO L225 Difference]: With dead ends: 70 [2024-11-09 07:36:22,301 INFO L226 Difference]: Without dead ends: 70 [2024-11-09 07:36:22,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:36:22,302 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 15 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:22,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 172 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:36:22,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-09 07:36:22,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2024-11-09 07:36:22,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 58 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:36:22,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2024-11-09 07:36:22,309 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 25 [2024-11-09 07:36:22,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:22,309 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2024-11-09 07:36:22,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:36:22,309 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2024-11-09 07:36:22,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 07:36:22,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:22,311 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:36:22,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:36:22,311 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2024-11-09 07:36:22,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:22,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1125264602, now seen corresponding path program 1 times [2024-11-09 07:36:22,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:22,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494626302] [2024-11-09 07:36:22,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:22,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:22,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 07:36:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:22,906 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 07:36:22,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:22,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494626302] [2024-11-09 07:36:22,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494626302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:22,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:22,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:36:22,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37968113] [2024-11-09 07:36:22,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:22,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:36:22,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:22,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:36:22,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:36:22,908 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:36:22,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:22,988 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2024-11-09 07:36:22,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:36:22,988 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2024-11-09 07:36:22,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:22,989 INFO L225 Difference]: With dead ends: 60 [2024-11-09 07:36:22,989 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 07:36:22,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:36:22,990 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 16 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:22,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 80 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:36:22,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 07:36:22,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 07:36:22,990 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-11-09 07:36:22,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 07:36:22,991 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2024-11-09 07:36:22,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:22,991 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 07:36:22,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:36:22,991 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 07:36:22,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 07:36:22,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 43 remaining) [2024-11-09 07:36:22,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 43 remaining) [2024-11-09 07:36:22,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 43 remaining) [2024-11-09 07:36:22,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 43 remaining) [2024-11-09 07:36:22,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 43 remaining) [2024-11-09 07:36:22,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 43 remaining) [2024-11-09 07:36:22,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 43 remaining) [2024-11-09 07:36:22,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 43 remaining) [2024-11-09 07:36:22,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 43 remaining) [2024-11-09 07:36:22,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 43 remaining) [2024-11-09 07:36:22,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 43 remaining) [2024-11-09 07:36:22,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 43 remaining) [2024-11-09 07:36:22,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 43 remaining) [2024-11-09 07:36:22,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 43 remaining) [2024-11-09 07:36:22,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 43 remaining) [2024-11-09 07:36:22,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 43 remaining) [2024-11-09 07:36:22,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 43 remaining) [2024-11-09 07:36:22,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 43 remaining) [2024-11-09 07:36:22,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 43 remaining) [2024-11-09 07:36:22,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 43 remaining) [2024-11-09 07:36:22,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 43 remaining) [2024-11-09 07:36:22,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 43 remaining) [2024-11-09 07:36:22,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 43 remaining) [2024-11-09 07:36:22,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 43 remaining) [2024-11-09 07:36:22,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 43 remaining) [2024-11-09 07:36:22,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 43 remaining) [2024-11-09 07:36:22,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 43 remaining) [2024-11-09 07:36:22,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 43 remaining) [2024-11-09 07:36:22,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 43 remaining) [2024-11-09 07:36:22,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 43 remaining) [2024-11-09 07:36:22,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 43 remaining) [2024-11-09 07:36:22,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 43 remaining) [2024-11-09 07:36:22,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 43 remaining) [2024-11-09 07:36:22,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 43 remaining) [2024-11-09 07:36:22,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 43 remaining) [2024-11-09 07:36:22,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 43 remaining) [2024-11-09 07:36:22,997 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 43 remaining) [2024-11-09 07:36:22,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 43 remaining) [2024-11-09 07:36:22,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 43 remaining) [2024-11-09 07:36:22,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 43 remaining) [2024-11-09 07:36:22,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 43 remaining) [2024-11-09 07:36:22,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 43 remaining) [2024-11-09 07:36:22,998 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 43 remaining) [2024-11-09 07:36:22,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:36:23,001 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:36:23,003 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:36:23,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:36:23 BoogieIcfgContainer [2024-11-09 07:36:23,005 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:36:23,005 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:36:23,005 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:36:23,005 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:36:23,006 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:36:19" (3/4) ... [2024-11-09 07:36:23,007 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 07:36:23,011 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2024-11-09 07:36:23,014 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2024-11-09 07:36:23,014 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-09 07:36:23,014 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 07:36:23,015 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 07:36:23,074 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 07:36:23,075 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 07:36:23,075 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:36:23,075 INFO L158 Benchmark]: Toolchain (without parser) took 4777.26ms. Allocated memory was 174.1MB in the beginning and 245.4MB in the end (delta: 71.3MB). Free memory was 106.4MB in the beginning and 98.0MB in the end (delta: 8.4MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2024-11-09 07:36:23,075 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 115.3MB. Free memory is still 77.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:36:23,076 INFO L158 Benchmark]: CACSL2BoogieTranslator took 578.79ms. Allocated memory is still 174.1MB. Free memory was 106.2MB in the beginning and 136.9MB in the end (delta: -30.7MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2024-11-09 07:36:23,076 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.66ms. Allocated memory is still 174.1MB. Free memory was 136.9MB in the beginning and 134.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:36:23,076 INFO L158 Benchmark]: Boogie Preprocessor took 58.62ms. Allocated memory is still 174.1MB. Free memory was 134.9MB in the beginning and 132.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:36:23,076 INFO L158 Benchmark]: RCFGBuilder took 446.63ms. Allocated memory is still 174.1MB. Free memory was 132.8MB in the beginning and 111.2MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 07:36:23,077 INFO L158 Benchmark]: TraceAbstraction took 3574.48ms. Allocated memory was 174.1MB in the beginning and 245.4MB in the end (delta: 71.3MB). Free memory was 110.4MB in the beginning and 104.3MB in the end (delta: 6.2MB). Peak memory consumption was 79.2MB. Max. memory is 16.1GB. [2024-11-09 07:36:23,077 INFO L158 Benchmark]: Witness Printer took 69.76ms. Allocated memory is still 245.4MB. Free memory was 104.3MB in the beginning and 98.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 07:36:23,078 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.17ms. Allocated memory is still 115.3MB. Free memory is still 77.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 578.79ms. Allocated memory is still 174.1MB. Free memory was 106.2MB in the beginning and 136.9MB in the end (delta: -30.7MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.66ms. Allocated memory is still 174.1MB. Free memory was 136.9MB in the beginning and 134.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.62ms. Allocated memory is still 174.1MB. Free memory was 134.9MB in the beginning and 132.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 446.63ms. Allocated memory is still 174.1MB. Free memory was 132.8MB in the beginning and 111.2MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3574.48ms. Allocated memory was 174.1MB in the beginning and 245.4MB in the end (delta: 71.3MB). Free memory was 110.4MB in the beginning and 104.3MB in the end (delta: 6.2MB). Peak memory consumption was 79.2MB. Max. memory is 16.1GB. * Witness Printer took 69.76ms. Allocated memory is still 245.4MB. Free memory was 104.3MB in the beginning and 98.0MB in the end (delta: 6.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: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 43 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 639 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 639 mSDsluCounter, 987 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 458 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 661 IncrementalHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 529 mSDtfsCounter, 661 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=0, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 165 ConstructedInterpolants, 0 QuantifiedInterpolants, 2201 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 6/6 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 43 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 07:36:23,101 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