./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.07-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.07-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 468953385e0ecb57effbe4a67e36beea0bc9797d81fab044af341dde527767a1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:48:08,445 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:48:08,509 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-14 17:48:08,523 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:48:08,523 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:48:08,544 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:48:08,544 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:48:08,545 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:48:08,545 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:48:08,546 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:48:08,546 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:48:08,547 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:48:08,548 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:48:08,548 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:48:08,549 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:48:08,549 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:48:08,549 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:48:08,549 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:48:08,550 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:48:08,550 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:48:08,550 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 17:48:08,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:48:08,554 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:48:08,554 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:48:08,555 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:48:08,555 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:48:08,555 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:48:08,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:48:08,556 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:48:08,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:48:08,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:48:08,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:48:08,556 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:48:08,557 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:48:08,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:48:08,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:48:08,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:48:08,558 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:48:08,559 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:48:08,559 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 -> 468953385e0ecb57effbe4a67e36beea0bc9797d81fab044af341dde527767a1 [2024-10-14 17:48:08,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:48:08,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:48:08,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:48:08,848 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:48:08,848 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:48:08,849 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.07-alloca.i [2024-10-14 17:48:10,294 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:48:10,531 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:48:10,534 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.07-alloca.i [2024-10-14 17:48:10,552 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dd0f82bf/57fd335293df445fbd2ca13bf25964e4/FLAG364694e05 [2024-10-14 17:48:10,873 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dd0f82bf/57fd335293df445fbd2ca13bf25964e4 [2024-10-14 17:48:10,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:48:10,876 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:48:10,878 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:48:10,878 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:48:10,883 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:48:10,883 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:48:10" (1/1) ... [2024-10-14 17:48:10,884 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f063c8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:10, skipping insertion in model container [2024-10-14 17:48:10,884 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:48:10" (1/1) ... [2024-10-14 17:48:10,925 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:48:11,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:48:11,199 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:48:11,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:48:11,283 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:48:11,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:11 WrapperNode [2024-10-14 17:48:11,283 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:48:11,285 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:48:11,285 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:48:11,285 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:48:11,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:11" (1/1) ... [2024-10-14 17:48:11,311 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:11" (1/1) ... [2024-10-14 17:48:11,335 INFO L138 Inliner]: procedures = 111, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85 [2024-10-14 17:48:11,338 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:48:11,339 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:48:11,339 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:48:11,340 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:48:11,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:11" (1/1) ... [2024-10-14 17:48:11,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:11" (1/1) ... [2024-10-14 17:48:11,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:11" (1/1) ... [2024-10-14 17:48:11,366 INFO L175 MemorySlicer]: Split 13 memory accesses to 4 slices as follows [4, 4, 3, 2]. 31 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0]. The 6 writes are split as follows [2, 2, 1, 1]. [2024-10-14 17:48:11,366 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:11" (1/1) ... [2024-10-14 17:48:11,366 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:11" (1/1) ... [2024-10-14 17:48:11,372 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:11" (1/1) ... [2024-10-14 17:48:11,377 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:11" (1/1) ... [2024-10-14 17:48:11,378 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:11" (1/1) ... [2024-10-14 17:48:11,379 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:11" (1/1) ... [2024-10-14 17:48:11,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:48:11,383 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:48:11,383 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:48:11,383 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:48:11,384 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:11" (1/1) ... [2024-10-14 17:48:11,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:48:11,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:48:11,421 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 17:48:11,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 17:48:11,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 17:48:11,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 17:48:11,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 17:48:11,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 17:48:11,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 17:48:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 17:48:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 17:48:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 17:48:11,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 17:48:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:48:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:48:11,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:48:11,620 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:48:11,623 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:48:11,916 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2024-10-14 17:48:11,917 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:48:11,997 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:48:11,998 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 17:48:11,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:48:11 BoogieIcfgContainer [2024-10-14 17:48:11,999 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:48:12,001 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:48:12,001 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:48:12,019 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:48:12,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:48:10" (1/3) ... [2024-10-14 17:48:12,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b744188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:48:12, skipping insertion in model container [2024-10-14 17:48:12,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:11" (2/3) ... [2024-10-14 17:48:12,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b744188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:48:12, skipping insertion in model container [2024-10-14 17:48:12,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:48:11" (3/3) ... [2024-10-14 17:48:12,022 INFO L112 eAbstractionObserver]: Analyzing ICFG b.07-alloca.i [2024-10-14 17:48:12,039 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:48:12,040 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2024-10-14 17:48:12,102 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:48:12,108 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;@3fa1cde4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:48:12,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2024-10-14 17:48:12,112 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 17 states have (on average 2.764705882352941) internal successors, (47), 44 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:12,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 17:48:12,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:12,117 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 17:48:12,118 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-14 17:48:12,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:12,123 INFO L85 PathProgramCache]: Analyzing trace with hash 3166, now seen corresponding path program 1 times [2024-10-14 17:48:12,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:12,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982843605] [2024-10-14 17:48:12,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:12,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:12,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-10-14 17:48:12,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:12,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982843605] [2024-10-14 17:48:12,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982843605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:12,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:12,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 17:48:12,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877812416] [2024-10-14 17:48:12,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:12,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:48:12,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:12,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:48:12,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:48:12,611 INFO L87 Difference]: Start difference. First operand has 45 states, 17 states have (on average 2.764705882352941) internal successors, (47), 44 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:12,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:12,696 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2024-10-14 17:48:12,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:48:12,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-14 17:48:12,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:12,709 INFO L225 Difference]: With dead ends: 41 [2024-10-14 17:48:12,710 INFO L226 Difference]: Without dead ends: 40 [2024-10-14 17:48:12,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:48:12,717 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:12,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 14 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:48:12,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-14 17:48:12,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-14 17:48:12,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 17 states have (on average 2.411764705882353) internal successors, (41), 39 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:12,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2024-10-14 17:48:12,748 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 2 [2024-10-14 17:48:12,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:12,749 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2024-10-14 17:48:12,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:12,749 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2024-10-14 17:48:12,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 17:48:12,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:12,749 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 17:48:12,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:48:12,750 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-14 17:48:12,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:12,751 INFO L85 PathProgramCache]: Analyzing trace with hash 3167, now seen corresponding path program 1 times [2024-10-14 17:48:12,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:12,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35113481] [2024-10-14 17:48:12,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:12,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:12,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:12,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:12,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35113481] [2024-10-14 17:48:12,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35113481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:12,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:12,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 17:48:12,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461180183] [2024-10-14 17:48:12,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:12,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:48:12,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:12,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:48:12,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:48:12,980 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:13,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:13,045 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2024-10-14 17:48:13,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:48:13,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-14 17:48:13,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:13,047 INFO L225 Difference]: With dead ends: 36 [2024-10-14 17:48:13,048 INFO L226 Difference]: Without dead ends: 36 [2024-10-14 17:48:13,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:48:13,050 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 34 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:13,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 15 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:48:13,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-14 17:48:13,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-14 17:48:13,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 17 states have (on average 2.176470588235294) internal successors, (37), 35 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:13,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-10-14 17:48:13,058 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 2 [2024-10-14 17:48:13,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:13,059 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-10-14 17:48:13,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:13,059 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-10-14 17:48:13,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-14 17:48:13,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:13,060 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-14 17:48:13,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:48:13,060 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-14 17:48:13,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:13,062 INFO L85 PathProgramCache]: Analyzing trace with hash 98122, now seen corresponding path program 1 times [2024-10-14 17:48:13,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:13,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913810920] [2024-10-14 17:48:13,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:13,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:13,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:13,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:13,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913810920] [2024-10-14 17:48:13,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913810920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:13,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:13,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 17:48:13,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828554867] [2024-10-14 17:48:13,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:13,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:48:13,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:13,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:48:13,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:48:13,176 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:13,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:13,225 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2024-10-14 17:48:13,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:48:13,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-14 17:48:13,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:13,226 INFO L225 Difference]: With dead ends: 32 [2024-10-14 17:48:13,226 INFO L226 Difference]: Without dead ends: 32 [2024-10-14 17:48:13,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:48:13,227 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:13,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 10 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:48:13,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-14 17:48:13,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-14 17:48:13,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:13,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2024-10-14 17:48:13,232 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 3 [2024-10-14 17:48:13,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:13,233 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2024-10-14 17:48:13,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:13,233 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2024-10-14 17:48:13,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-14 17:48:13,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:13,234 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-14 17:48:13,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:48:13,234 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-14 17:48:13,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:13,235 INFO L85 PathProgramCache]: Analyzing trace with hash 98123, now seen corresponding path program 1 times [2024-10-14 17:48:13,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:13,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879758758] [2024-10-14 17:48:13,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:13,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:13,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:13,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:13,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879758758] [2024-10-14 17:48:13,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879758758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:13,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:13,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 17:48:13,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550102675] [2024-10-14 17:48:13,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:13,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:48:13,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:13,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:48:13,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:48:13,345 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:13,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:13,390 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2024-10-14 17:48:13,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:48:13,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-14 17:48:13,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:13,391 INFO L225 Difference]: With dead ends: 28 [2024-10-14 17:48:13,391 INFO L226 Difference]: Without dead ends: 28 [2024-10-14 17:48:13,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:48:13,393 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 25 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:13,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 11 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:48:13,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-14 17:48:13,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-14 17:48:13,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:13,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2024-10-14 17:48:13,401 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 3 [2024-10-14 17:48:13,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:13,401 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2024-10-14 17:48:13,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:13,402 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2024-10-14 17:48:13,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 17:48:13,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:13,403 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 17:48:13,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:48:13,404 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-14 17:48:13,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:13,404 INFO L85 PathProgramCache]: Analyzing trace with hash 3041761, now seen corresponding path program 1 times [2024-10-14 17:48:13,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:13,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931347963] [2024-10-14 17:48:13,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:13,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:13,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:13,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:13,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931347963] [2024-10-14 17:48:13,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931347963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:13,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:13,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 17:48:13,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26272643] [2024-10-14 17:48:13,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:13,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:48:13,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:13,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:48:13,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:48:13,474 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:13,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:13,512 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2024-10-14 17:48:13,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:48:13,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-14 17:48:13,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:13,513 INFO L225 Difference]: With dead ends: 25 [2024-10-14 17:48:13,514 INFO L226 Difference]: Without dead ends: 25 [2024-10-14 17:48:13,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:48:13,515 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:13,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 7 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:48:13,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-14 17:48:13,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-14 17:48:13,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:13,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2024-10-14 17:48:13,522 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 4 [2024-10-14 17:48:13,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:13,523 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-10-14 17:48:13,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:13,523 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2024-10-14 17:48:13,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 17:48:13,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:13,523 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 17:48:13,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:48:13,523 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-14 17:48:13,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:13,524 INFO L85 PathProgramCache]: Analyzing trace with hash 3041762, now seen corresponding path program 1 times [2024-10-14 17:48:13,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:13,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134038319] [2024-10-14 17:48:13,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:13,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:13,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:13,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:13,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134038319] [2024-10-14 17:48:13,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134038319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:13,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:13,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 17:48:13,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873307496] [2024-10-14 17:48:13,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:13,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:48:13,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:13,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:48:13,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:48:13,595 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:13,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:13,658 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2024-10-14 17:48:13,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:48:13,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-14 17:48:13,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:13,659 INFO L225 Difference]: With dead ends: 22 [2024-10-14 17:48:13,659 INFO L226 Difference]: Without dead ends: 22 [2024-10-14 17:48:13,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:48:13,660 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 18 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:13,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 8 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:48:13,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-14 17:48:13,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-14 17:48:13,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:13,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2024-10-14 17:48:13,668 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 4 [2024-10-14 17:48:13,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:13,668 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-10-14 17:48:13,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:13,668 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2024-10-14 17:48:13,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 17:48:13,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:13,672 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 17:48:13,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:48:13,673 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-14 17:48:13,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:13,674 INFO L85 PathProgramCache]: Analyzing trace with hash 94294573, now seen corresponding path program 1 times [2024-10-14 17:48:13,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:13,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664570358] [2024-10-14 17:48:13,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:13,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:13,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:13,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:13,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664570358] [2024-10-14 17:48:13,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664570358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:13,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:13,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:48:13,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568797707] [2024-10-14 17:48:13,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:13,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:48:13,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:13,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:48:13,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:48:13,818 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:13,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:13,866 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2024-10-14 17:48:13,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:48:13,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 17:48:13,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:13,867 INFO L225 Difference]: With dead ends: 20 [2024-10-14 17:48:13,867 INFO L226 Difference]: Without dead ends: 20 [2024-10-14 17:48:13,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:48:13,868 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:13,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 5 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:48:13,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-14 17:48:13,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-14 17:48:13,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:13,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2024-10-14 17:48:13,875 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 5 [2024-10-14 17:48:13,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:13,875 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2024-10-14 17:48:13,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:13,875 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2024-10-14 17:48:13,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 17:48:13,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:13,875 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 17:48:13,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:48:13,876 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-14 17:48:13,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:13,878 INFO L85 PathProgramCache]: Analyzing trace with hash 94294574, now seen corresponding path program 1 times [2024-10-14 17:48:13,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:13,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784428577] [2024-10-14 17:48:13,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:13,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:13,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:13,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:13,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784428577] [2024-10-14 17:48:13,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784428577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:13,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:13,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 17:48:13,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644746395] [2024-10-14 17:48:13,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:13,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:48:13,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:13,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:48:13,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:48:13,949 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:13,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:13,976 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2024-10-14 17:48:13,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:48:13,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 17:48:13,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:13,977 INFO L225 Difference]: With dead ends: 18 [2024-10-14 17:48:13,977 INFO L226 Difference]: Without dead ends: 18 [2024-10-14 17:48:13,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:48:13,978 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 13 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:13,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 6 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:48:13,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-10-14 17:48:13,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-10-14 17:48:13,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:13,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-10-14 17:48:13,984 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 5 [2024-10-14 17:48:13,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:13,984 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-10-14 17:48:13,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:13,985 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-10-14 17:48:13,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 17:48:13,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:13,987 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:48:13,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 17:48:13,988 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-14 17:48:13,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:13,988 INFO L85 PathProgramCache]: Analyzing trace with hash -270805665, now seen corresponding path program 1 times [2024-10-14 17:48:13,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:13,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933435595] [2024-10-14 17:48:13,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:13,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:14,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:14,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:14,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933435595] [2024-10-14 17:48:14,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933435595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:14,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:14,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:48:14,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424985606] [2024-10-14 17:48:14,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:14,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:48:14,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:14,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:48:14,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:48:14,282 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:14,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:14,326 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2024-10-14 17:48:14,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:48:14,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-14 17:48:14,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:14,328 INFO L225 Difference]: With dead ends: 17 [2024-10-14 17:48:14,328 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 17:48:14,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:48:14,333 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:14,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 8 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:48:14,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 17:48:14,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 17:48:14,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:14,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 17:48:14,334 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2024-10-14 17:48:14,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:14,334 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 17:48:14,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:14,334 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 17:48:14,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 17:48:14,337 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 27 remaining) [2024-10-14 17:48:14,339 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 27 remaining) [2024-10-14 17:48:14,340 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 27 remaining) [2024-10-14 17:48:14,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 27 remaining) [2024-10-14 17:48:14,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 27 remaining) [2024-10-14 17:48:14,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 27 remaining) [2024-10-14 17:48:14,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 27 remaining) [2024-10-14 17:48:14,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 27 remaining) [2024-10-14 17:48:14,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 27 remaining) [2024-10-14 17:48:14,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 27 remaining) [2024-10-14 17:48:14,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 27 remaining) [2024-10-14 17:48:14,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 27 remaining) [2024-10-14 17:48:14,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 27 remaining) [2024-10-14 17:48:14,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 27 remaining) [2024-10-14 17:48:14,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 27 remaining) [2024-10-14 17:48:14,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 27 remaining) [2024-10-14 17:48:14,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 27 remaining) [2024-10-14 17:48:14,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 27 remaining) [2024-10-14 17:48:14,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 27 remaining) [2024-10-14 17:48:14,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 27 remaining) [2024-10-14 17:48:14,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 27 remaining) [2024-10-14 17:48:14,345 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 27 remaining) [2024-10-14 17:48:14,345 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 27 remaining) [2024-10-14 17:48:14,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 27 remaining) [2024-10-14 17:48:14,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 27 remaining) [2024-10-14 17:48:14,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 27 remaining) [2024-10-14 17:48:14,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (0 of 27 remaining) [2024-10-14 17:48:14,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 17:48:14,351 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:48:14,353 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 17:48:14,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 05:48:14 BoogieIcfgContainer [2024-10-14 17:48:14,361 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 17:48:14,362 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 17:48:14,362 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 17:48:14,363 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 17:48:14,363 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:48:11" (3/4) ... [2024-10-14 17:48:14,365 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 17:48:14,375 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-10-14 17:48:14,375 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-14 17:48:14,376 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-14 17:48:14,376 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-14 17:48:14,472 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 17:48:14,472 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 17:48:14,473 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 17:48:14,473 INFO L158 Benchmark]: Toolchain (without parser) took 3597.12ms. Allocated memory was 167.8MB in the beginning and 220.2MB in the end (delta: 52.4MB). Free memory was 109.3MB in the beginning and 70.1MB in the end (delta: 39.3MB). Peak memory consumption was 91.0MB. Max. memory is 16.1GB. [2024-10-14 17:48:14,473 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 167.8MB. Free memory is still 130.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:48:14,474 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.29ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 92.0MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 17:48:14,474 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.14ms. Allocated memory is still 167.8MB. Free memory was 92.0MB in the beginning and 89.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 17:48:14,474 INFO L158 Benchmark]: Boogie Preprocessor took 42.96ms. Allocated memory is still 167.8MB. Free memory was 89.9MB in the beginning and 87.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 17:48:14,474 INFO L158 Benchmark]: RCFGBuilder took 615.73ms. Allocated memory is still 167.8MB. Free memory was 87.9MB in the beginning and 135.3MB in the end (delta: -47.5MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2024-10-14 17:48:14,475 INFO L158 Benchmark]: TraceAbstraction took 2360.91ms. Allocated memory was 167.8MB in the beginning and 220.2MB in the end (delta: 52.4MB). Free memory was 134.6MB in the beginning and 75.3MB in the end (delta: 59.3MB). Peak memory consumption was 110.6MB. Max. memory is 16.1GB. [2024-10-14 17:48:14,475 INFO L158 Benchmark]: Witness Printer took 110.50ms. Allocated memory is still 220.2MB. Free memory was 75.3MB in the beginning and 70.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 17:48:14,476 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.10ms. Allocated memory is still 167.8MB. Free memory is still 130.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 406.29ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 92.0MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.14ms. Allocated memory is still 167.8MB. Free memory was 92.0MB in the beginning and 89.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.96ms. Allocated memory is still 167.8MB. Free memory was 89.9MB in the beginning and 87.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 615.73ms. Allocated memory is still 167.8MB. Free memory was 87.9MB in the beginning and 135.3MB in the end (delta: -47.5MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2360.91ms. Allocated memory was 167.8MB in the beginning and 220.2MB in the end (delta: 52.4MB). Free memory was 134.6MB in the beginning and 75.3MB in the end (delta: 59.3MB). Peak memory consumption was 110.6MB. Max. memory is 16.1GB. * Witness Printer took 110.50ms. Allocated memory is still 220.2MB. Free memory was 75.3MB in the beginning and 70.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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: 563]: 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 1 procedures, 45 locations, 27 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 204 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 204 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 216 IncrementalHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 76 mSDtfsCounter, 216 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 30 ConstructedInterpolants, 0 QuantifiedInterpolants, 509 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 27 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-14 17:48:14,513 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